./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 375e158327910cae8c3594f7d2ad0376509a1ecb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:45:16,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:45:16,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:45:16,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:45:16,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:45:16,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:45:16,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:45:16,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:45:16,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:45:16,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:45:16,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:45:16,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:45:16,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:45:16,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:45:16,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:45:16,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:45:16,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:45:16,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:45:16,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:45:16,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:45:16,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:45:16,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:45:16,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:45:16,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:45:16,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:45:16,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:45:16,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:45:16,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:45:16,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:45:16,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:45:16,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:45:16,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:45:16,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:45:16,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:45:16,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:45:16,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:45:16,964 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 08:45:16,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:45:16,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:45:16,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:45:16,975 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 08:45:16,975 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 08:45:16,976 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 08:45:16,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 08:45:16,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:45:16,977 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 08:45:16,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:45:16,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:45:16,978 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 08:45:16,979 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 08:45:16,979 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2018-11-23 08:45:16,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:45:17,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:45:17,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:45:17,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:45:17,011 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:45:17,011 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-23 08:45:17,055 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/data/70939f8dc/350a0db0c9f14ebea7c50e70bd7e1989/FLAG8113dec4c [2018-11-23 08:45:17,398 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:45:17,399 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-23 08:45:17,404 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/data/70939f8dc/350a0db0c9f14ebea7c50e70bd7e1989/FLAG8113dec4c [2018-11-23 08:45:17,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/data/70939f8dc/350a0db0c9f14ebea7c50e70bd7e1989 [2018-11-23 08:45:17,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:45:17,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:45:17,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:45:17,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:45:17,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:45:17,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb2c58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17, skipping insertion in model container [2018-11-23 08:45:17,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:45:17,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:45:17,559 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:45:17,561 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:45:17,581 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:45:17,590 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:45:17,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17 WrapperNode [2018-11-23 08:45:17,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:45:17,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:45:17,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:45:17,591 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:45:17,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:45:17,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:45:17,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:45:17,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:45:17,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... [2018-11-23 08:45:17,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:45:17,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:45:17,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:45:17,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:45:17,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:17,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:45:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:45:17,992 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:45:17,992 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-11-23 08:45:17,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:45:17 BoogieIcfgContainer [2018-11-23 08:45:17,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:45:17,993 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 08:45:17,993 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 08:45:17,995 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 08:45:17,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:45:17,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 08:45:17" (1/3) ... [2018-11-23 08:45:17,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae45b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:45:17, skipping insertion in model container [2018-11-23 08:45:17,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:45:17,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:45:17" (2/3) ... [2018-11-23 08:45:17,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae45b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:45:17, skipping insertion in model container [2018-11-23 08:45:17,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:45:17,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:45:17" (3/3) ... [2018-11-23 08:45:17,998 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-23 08:45:18,033 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:45:18,033 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 08:45:18,033 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 08:45:18,033 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 08:45:18,033 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:45:18,033 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:45:18,034 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 08:45:18,034 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:45:18,034 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 08:45:18,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-23 08:45:18,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-23 08:45:18,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 08:45:18,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,064 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 08:45:18,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-23 08:45:18,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-23 08:45:18,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 08:45:18,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,071 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 75#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 77#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 74#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 61#L313-1true [2018-11-23 08:45:18,072 INFO L796 eck$LassoCheckResult]: Loop: 61#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 64#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 69#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 67#L320true assume !(0 != start_simulation_~tmp~3); 61#L313-1true [2018-11-23 08:45:18,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2018-11-23 08:45:18,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:18,179 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:45:18,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2018-11-23 08:45:18,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:45:18,187 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:18,199 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2018-11-23 08:45:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,215 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 08:45:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:18,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-11-23 08:45:18,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-23 08:45:18,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2018-11-23 08:45:18,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 08:45:18,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-23 08:45:18,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-11-23 08:45:18,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,225 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-23 08:45:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-11-23 08:45:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 08:45:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 08:45:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-11-23 08:45:18,253 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-23 08:45:18,253 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-23 08:45:18,253 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 08:45:18,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-11-23 08:45:18,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-23 08:45:18,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 08:45:18,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,255 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 169#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 170#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 226#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 225#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 222#L313-1 [2018-11-23 08:45:18,255 INFO L796 eck$LassoCheckResult]: Loop: 222#L313-1 assume !false; 191#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 174#L262 assume !false; 213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 214#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 185#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 186#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 199#L242 assume !(0 != eval_~tmp___1~0); 200#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 206#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 192#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 179#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 180#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 210#L320 assume !(0 != start_simulation_~tmp~3); 222#L313-1 [2018-11-23 08:45:18,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2018-11-23 08:45:18,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:45:18,274 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:45:18,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2018-11-23 08:45:18,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:45:18,308 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:18,309 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-23 08:45:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,317 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2018-11-23 08:45:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:18,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2018-11-23 08:45:18,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-23 08:45:18,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2018-11-23 08:45:18,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 08:45:18,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-23 08:45:18,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2018-11-23 08:45:18,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,321 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-23 08:45:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2018-11-23 08:45:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 08:45:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 08:45:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-11-23 08:45:18,324 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-23 08:45:18,324 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-23 08:45:18,324 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 08:45:18,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2018-11-23 08:45:18,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-23 08:45:18,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 08:45:18,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,326 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 314#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 315#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 371#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 370#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 367#L313-1 [2018-11-23 08:45:18,326 INFO L796 eck$LassoCheckResult]: Loop: 367#L313-1 assume !false; 336#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 319#L262 assume !false; 358#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 359#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 330#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 344#L242 assume !(0 != eval_~tmp___1~0); 345#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 337#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 324#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 325#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 352#L320 assume !(0 != start_simulation_~tmp~3); 367#L313-1 [2018-11-23 08:45:18,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2018-11-23 08:45:18,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2018-11-23 08:45:18,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:45:18,383 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:45:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:45:18,383 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-11-23 08:45:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,466 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2018-11-23 08:45:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:45:18,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2018-11-23 08:45:18,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-11-23 08:45:18,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2018-11-23 08:45:18,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-11-23 08:45:18,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-11-23 08:45:18,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2018-11-23 08:45:18,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,470 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2018-11-23 08:45:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2018-11-23 08:45:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2018-11-23 08:45:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 08:45:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2018-11-23 08:45:18,473 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-11-23 08:45:18,473 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-11-23 08:45:18,473 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 08:45:18,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2018-11-23 08:45:18,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-23 08:45:18,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 08:45:18,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,475 INFO L794 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 532#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 533#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 591#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 590#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 587#L313-1 [2018-11-23 08:45:18,475 INFO L796 eck$LassoCheckResult]: Loop: 587#L313-1 assume !false; 554#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 535#L262 assume !false; 577#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 578#L214 assume !(0 == ~p_dw_st~0); 585#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 548#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 549#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 592#L242 assume !(0 != eval_~tmp___1~0); 568#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 569#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 546#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 555#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 542#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 543#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 572#L320 assume !(0 != start_simulation_~tmp~3); 587#L313-1 [2018-11-23 08:45:18,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2018-11-23 08:45:18,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:18,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2018-11-23 08:45:18,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:18,512 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:18,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:18,512 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-23 08:45:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,530 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-11-23 08:45:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:18,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2018-11-23 08:45:18,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-11-23 08:45:18,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2018-11-23 08:45:18,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-23 08:45:18,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-23 08:45:18,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2018-11-23 08:45:18,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,534 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-11-23 08:45:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2018-11-23 08:45:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-11-23 08:45:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 08:45:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2018-11-23 08:45:18,537 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-23 08:45:18,538 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-23 08:45:18,538 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 08:45:18,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2018-11-23 08:45:18,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-23 08:45:18,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,539 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 725#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 726#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 792#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 790#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 791#L313-1 assume !false; 803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 801#L262 [2018-11-23 08:45:18,540 INFO L796 eck$LassoCheckResult]: Loop: 801#L262 assume !false; 800#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 799#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 798#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 797#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 796#L242 assume 0 != eval_~tmp___1~0; 795#L242-1 assume !(0 == ~p_dw_st~0); 754#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 727#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 729#L139 assume !(0 == ~c_dr_pc~0); 744#L142 assume 1 == ~c_dr_pc~0; 745#L143 do_read_c_~a~0 := ~a_t~0; 750#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 784#L32-3 assume !(1 == ~p_dw_pc~0); 785#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 813#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 812#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 811#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 756#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 715#L51-3 assume 1 == ~c_dr_pc~0; 716#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 810#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 809#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 808#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 807#L82-5 ~q_read_ev~0 := 2; 806#L172 assume ~p_last_write~0 == ~c_last_read~0; 805#L173 assume ~p_num_write~0 == ~c_num_read~0; 804#L10-2 assume !false; 802#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 801#L262 [2018-11-23 08:45:18,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2018-11-23 08:45:18,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2018-11-23 08:45:18,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:18,563 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:18,564 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-11-23 08:45:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,588 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-11-23 08:45:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:18,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2018-11-23 08:45:18,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-11-23 08:45:18,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2018-11-23 08:45:18,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-23 08:45:18,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-23 08:45:18,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2018-11-23 08:45:18,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,591 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2018-11-23 08:45:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2018-11-23 08:45:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-11-23 08:45:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 08:45:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-23 08:45:18,595 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-23 08:45:18,595 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-23 08:45:18,596 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 08:45:18,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2018-11-23 08:45:18,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-23 08:45:18,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,597 INFO L794 eck$LassoCheckResult]: Stem: 980#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 946#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 947#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1014#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1013#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1003#L313-1 assume !false; 968#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 969#L262 [2018-11-23 08:45:18,597 INFO L796 eck$LassoCheckResult]: Loop: 969#L262 assume !false; 992#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 993#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1011#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1021#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1020#L242 assume 0 != eval_~tmp___1~0; 1018#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1004#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 998#L96 assume 0 == ~p_dw_pc~0; 991#L107-1 assume !false; 997#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 974#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 948#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 950#L139 assume !(0 == ~c_dr_pc~0); 965#L142 assume 1 == ~c_dr_pc~0; 966#L143 do_read_c_~a~0 := ~a_t~0; 971#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1005#L32-3 assume !(1 == ~p_dw_pc~0); 1006#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 1034#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 983#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 975#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 976#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1032#L51-3 assume 1 == ~c_dr_pc~0; 1030#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1029#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1028#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1027#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1026#L82-5 ~q_read_ev~0 := 2; 1025#L172 assume ~p_last_write~0 == ~c_last_read~0; 1024#L173 assume ~p_num_write~0 == ~c_num_read~0; 1008#L10-2 assume !false; 999#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 969#L262 [2018-11-23 08:45:18,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2018-11-23 08:45:18,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2018-11-23 08:45:18,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:18,643 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:18,644 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-11-23 08:45:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,657 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-23 08:45:18,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:18,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2018-11-23 08:45:18,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-23 08:45:18,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2018-11-23 08:45:18,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-11-23 08:45:18,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-11-23 08:45:18,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2018-11-23 08:45:18,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,660 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-23 08:45:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2018-11-23 08:45:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-23 08:45:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 08:45:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2018-11-23 08:45:18,664 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-23 08:45:18,664 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-23 08:45:18,664 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 08:45:18,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2018-11-23 08:45:18,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-23 08:45:18,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,666 INFO L794 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1176#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1177#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1250#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1249#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1242#L313-1 assume !false; 1199#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1200#L262 assume !false; 1266#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1265#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1264#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1263#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1207#L242 assume 0 != eval_~tmp___1~0; 1204#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1205#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1243#L96 assume 0 == ~p_dw_pc~0; 1231#L107-1 [2018-11-23 08:45:18,666 INFO L796 eck$LassoCheckResult]: Loop: 1231#L107-1 assume !false; 1233#L108 assume !(0 == ~q_free~0); 1193#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1194#L32 assume !(1 == ~p_dw_pc~0); 1246#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1185#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1186#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1219#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1208#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1173#L51 assume !(1 == ~c_dr_pc~0); 1169#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1170#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1175#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1232#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1230#L82-2 ~q_write_ev~0 := 2; 1231#L107-1 [2018-11-23 08:45:18,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2018-11-23 08:45:18,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2018-11-23 08:45:18,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:45:18,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:45:18,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:45:18,715 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-11-23 08:45:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:18,813 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2018-11-23 08:45:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:45:18,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2018-11-23 08:45:18,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2018-11-23 08:45:18,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2018-11-23 08:45:18,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-11-23 08:45:18,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-11-23 08:45:18,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2018-11-23 08:45:18,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:18,818 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2018-11-23 08:45:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2018-11-23 08:45:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2018-11-23 08:45:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 08:45:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2018-11-23 08:45:18,822 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-23 08:45:18,822 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-23 08:45:18,823 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 08:45:18,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2018-11-23 08:45:18,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2018-11-23 08:45:18,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:18,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:18,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:18,824 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1589#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1590#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1659#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1657#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1658#L313-1 assume !false; 1690#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1689#L262 assume !false; 1688#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1687#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1686#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1685#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1684#L242 assume 0 != eval_~tmp___1~0; 1683#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1682#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1680#L96 assume 0 == ~p_dw_pc~0; 1642#L107-1 [2018-11-23 08:45:18,825 INFO L796 eck$LassoCheckResult]: Loop: 1642#L107-1 assume !false; 1644#L108 assume !(0 == ~q_free~0); 1606#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1607#L32 assume !(1 == ~p_dw_pc~0); 1653#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1598#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1599#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1633#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1619#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1586#L51 assume 1 == ~c_dr_pc~0; 1587#L52 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1583#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1588#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1643#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1641#L82-2 ~q_write_ev~0 := 2; 1642#L107-1 [2018-11-23 08:45:18,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2018-11-23 08:45:18,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2018-11-23 08:45:18,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:18,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2018-11-23 08:45:18,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:18,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:18,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:18,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:19,019 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:45:19,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:45:19,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:45:19,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:45:19,020 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 08:45:19,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:19,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:45:19,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:45:19,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-23 08:45:19,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:45:19,021 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:45:19,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:45:19,178 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:19,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:19,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:19,187 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 08:45:19,187 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:19,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:19,202 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:19,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 08:45:19,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:19,248 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 08:45:19,249 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:45:19,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:45:19,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:45:19,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:45:19,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:45:19,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:19,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:45:19,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:45:19,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-23 08:45:19,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:45:19,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:45:19,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:19,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:45:19,413 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:45:19,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,424 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,425 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,433 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:19,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:19,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,453 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 08:45:19,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,454 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,455 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,457 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,462 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,471 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,474 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,477 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,479 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,480 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,482 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,488 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,492 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,494 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,494 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,495 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 08:45:19,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,497 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,497 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,499 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,500 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,505 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:19,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,517 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:19,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,519 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,521 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,522 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,529 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,536 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,537 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,539 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,540 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,542 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 08:45:19,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,544 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,544 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,546 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,547 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,554 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,555 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:19,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,561 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,561 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,565 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,566 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:19,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,569 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,573 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,574 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,578 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,579 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,589 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,590 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,594 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,595 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:19,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,599 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,599 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,601 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 08:45:19,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,602 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,603 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,603 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,605 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,606 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,614 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,615 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,615 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,623 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,624 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,628 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,628 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,631 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,632 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,634 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,634 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,637 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,638 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,642 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,642 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,643 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,645 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,645 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,646 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,652 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,652 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,653 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:19,656 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:19,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,658 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 08:45:19,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,659 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,662 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,676 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,678 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:19,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,687 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,693 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,695 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:19,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,697 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,703 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,710 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,718 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,724 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,736 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,764 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:19,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,769 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 08:45:19,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,770 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,771 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,773 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,773 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,775 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,788 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,788 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,790 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:19,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,800 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,807 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,807 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,809 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:19,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,810 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,811 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,812 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,813 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,814 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,815 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,817 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,818 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,824 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,828 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,829 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,847 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,847 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,849 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,851 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,851 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:19,853 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:19,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,854 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 08:45:19,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,855 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,858 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,858 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,859 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,866 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,866 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,866 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,867 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:19,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,876 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,876 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,877 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:19,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,879 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,880 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,882 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,885 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,885 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,886 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,886 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,893 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,895 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,908 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:19,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:19,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:19,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,912 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 08:45:19,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,913 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,914 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,918 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,943 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,944 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,945 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 08:45:19,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,957 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,961 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:19,961 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,962 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 08:45:19,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,966 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,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 [2018-11-23 08:45:19,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,970 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,970 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,975 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,976 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,983 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,984 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,988 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,988 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:19,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:19,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:19,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:19,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:19,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:19,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:19,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:19,995 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:19,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:19,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,002 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,002 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:20,013 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-23 08:45:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:20,041 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2018-11-23 08:45:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:20,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2018-11-23 08:45:20,043 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-11-23 08:45:20,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2018-11-23 08:45:20,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-11-23 08:45:20,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-11-23 08:45:20,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2018-11-23 08:45:20,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:20,045 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-23 08:45:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2018-11-23 08:45:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-23 08:45:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-23 08:45:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2018-11-23 08:45:20,053 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-23 08:45:20,053 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-23 08:45:20,054 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 08:45:20,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2018-11-23 08:45:20,055 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-11-23 08:45:20,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:20,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:20,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:20,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:20,055 INFO L794 eck$LassoCheckResult]: Stem: 1989#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1949#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1950#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2028#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2026#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2027#L313-1 assume !false; 2133#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2132#L262 assume !false; 2131#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2130#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2129#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2128#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1980#L242 assume 0 != eval_~tmp___1~0; 1977#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1978#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2013#L96 assume 0 == ~p_dw_pc~0; 2006#L107-1 [2018-11-23 08:45:20,056 INFO L796 eck$LassoCheckResult]: Loop: 2006#L107-1 assume !false; 2012#L108 assume !(0 == ~q_free~0); 1966#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1967#L32 assume !(1 == ~p_dw_pc~0); 2021#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1958#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1959#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1997#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1981#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1947#L51 assume !(1 == ~c_dr_pc~0); 1943#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1944#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1948#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2011#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2010#L82-2 ~q_write_ev~0 := 2; 2006#L107-1 [2018-11-23 08:45:20,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2018-11-23 08:45:20,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:20,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2018-11-23 08:45:20,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:20,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:20,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:20,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:45:20,112 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:20,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:45:20,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:45:20,112 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-11-23 08:45:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:20,152 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2018-11-23 08:45:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:45:20,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2018-11-23 08:45:20,156 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2018-11-23 08:45:20,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2018-11-23 08:45:20,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2018-11-23 08:45:20,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2018-11-23 08:45:20,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2018-11-23 08:45:20,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:20,159 INFO L705 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2018-11-23 08:45:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2018-11-23 08:45:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2018-11-23 08:45:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-23 08:45:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2018-11-23 08:45:20,164 INFO L728 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-11-23 08:45:20,164 INFO L608 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-11-23 08:45:20,164 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 08:45:20,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2018-11-23 08:45:20,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2018-11-23 08:45:20,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:20,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:20,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:20,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:20,166 INFO L794 eck$LassoCheckResult]: Stem: 2654#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2613#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2614#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2701#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2699#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2700#L313-1 assume !false; 2747#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2746#L262 assume !false; 2745#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2744#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2743#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2742#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2741#L242 assume 0 != eval_~tmp___1~0; 2740#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2688#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2680#L96 assume 0 == ~p_dw_pc~0; 2670#L107-1 [2018-11-23 08:45:20,166 INFO L796 eck$LassoCheckResult]: Loop: 2670#L107-1 assume !false; 2679#L108 assume !(0 == ~q_free~0); 2757#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2756#L32 assume !(1 == ~p_dw_pc~0); 2693#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 2622#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2623#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2664#L74 assume !(0 != immediate_notify_threads_~tmp~0); 2646#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2647#L51 assume !(1 == ~c_dr_pc~0); 2605#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2606#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2677#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2678#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 2674#L82-2 ~q_write_ev~0 := 2; 2670#L107-1 [2018-11-23 08:45:20,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:20,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2018-11-23 08:45:20,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:20,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2018-11-23 08:45:20,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:20,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2018-11-23 08:45:20,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:20,266 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:45:20,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:45:20,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:45:20,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:45:20,266 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 08:45:20,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:20,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:45:20,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:45:20,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-23 08:45:20,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:45:20,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:45:20,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:45:20,376 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:20,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:20,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:20,397 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 08:45:20,398 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:20,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:20,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:20,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 08:45:20,429 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:20,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:20,450 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:20,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 08:45:20,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:20,505 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 08:45:20,507 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:45:20,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:45:20,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:45:20,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:45:20,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:45:20,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:20,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:45:20,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:45:20,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-23 08:45:20,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:45:20,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:45:20,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:20,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:45:20,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:45:20,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,642 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,655 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:20,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:20,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,661 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 08:45:20,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,662 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,663 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,664 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,665 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,666 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,669 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,672 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,674 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,678 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,678 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,680 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,683 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,684 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,686 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 08:45:20,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,687 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,689 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,691 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,696 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,700 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,703 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,703 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,704 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,706 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,708 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,708 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,709 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 08:45:20,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,710 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,711 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,712 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,713 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,713 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,714 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:20,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,717 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,718 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,720 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,720 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,722 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,722 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,725 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,732 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,734 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,734 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:20,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,736 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:20,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,739 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,739 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,739 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:20,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,740 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,744 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,745 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,746 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,747 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,748 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,748 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,753 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,754 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,755 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,756 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,758 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,759 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,759 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,762 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,763 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,768 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,768 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,769 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 08:45:20,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,775 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 08:45:20,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,778 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 08:45:20,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,778 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,779 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,785 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,786 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,786 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,788 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,789 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,795 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,796 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,799 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,800 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,802 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,810 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,814 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,815 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,816 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,819 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,819 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,820 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 08:45:20,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,827 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,827 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,830 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 08:45:20,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,831 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,831 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,832 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,833 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,834 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,834 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,836 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,836 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,836 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,838 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:20,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,848 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,849 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,851 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,852 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,853 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,855 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,862 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,862 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,864 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,866 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,866 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,867 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:20,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 08:45:20,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,886 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,887 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 08:45:20,888 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 08:45:20,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,895 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 08:45:20,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,896 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,899 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,902 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,903 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,912 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,919 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,923 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,923 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,923 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,924 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,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 [2018-11-23 08:45:20,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,927 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:45:20,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,930 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 08:45:20,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,930 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,930 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 08:45:20,931 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:45:20,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,933 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 08:45:20,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,936 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,940 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,940 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,944 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,944 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,945 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 08:45:20,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,953 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,954 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,962 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,962 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,968 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,968 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,976 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,977 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,984 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:20,985 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,991 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 08:45:20,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:20,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:20,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:20,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:20,996 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:20,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:20,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:20,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:20,996 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:20,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:20,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:21,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:21,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:21,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 08:45:21,002 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 08:45:21,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:21,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:21,003 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:21,003 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 08:45:21,003 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 08:45:21,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:21,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:21,378 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-23 08:45:21,407 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:45:21,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:45:21,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:45:21,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:45:21,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 08:45:21,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:45:21,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:45:21,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-11-23 08:45:21,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:45:21,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:45:21,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:45:21,711 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:21,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:21,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 08:45:21,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:21,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:21,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 08:45:21,755 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:21,786 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:21,788 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 08:45:21,788 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 08:45:21,813 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 08:45:21,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 08:45:21,871 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 08:45:21,872 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:45:21,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:45:21,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:45:21,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:45:21,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:45:21,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:45:21,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:45:21,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:45:21,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-11-23 08:45:21,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:45:21,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:45:21,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:21,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:45:22,100 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:45:22,100 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:45:22,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 [2018-11-23 08:45:22,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:22,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:22,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:22,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:22,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:22,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:22,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:22,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:22,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:22,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:22,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:22,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:22,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:22,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:22,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:45:22,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:22,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:22,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:22,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:45:22,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:22,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:22,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:22,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:45:22,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:45:22,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:22,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:22,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:22,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:22,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:45:22,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:22,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:45:22,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:45:22,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:45:22,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:45:22,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:45:22,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:45:22,115 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:45:22,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:45:22,116 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 08:45:22,116 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 08:45:22,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:45:22,130 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 08:45:22,130 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 08:45:22,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:45:22,133 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 08:45:22,133 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:45:22,134 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2018-11-23 08:45:22,157 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 08:45:22,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:45:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:45:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,294 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 08:45:22,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2018-11-23 08:45:22,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50. Second operand 6 states. Result 1087 states and 1324 transitions. Complement of second has 9 states. [2018-11-23 08:45:22,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 08:45:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 08:45:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2018-11-23 08:45:22,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2018-11-23 08:45:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:45:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-23 08:45:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:45:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2018-11-23 08:45:22,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:45:22,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2018-11-23 08:45:22,468 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2018-11-23 08:45:22,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2018-11-23 08:45:22,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2018-11-23 08:45:22,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2018-11-23 08:45:22,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2018-11-23 08:45:22,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:45:22,473 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2018-11-23 08:45:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2018-11-23 08:45:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2018-11-23 08:45:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-23 08:45:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2018-11-23 08:45:22,483 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-11-23 08:45:22,483 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-11-23 08:45:22,484 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 08:45:22,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2018-11-23 08:45:22,486 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2018-11-23 08:45:22,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:22,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:22,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,487 INFO L794 eck$LassoCheckResult]: Stem: 4150#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4071#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4072#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4231#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4229#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4230#L313-1 assume !false; 4372#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4371#L262 assume !false; 4370#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4369#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4367#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4366#L242 assume 0 != eval_~tmp___1~0; 4365#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4364#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 4363#L96 assume !(0 == ~p_dw_pc~0); 4174#L99 assume 1 == ~p_dw_pc~0; 4175#L109 [2018-11-23 08:45:22,487 INFO L796 eck$LassoCheckResult]: Loop: 4175#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4083#L32 assume 1 == ~p_dw_pc~0; 4084#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 4088#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4089#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4166#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 4689#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4063#L51 assume !(1 == ~c_dr_pc~0); 4064#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4682#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4683#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4598#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 4599#L82-2 ~q_write_ev~0 := 2; 4590#L107-1 assume !false; 4591#L108 assume !(0 == ~q_free~0); 4175#L109 [2018-11-23 08:45:22,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2018-11-23 08:45:22,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:22,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:22,507 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:45:22,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2018-11-23 08:45:22,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 08:45:22,523 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:22,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:22,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:22,523 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2018-11-23 08:45:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:22,539 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2018-11-23 08:45:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:22,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2018-11-23 08:45:22,543 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2018-11-23 08:45:22,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2018-11-23 08:45:22,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2018-11-23 08:45:22,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2018-11-23 08:45:22,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2018-11-23 08:45:22,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:45:22,545 INFO L705 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2018-11-23 08:45:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2018-11-23 08:45:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-11-23 08:45:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 08:45:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2018-11-23 08:45:22,554 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-11-23 08:45:22,554 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-11-23 08:45:22,554 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 08:45:22,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2018-11-23 08:45:22,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2018-11-23 08:45:22,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:22,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:22,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,556 INFO L794 eck$LassoCheckResult]: Stem: 5135#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5097#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5098#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5176#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5174#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5175#L313-1 assume !false; 5218#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5215#L262 assume !false; 5213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5211#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5209#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5207#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5205#L242 assume 0 != eval_~tmp___1~0; 5200#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5166#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5167#L96 assume 0 == ~p_dw_pc~0; 5199#L107-1 assume !false; 5156#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5125#L247 [2018-11-23 08:45:22,556 INFO L796 eck$LassoCheckResult]: Loop: 5125#L247 assume !(0 == ~c_dr_st~0); 5100#L262 assume !false; 5150#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5151#L214 assume !(0 == ~p_dw_st~0); 5163#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5112#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5113#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5127#L242 assume 0 != eval_~tmp___1~0; 5124#L242-1 assume !(0 == ~p_dw_st~0); 5125#L247 [2018-11-23 08:45:22,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2018-11-23 08:45:22,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:45:22,574 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:45:22,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2018-11-23 08:45:22,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:45:22,598 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 08:45:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:22,598 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2018-11-23 08:45:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:22,631 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-11-23 08:45:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:22,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2018-11-23 08:45:22,635 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2018-11-23 08:45:22,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2018-11-23 08:45:22,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2018-11-23 08:45:22,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2018-11-23 08:45:22,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2018-11-23 08:45:22,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:45:22,637 INFO L705 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2018-11-23 08:45:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2018-11-23 08:45:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2018-11-23 08:45:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-23 08:45:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2018-11-23 08:45:22,640 INFO L728 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-11-23 08:45:22,640 INFO L608 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-11-23 08:45:22,640 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 08:45:22,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2018-11-23 08:45:22,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-23 08:45:22,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:22,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:22,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,642 INFO L794 eck$LassoCheckResult]: Stem: 5701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5661#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5662#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5737#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5735#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5736#L313-1 assume !false; 5803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5801#L262 assume !false; 5799#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5796#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5794#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5791#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5789#L242 assume 0 != eval_~tmp___1~0; 5788#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5782#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5781#L96 assume 0 == ~p_dw_pc~0; 5777#L107-1 assume !false; 5748#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5744#L247 [2018-11-23 08:45:22,642 INFO L796 eck$LassoCheckResult]: Loop: 5744#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 5663#L266 assume !(0 != eval_~tmp___0~1); 5664#L262 assume !false; 5776#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5774#L214 assume !(0 == ~p_dw_st~0); 5772#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5770#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5768#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5764#L242 assume 0 != eval_~tmp___1~0; 5749#L242-1 assume !(0 == ~p_dw_st~0); 5744#L247 [2018-11-23 08:45:22,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2018-11-23 08:45:22,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:22,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:45:22,675 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:45:22,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2018-11-23 08:45:22,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:22,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:22,714 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-23 08:45:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:22,724 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-11-23 08:45:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:22,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2018-11-23 08:45:22,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2018-11-23 08:45:22,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2018-11-23 08:45:22,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-11-23 08:45:22,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2018-11-23 08:45:22,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2018-11-23 08:45:22,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:22,728 INFO L705 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-11-23 08:45:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2018-11-23 08:45:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2018-11-23 08:45:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 08:45:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2018-11-23 08:45:22,731 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-11-23 08:45:22,731 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-11-23 08:45:22,732 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 08:45:22,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2018-11-23 08:45:22,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-23 08:45:22,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:22,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:22,733 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,733 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,733 INFO L794 eck$LassoCheckResult]: Stem: 6168#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6127#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6128#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6210#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6209#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6199#L313-1 assume !false; 6149#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6150#L262 assume !false; 6184#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6185#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6260#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6259#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6158#L242 assume 0 != eval_~tmp___1~0; 6159#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6257#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6256#L96 assume !(0 == ~p_dw_pc~0); 6182#L99 assume 1 == ~p_dw_pc~0; 6144#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6145#L32 assume 1 == ~p_dw_pc~0; 6174#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 6175#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6250#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6247#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6191#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6124#L51 assume !(1 == ~c_dr_pc~0); 6125#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6239#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6236#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6232#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6228#L82-2 ~q_write_ev~0 := 2; 6224#L107-1 assume !false; 6220#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6217#L247 [2018-11-23 08:45:22,733 INFO L796 eck$LassoCheckResult]: Loop: 6217#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6129#L266 assume !(0 != eval_~tmp___0~1); 6130#L262 assume !false; 6242#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6240#L214 assume !(0 == ~p_dw_st~0); 6237#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6233#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6229#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6225#L242 assume 0 != eval_~tmp___1~0; 6221#L242-1 assume !(0 == ~p_dw_st~0); 6217#L247 [2018-11-23 08:45:22,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2018-11-23 08:45:22,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:45:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:45:22,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:45:22,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:45:22,755 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:45:22,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2018-11-23 08:45:22,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:45:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:45:22,833 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2018-11-23 08:45:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:45:22,848 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2018-11-23 08:45:22,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:45:22,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2018-11-23 08:45:22,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-23 08:45:22,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2018-11-23 08:45:22,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-11-23 08:45:22,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2018-11-23 08:45:22,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2018-11-23 08:45:22,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:45:22,851 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-23 08:45:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2018-11-23 08:45:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-23 08:45:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 08:45:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-11-23 08:45:22,855 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-23 08:45:22,855 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-23 08:45:22,855 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 08:45:22,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2018-11-23 08:45:22,856 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-23 08:45:22,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:45:22,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:45:22,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:45:22,857 INFO L794 eck$LassoCheckResult]: Stem: 6599#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6560#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6561#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6642#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6640#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6641#L313-1 assume !false; 6681#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6679#L262 assume !false; 6677#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6675#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6670#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6666#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6662#L242 assume 0 != eval_~tmp___1~0; 6659#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6633#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6625#L96 assume 0 == ~p_dw_pc~0; 6626#L107-1 assume !false; 6651#L108 assume !(0 == ~q_free~0); 6577#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6567#L32 assume !(1 == ~p_dw_pc~0); 6568#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6569#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6570#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6608#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6594#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6557#L51 assume !(1 == ~c_dr_pc~0); 6558#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6692#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6690#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6688#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6687#L82-2 ~q_write_ev~0 := 2; 6686#L107-1 assume !false; 6671#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6667#L247 [2018-11-23 08:45:22,858 INFO L796 eck$LassoCheckResult]: Loop: 6667#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6562#L266 assume !(0 != eval_~tmp___0~1); 6563#L262 assume !false; 6615#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6616#L214 assume !(0 == ~p_dw_st~0); 6693#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6685#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6612#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6592#L242 assume 0 != eval_~tmp___1~0; 6593#L242-1 assume !(0 == ~p_dw_st~0); 6667#L247 [2018-11-23 08:45:22,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2018-11-23 08:45:22,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:22,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2018-11-23 08:45:22,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:45:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:45:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2018-11-23 08:45:22,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:45:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:45:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:45:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:45:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:45:23,132 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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; [?] 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; [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !false; [?] 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; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~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; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] 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; [?] assume !(0 != immediate_notify_threads_~tmp~0); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~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; [?] assume !(0 != immediate_notify_threads_~tmp___0~0); [?] ~q_write_ev~0 := 2; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [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 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; [?] assume !(0 != eval_~tmp___0~1); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [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) ----- [2018-11-23 08:45:23,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 08:45:23 BoogieIcfgContainer [2018-11-23 08:45:23,190 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 08:45:23,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:45:23,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:45:23,191 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:45:23,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:45:17" (3/4) ... [2018-11-23 08:45:23,193 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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; [?] 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; [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !false; [?] 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; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~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; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] 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; [?] assume !(0 != immediate_notify_threads_~tmp~0); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~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; [?] assume !(0 != immediate_notify_threads_~tmp___0~0); [?] ~q_write_ev~0 := 2; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [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 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; [?] assume !(0 != eval_~tmp___0~1); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [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) ----- [2018-11-23 08:45:23,518 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_464a1ecd-3d3b-4536-8786-f60069ee5228/bin-2019/uautomizer/witness.graphml [2018-11-23 08:45:23,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:45:23,519 INFO L168 Benchmark]: Toolchain (without parser) took 6104.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 958.0 MB in the beginning and 924.5 MB in the end (delta: 33.6 MB). Peak memory consumption was 336.6 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,519 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:45:23,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.35 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.62 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,520 INFO L168 Benchmark]: Boogie Preprocessor took 53.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,520 INFO L168 Benchmark]: RCFGBuilder took 321.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,521 INFO L168 Benchmark]: BuchiAutomizer took 5197.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 155.6 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,533 INFO L168 Benchmark]: Witness Printer took 327.84 ms. Allocated memory is still 1.3 GB. Free memory was 931.8 MB in the beginning and 924.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:45:23,534 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.35 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.62 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 321.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5197.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 155.6 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. * Witness Printer took 327.84 ms. Allocated memory is still 1.3 GB. Free memory was 931.8 MB in the beginning and 924.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function q_free and consists of 6 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 210 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 659 states and ocurred in iteration 10. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1747 SDtfs, 1631 SDslu, 1732 SDs, 0 SdLazy, 203 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 19ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 262]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_last_write=4, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2302d35b=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@7bfe83d0=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70770072=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d931448=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ec74cfe=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2866d324=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62d9300b=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 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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; [?] 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; [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !false; [?] 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; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~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; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] 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; [?] assume !(0 != immediate_notify_threads_~tmp~0); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~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; [?] assume !(0 != immediate_notify_threads_~tmp___0~0); [?] ~q_write_ev~0 := 2; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [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 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; [?] assume !(0 != eval_~tmp___0~1); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] 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; [?] 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; [?] assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; [?] assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; [?] assume !false; [?] 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; [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; [?] assume 0 == ~p_dw_pc~0; [?] assume !false; [?] assume !(0 == ~q_free~0); [?] ~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; [?] assume !(1 == ~p_dw_pc~0); [?] is_do_write_p_triggered_~__retres1~0 := 0; [?] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [?] 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; [?] assume !(0 != immediate_notify_threads_~tmp~0); [?] havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; [?] assume !(1 == ~c_dr_pc~0); [?] is_do_read_c_triggered_~__retres1~1 := 0; [?] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~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; [?] assume !(0 != immediate_notify_threads_~tmp___0~0); [?] ~q_write_ev~0 := 2; [?] assume !false; [?] assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196-L200] assume 1 == ~p_dw_i~0; [L197] ~p_dw_st~0 := 0; [L201-L205] assume 1 == ~c_dr_i~0; [L202] ~c_dr_st~0 := 0; [L313-L325] assume !false; [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume 0 == ~p_dw_st~0; [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume 0 == ~p_dw_st~0; [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] assume 0 != eval_~tmp~1; [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96-L104] assume 0 == ~p_dw_pc~0; [L107-L127] assume !false; [L109-L117] assume !(0 == ~q_free~0); [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32-L41] assume !(1 == ~p_dw_pc~0); [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] assume !(0 != immediate_notify_threads_~tmp~0); [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51-L60] assume !(1 == ~c_dr_pc~0); [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] assume !(0 != immediate_notify_threads_~tmp___0~0); [L125] ~q_write_ev~0 := 2; [L107-L127] assume !false; [L109-L117] assume 0 == ~q_free~0; [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~3; [L350] havoc main_~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L355] havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3; [L304] havoc start_simulation_~kernel_st~0; [L305] havoc start_simulation_~tmp~3; [L309] start_simulation_~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] start_simulation_~kernel_st~0 := 1; [L317] havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0; [L231] havoc eval_~tmp~1; [L232] havoc eval_~tmp___0~1; [L233] havoc eval_~tmp___1~0; [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] eval_~tmp~1 := eval_#t~nondet4; [L249] havoc eval_#t~nondet4; [L251-L258] COND TRUE 0 != eval_~tmp~1 [L253] ~p_dw_st~0 := 1; [L254] havoc do_write_p_#t~nondet2; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := do_write_p_#t~nondet2; [L119] havoc do_write_p_#t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L124] havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0; [L67] havoc immediate_notify_threads_~tmp~0; [L68] havoc immediate_notify_threads_~tmp___0~0; [L72] havoc is_do_write_p_triggered_#res; [L72] havoc is_do_write_p_triggered_~__retres1~0; [L29] havoc is_do_write_p_triggered_~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] is_do_write_p_triggered_~__retres1~0 := 0; [L44] is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; [L72] immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res; [L72] immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0; [L72] havoc immediate_notify_threads_#t~ret0; [L74-L78] COND FALSE !(0 != immediate_notify_threads_~tmp~0) [L80] havoc is_do_read_c_triggered_#res; [L80] havoc is_do_read_c_triggered_~__retres1~1; [L48] havoc is_do_read_c_triggered_~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] is_do_read_c_triggered_~__retres1~1 := 0; [L63] is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; [L80] immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res; [L80] immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1; [L80] havoc immediate_notify_threads_#t~ret1; [L82-L86] COND FALSE !(0 != immediate_notify_threads_~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~q_buf_0~0 := 0; [L15] ~q_free~0 := 0; [L16] ~q_read_ev~0 := 0; [L17] ~q_write_ev~0 := 0; [L18] ~p_num_write~0 := 0; [L19] ~p_last_write~0 := 0; [L20] ~p_dw_st~0 := 0; [L21] ~p_dw_pc~0 := 0; [L22] ~p_dw_i~0 := 0; [L23] ~c_num_read~0 := 0; [L24] ~c_last_read~0 := 0; [L25] ~c_dr_st~0 := 0; [L26] ~c_dr_pc~0 := 0; [L27] ~c_dr_i~0 := 0; [L134] ~a_t~0 := 0; [L350] havoc ~__retres1~3; [L336] ~q_free~0 := 1; [L337] ~q_write_ev~0 := 2; [L338] ~q_read_ev~0 := ~q_write_ev~0; [L339] ~p_num_write~0 := 0; [L340] ~p_dw_pc~0 := 0; [L341] ~p_dw_i~0 := 1; [L342] ~c_num_read~0 := 0; [L343] ~c_dr_pc~0 := 0; [L344] ~c_dr_i~0 := 1; [L304] havoc ~kernel_st~0; [L305] havoc ~tmp~3; [L309] ~kernel_st~0 := 0; [L196] COND TRUE 1 == ~p_dw_i~0 [L197] ~p_dw_st~0 := 0; [L201] COND TRUE 1 == ~c_dr_i~0 [L202] ~c_dr_st~0 := 0; [L313-L325] COND FALSE !(false) [L316] ~kernel_st~0 := 1; [L231] havoc ~tmp~1; [L232] havoc ~tmp___0~1; [L233] havoc ~tmp___1~0; [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND TRUE 0 == ~p_dw_st~0 [L215] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND TRUE 0 == ~p_dw_st~0 [L249] ~tmp~1 := #t~nondet4; [L249] havoc #t~nondet4; [L251-L258] COND TRUE 0 != ~tmp~1 [L253] ~p_dw_st~0 := 1; [L96] COND TRUE 0 == ~p_dw_pc~0 [L107-L127] COND FALSE !(false) [L109] COND FALSE !(0 == ~q_free~0) [L119] ~q_buf_0~0 := #t~nondet2; [L119] havoc #t~nondet2; [L120] ~p_last_write~0 := ~q_buf_0~0; [L121] ~p_num_write~0 := 1 + ~p_num_write~0; [L122] ~q_free~0 := 0; [L123] ~q_write_ev~0 := 1; [L67] havoc ~tmp~0; [L68] havoc ~tmp___0~0; [L29] havoc ~__retres1~0; [L32] COND FALSE !(1 == ~p_dw_pc~0) [L42] ~__retres1~0 := 0; [L44] #res := ~__retres1~0; [L72] ~tmp~0 := #t~ret0; [L72] havoc #t~ret0; [L74-L78] COND FALSE !(0 != ~tmp~0) [L48] havoc ~__retres1~1; [L51] COND FALSE !(1 == ~c_dr_pc~0) [L61] ~__retres1~1 := 0; [L63] #res := ~__retres1~1; [L80] ~tmp___0~0 := #t~ret1; [L80] havoc #t~ret1; [L82-L86] COND FALSE !(0 != ~tmp___0~0) [L125] ~q_write_ev~0 := 2; [L107-L127] COND FALSE !(false) [L109] COND TRUE 0 == ~q_free~0 [L110] ~p_dw_st~0 := 2; [L111] ~p_dw_pc~0 := 1; [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 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; [?] assume !(0 != eval_~tmp___0~1); [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; [?] assume !(0 == ~p_dw_st~0); [?] assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [?] eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; [?] assume 0 != eval_~tmp___1~0; [?] assume !(0 == ~p_dw_st~0); [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L262-L276] assume 0 == ~c_dr_st~0; [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] assume !(0 != eval_~tmp___0~1); [L237-L277] assume !false; [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214-L224] assume !(0 == ~p_dw_st~0); [L218-L223] assume 0 == ~c_dr_st~0; [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] assume 0 != eval_~tmp___1~0; [L247-L261] assume !(0 == ~p_dw_st~0); [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] eval_~tmp___0~1 := eval_#t~nondet5; [L264] havoc eval_#t~nondet5; [L266-L273] COND FALSE !(0 != eval_~tmp___0~1) [L237-L277] COND FALSE !(false) [L240] havoc exists_runnable_thread_#res; [L240] havoc exists_runnable_thread_~__retres1~2; [L211] havoc exists_runnable_thread_~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] exists_runnable_thread_~__retres1~2 := 1; [L227] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; [L240] eval_#t~ret3 := exists_runnable_thread_#res; [L240] eval_~tmp___1~0 := eval_#t~ret3; [L240] havoc eval_#t~ret3; [L242-L246] COND TRUE 0 != eval_~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L262] COND TRUE 0 == ~c_dr_st~0 [L264] ~tmp___0~1 := #t~nondet5; [L264] havoc #t~nondet5; [L266-L273] COND FALSE !(0 != ~tmp___0~1) [L237-L277] COND FALSE !(false) [L211] havoc ~__retres1~2; [L214] COND FALSE !(0 == ~p_dw_st~0) [L218] COND TRUE 0 == ~c_dr_st~0 [L219] ~__retres1~2 := 1; [L227] #res := ~__retres1~2; [L240] ~tmp___1~0 := #t~ret3; [L240] havoc #t~ret3; [L242-L246] COND TRUE 0 != ~tmp___1~0 [L247] COND FALSE !(0 == ~p_dw_st~0) [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) ----- 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...