./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 df684da5e5a56662a7be6091ec5bb0a21e1453c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:07,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:07,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:07,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:07,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:07,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:07,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:07,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:07,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:07,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:07,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:07,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:07,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:07,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:07,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:07,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:07,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:07,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:07,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:07,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:07,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:07,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:07,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:07,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:07,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:07,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:07,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:07,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:07,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:07,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:07,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:07,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:07,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:07,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:07,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:07,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:07,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:07,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:07,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:07,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:07,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:07,315 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:07,327 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:07,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:07,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:07,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:07,329 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:07,329 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:07,329 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:07,329 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:07,329 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:07,329 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:07,329 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:07,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:07,330 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:07,330 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:07,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:07,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:07,331 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:07,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:07,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:07,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:07,332 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:07,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:07,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:07,332 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:07,333 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:07,333 INFO L138 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_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 -> df684da5e5a56662a7be6091ec5bb0a21e1453c5 [2019-10-22 09:02:07,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:07,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:07,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:07,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:07,370 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:07,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2019-10-22 09:02:07,419 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/data/e2f6ff9d2/75726b4476c5423aa7bab206f46253e3/FLAG5ae1dbbf8 [2019-10-22 09:02:07,812 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:07,813 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2019-10-22 09:02:07,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/data/e2f6ff9d2/75726b4476c5423aa7bab206f46253e3/FLAG5ae1dbbf8 [2019-10-22 09:02:08,212 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/data/e2f6ff9d2/75726b4476c5423aa7bab206f46253e3 [2019-10-22 09:02:08,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:08,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:08,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:08,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:08,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:08,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69526298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08, skipping insertion in model container [2019-10-22 09:02:08,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:08,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:08,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:08,464 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:08,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:08,521 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:08,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08 WrapperNode [2019-10-22 09:02:08,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:08,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:08,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:08,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:08,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:08,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:08,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:08,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:08,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... [2019-10-22 09:02:08,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:08,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:08,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:08,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:08,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:08,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:08,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:09,150 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:09,151 INFO L284 CfgBuilder]: Removed 60 assume(true) statements. [2019-10-22 09:02:09,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:09 BoogieIcfgContainer [2019-10-22 09:02:09,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:09,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:09,153 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:09,156 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:09,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:09,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:08" (1/3) ... [2019-10-22 09:02:09,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f4a936e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:09, skipping insertion in model container [2019-10-22 09:02:09,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:09,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:08" (2/3) ... [2019-10-22 09:02:09,159 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f4a936e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:09, skipping insertion in model container [2019-10-22 09:02:09,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:09,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:09" (3/3) ... [2019-10-22 09:02:09,160 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2019-10-22 09:02:09,198 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:09,198 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:09,198 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:09,199 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:09,199 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:09,199 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:09,199 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:09,199 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:09,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2019-10-22 09:02:09,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-10-22 09:02:09,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,242 INFO L849 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] [2019-10-22 09:02:09,243 INFO L850 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] [2019-10-22 09:02:09,243 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:09,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2019-10-22 09:02:09,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-10-22 09:02:09,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,248 INFO L849 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] [2019-10-22 09:02:09,249 INFO L850 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] [2019-10-22 09:02:09,254 INFO L791 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 14#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; 76#L452true havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 11#L212true assume !(1 == ~q_req_up~0); 9#L212-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 43#L227-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 56#L232-1true assume !(0 == ~q_read_ev~0); 59#L265-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 22#L270-1true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 42#L55true assume 1 == ~p_dw_pc~0; 72#L56true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 44#L66true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 74#L67true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 69#L305true assume !(0 != activate_threads_~tmp~1); 75#L305-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 62#L74true assume !(1 == ~c_dr_pc~0); 32#L74-2true is_do_read_c_triggered_~__retres1~1 := 0; 63#L85true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 91#L86true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 77#L313true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 78#L313-2true assume !(1 == ~q_read_ev~0); 50#L283-1true assume !(1 == ~q_write_ev~0); 3#L409-1true [2019-10-22 09:02:09,255 INFO L793 eck$LassoCheckResult]: Loop: 3#L409-1true assume !false; 47#L410true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4#L354true assume false; 40#L370true start_simulation_~kernel_st~0 := 2; 7#L212-2true assume !(1 == ~q_req_up~0); 5#L212-3true start_simulation_~kernel_st~0 := 3; 57#L265-2true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 51#L265-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 16#L270-3true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12#L55-3true assume 1 == ~p_dw_pc~0; 68#L56-1true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 41#L66-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 70#L67-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 53#L305-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 58#L305-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 30#L74-3true assume 1 == ~c_dr_pc~0; 87#L75-1true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 34#L85-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 88#L86-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 80#L313-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 61#L313-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 73#L283-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 81#L288-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13#L245-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 65#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 92#L258-1true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 33#L384true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 19#L391true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L392true start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 84#L426true assume !(0 != start_simulation_~tmp~4); 3#L409-1true [2019-10-22 09:02:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1146955365, now seen corresponding path program 1 times [2019-10-22 09:02:09,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099493479] [2019-10-22 09:02:09,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099493479] [2019-10-22 09:02:09,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:09,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204824864] [2019-10-22 09:02:09,382 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:09,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1868636057, now seen corresponding path program 1 times [2019-10-22 09:02:09,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192103806] [2019-10-22 09:02:09,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192103806] [2019-10-22 09:02:09,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:09,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532444258] [2019-10-22 09:02:09,396 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:09,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,413 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 3 states. [2019-10-22 09:02:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,432 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2019-10-22 09:02:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 135 transitions. [2019-10-22 09:02:09,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-10-22 09:02:09,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 128 transitions. [2019-10-22 09:02:09,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-10-22 09:02:09,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-10-22 09:02:09,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2019-10-22 09:02:09,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:09,445 INFO L688 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-10-22 09:02:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2019-10-22 09:02:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-10-22 09:02:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-22 09:02:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2019-10-22 09:02:09,477 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-10-22 09:02:09,477 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-10-22 09:02:09,477 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:09,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 128 transitions. [2019-10-22 09:02:09,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-10-22 09:02:09,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,480 INFO L849 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] [2019-10-22 09:02:09,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,480 INFO L791 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 218#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; 219#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 216#L212 assume !(1 == ~q_req_up~0); 207#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 208#L227-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 253#L232-1 assume !(0 == ~q_read_ev~0); 264#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 229#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 230#L55 assume 1 == ~p_dw_pc~0; 252#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 246#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 254#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 275#L305 assume !(0 != activate_threads_~tmp~1); 276#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 267#L74 assume !(1 == ~c_dr_pc~0); 238#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 239#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 269#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 278#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 279#L313-2 assume !(1 == ~q_read_ev~0); 256#L283-1 assume !(1 == ~q_write_ev~0); 195#L409-1 [2019-10-22 09:02:09,480 INFO L793 eck$LassoCheckResult]: Loop: 195#L409-1 assume !false; 196#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 197#L354 assume !false; 198#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 242#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 243#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 272#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 257#L334 assume !(0 != eval_~tmp___1~0); 250#L370 start_simulation_~kernel_st~0 := 2; 203#L212-2 assume !(1 == ~q_req_up~0); 199#L212-3 start_simulation_~kernel_st~0 := 3; 200#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 259#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 221#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 211#L55-3 assume 1 == ~p_dw_pc~0; 212#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 206#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 251#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 260#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 261#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 236#L74-3 assume !(1 == ~c_dr_pc~0); 233#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 234#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 241#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 280#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 265#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 266#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 277#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 213#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 215#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 271#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 240#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 223#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 224#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 249#L426 assume !(0 != start_simulation_~tmp~4); 195#L409-1 [2019-10-22 09:02:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1153867225, now seen corresponding path program 1 times [2019-10-22 09:02:09,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611350855] [2019-10-22 09:02:09,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611350855] [2019-10-22 09:02:09,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:09,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033019471] [2019-10-22 09:02:09,523 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 91737555, now seen corresponding path program 1 times [2019-10-22 09:02:09,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632169028] [2019-10-22 09:02:09,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632169028] [2019-10-22 09:02:09,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:09,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205598126] [2019-10-22 09:02:09,578 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:09,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,579 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-10-22 09:02:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,588 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2019-10-22 09:02:09,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 127 transitions. [2019-10-22 09:02:09,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-10-22 09:02:09,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 127 transitions. [2019-10-22 09:02:09,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-10-22 09:02:09,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-10-22 09:02:09,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 127 transitions. [2019-10-22 09:02:09,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:09,593 INFO L688 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-10-22 09:02:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 127 transitions. [2019-10-22 09:02:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-10-22 09:02:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-22 09:02:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2019-10-22 09:02:09,598 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-10-22 09:02:09,598 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-10-22 09:02:09,598 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:09,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 127 transitions. [2019-10-22 09:02:09,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-10-22 09:02:09,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,600 INFO L849 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] [2019-10-22 09:02:09,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,601 INFO L791 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 399#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; 400#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 392#L212 assume !(1 == ~q_req_up~0); 388#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 389#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 434#L232-1 assume !(0 == ~q_read_ev~0); 445#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 408#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 409#L55 assume 1 == ~p_dw_pc~0; 433#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 424#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 435#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 454#L305 assume !(0 != activate_threads_~tmp~1); 455#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 448#L74 assume !(1 == ~c_dr_pc~0); 419#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 420#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 450#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 459#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 460#L313-2 assume !(1 == ~q_read_ev~0); 437#L283-1 assume !(1 == ~q_write_ev~0); 376#L409-1 [2019-10-22 09:02:09,601 INFO L793 eck$LassoCheckResult]: Loop: 376#L409-1 assume !false; 377#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 378#L354 assume !false; 379#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 425#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 426#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 453#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 438#L334 assume !(0 != eval_~tmp___1~0); 431#L370 start_simulation_~kernel_st~0 := 2; 384#L212-2 assume !(1 == ~q_req_up~0); 380#L212-3 start_simulation_~kernel_st~0 := 3; 381#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 440#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 402#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 394#L55-3 assume !(1 == ~p_dw_pc~0); 386#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 387#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 432#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 441#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 442#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 417#L74-3 assume 1 == ~c_dr_pc~0; 418#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 415#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 422#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 461#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 446#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 447#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 458#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 396#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 398#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 452#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 421#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 404#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 405#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 430#L426 assume !(0 != start_simulation_~tmp~4); 376#L409-1 [2019-10-22 09:02:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 434480677, now seen corresponding path program 1 times [2019-10-22 09:02:09,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555091281] [2019-10-22 09:02:09,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555091281] [2019-10-22 09:02:09,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:09,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003231325] [2019-10-22 09:02:09,634 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 188672275, now seen corresponding path program 1 times [2019-10-22 09:02:09,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991643822] [2019-10-22 09:02:09,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991643822] [2019-10-22 09:02:09,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:09,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177042209] [2019-10-22 09:02:09,700 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:09,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:09,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,700 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. cyclomatic complexity: 42 Second operand 3 states. [2019-10-22 09:02:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,765 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2019-10-22 09:02:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 241 transitions. [2019-10-22 09:02:09,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2019-10-22 09:02:09,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 241 transitions. [2019-10-22 09:02:09,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-10-22 09:02:09,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-10-22 09:02:09,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 241 transitions. [2019-10-22 09:02:09,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:09,772 INFO L688 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2019-10-22 09:02:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 241 transitions. [2019-10-22 09:02:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-10-22 09:02:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-22 09:02:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 241 transitions. [2019-10-22 09:02:09,780 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2019-10-22 09:02:09,780 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 241 transitions. [2019-10-22 09:02:09,780 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:09,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 241 transitions. [2019-10-22 09:02:09,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2019-10-22 09:02:09,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,783 INFO L849 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] [2019-10-22 09:02:09,783 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,783 INFO L791 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 663#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; 664#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 660#L212 assume !(1 == ~q_req_up~0); 662#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 758#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 756#L232-1 assume !(0 == ~q_read_ev~0); 754#L265-1 assume !(0 == ~q_write_ev~0); 753#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 752#L55 assume 1 == ~p_dw_pc~0; 751#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 749#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 748#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 747#L305 assume !(0 != activate_threads_~tmp~1); 730#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 731#L74 assume !(1 == ~c_dr_pc~0); 684#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 685#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 720#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 732#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 733#L313-2 assume !(1 == ~q_read_ev~0); 702#L283-1 assume !(1 == ~q_write_ev~0); 703#L409-1 [2019-10-22 09:02:09,783 INFO L793 eck$LassoCheckResult]: Loop: 703#L409-1 assume !false; 781#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 775#L354 assume !false; 774#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 772#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 723#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 724#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 704#L334 assume !(0 != eval_~tmp___1~0); 706#L370 start_simulation_~kernel_st~0 := 2; 744#L212-2 assume !(1 == ~q_req_up~0); 642#L212-3 start_simulation_~kernel_st~0 := 3; 643#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 707#L265-4 assume !(0 == ~q_write_ev~0); 708#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 769#L55-3 assume !(1 == ~p_dw_pc~0); 768#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 766#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 765#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 764#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 763#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 760#L74-3 assume !(1 == ~c_dr_pc~0); 759#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 757#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 755#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 734#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 715#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 716#L283-3 assume !(1 == ~q_write_ev~0); 729#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 804#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 802#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 801#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 800#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 798#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 796#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 793#L426 assume !(0 != start_simulation_~tmp~4); 703#L409-1 [2019-10-22 09:02:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash -845383001, now seen corresponding path program 1 times [2019-10-22 09:02:09,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629914886] [2019-10-22 09:02:09,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629914886] [2019-10-22 09:02:09,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:09,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942259105] [2019-10-22 09:02:09,815 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2007131368, now seen corresponding path program 1 times [2019-10-22 09:02:09,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132653547] [2019-10-22 09:02:09,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132653547] [2019-10-22 09:02:09,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:09,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598226385] [2019-10-22 09:02:09,872 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:09,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,873 INFO L87 Difference]: Start difference. First operand 167 states and 241 transitions. cyclomatic complexity: 75 Second operand 3 states. [2019-10-22 09:02:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,923 INFO L93 Difference]: Finished difference Result 281 states and 398 transitions. [2019-10-22 09:02:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 398 transitions. [2019-10-22 09:02:09,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2019-10-22 09:02:09,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 281 states and 398 transitions. [2019-10-22 09:02:09,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2019-10-22 09:02:09,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2019-10-22 09:02:09,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 398 transitions. [2019-10-22 09:02:09,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:09,930 INFO L688 BuchiCegarLoop]: Abstraction has 281 states and 398 transitions. [2019-10-22 09:02:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 398 transitions. [2019-10-22 09:02:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2019-10-22 09:02:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-22 09:02:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2019-10-22 09:02:09,956 INFO L711 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2019-10-22 09:02:09,956 INFO L591 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2019-10-22 09:02:09,956 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:09,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 390 transitions. [2019-10-22 09:02:09,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 222 [2019-10-22 09:02:09,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,963 INFO L849 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] [2019-10-22 09:02:09,963 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,964 INFO L791 eck$LassoCheckResult]: Stem: 1149#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 1118#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; 1119#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 1115#L212 assume !(1 == ~q_req_up~0); 1117#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1156#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1157#L232-1 assume !(0 == ~q_read_ev~0); 1171#L265-1 assume !(0 == ~q_write_ev~0); 1128#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1129#L55 assume !(1 == ~p_dw_pc~0); 1144#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1145#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1191#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1192#L305 assume !(0 != activate_threads_~tmp~1); 1208#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1207#L74 assume !(1 == ~c_dr_pc~0); 1140#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1141#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1178#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1193#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1194#L313-2 assume !(1 == ~q_read_ev~0); 1161#L283-1 assume !(1 == ~q_write_ev~0); 1162#L409-1 [2019-10-22 09:02:09,964 INFO L793 eck$LassoCheckResult]: Loop: 1162#L409-1 assume !false; 1331#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1326#L354 assume !false; 1325#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1146#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1147#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1181#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1165#L334 assume !(0 != eval_~tmp___1~0); 1153#L370 start_simulation_~kernel_st~0 := 2; 1105#L212-2 assume !(1 == ~q_req_up~0); 1099#L212-3 start_simulation_~kernel_st~0 := 3; 1100#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1167#L265-4 assume !(0 == ~q_write_ev~0); 1168#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1369#L55-3 assume !(1 == ~p_dw_pc~0); 1351#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1350#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1185#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1163#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1164#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1138#L74-3 assume !(1 == ~c_dr_pc~0); 1135#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1136#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1143#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1196#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1173#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1174#L283-3 assume !(1 == ~q_write_ev~0); 1190#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1367#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1365#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1364#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1363#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1362#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 1361#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1356#L426 assume !(0 != start_simulation_~tmp~4); 1162#L409-1 [2019-10-22 09:02:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2124707736, now seen corresponding path program 1 times [2019-10-22 09:02:09,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582448038] [2019-10-22 09:02:09,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582448038] [2019-10-22 09:02:10,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:10,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915991664] [2019-10-22 09:02:10,019 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2007131368, now seen corresponding path program 2 times [2019-10-22 09:02:10,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669445487] [2019-10-22 09:02:10,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669445487] [2019-10-22 09:02:10,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:10,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798799807] [2019-10-22 09:02:10,064 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:10,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:10,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:10,065 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. cyclomatic complexity: 117 Second operand 5 states. [2019-10-22 09:02:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,126 INFO L93 Difference]: Finished difference Result 662 states and 942 transitions. [2019-10-22 09:02:10,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:10,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 942 transitions. [2019-10-22 09:02:10,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 590 [2019-10-22 09:02:10,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 662 states and 942 transitions. [2019-10-22 09:02:10,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-10-22 09:02:10,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2019-10-22 09:02:10,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 942 transitions. [2019-10-22 09:02:10,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,139 INFO L688 BuchiCegarLoop]: Abstraction has 662 states and 942 transitions. [2019-10-22 09:02:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 942 transitions. [2019-10-22 09:02:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 284. [2019-10-22 09:02:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-22 09:02:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2019-10-22 09:02:10,151 INFO L711 BuchiCegarLoop]: Abstraction has 284 states and 396 transitions. [2019-10-22 09:02:10,151 INFO L591 BuchiCegarLoop]: Abstraction has 284 states and 396 transitions. [2019-10-22 09:02:10,151 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:10,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 396 transitions. [2019-10-22 09:02:10,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2019-10-22 09:02:10,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,154 INFO L849 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] [2019-10-22 09:02:10,154 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,155 INFO L791 eck$LassoCheckResult]: Stem: 2107#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 2071#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; 2072#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 2063#L212 assume !(1 == ~q_req_up~0); 2065#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2114#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2115#L232-1 assume !(0 == ~q_read_ev~0); 2128#L265-1 assume !(0 == ~q_write_ev~0); 2131#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2176#L55 assume !(1 == ~p_dw_pc~0); 2175#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2174#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2173#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2172#L305 assume !(0 != activate_threads_~tmp~1); 2171#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2170#L74 assume !(1 == ~c_dr_pc~0); 2097#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2098#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2163#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2164#L313 assume !(0 != activate_threads_~tmp___0~1); 2270#L313-2 assume !(1 == ~q_read_ev~0); 2118#L283-1 assume !(1 == ~q_write_ev~0); 2119#L409-1 [2019-10-22 09:02:10,155 INFO L793 eck$LassoCheckResult]: Loop: 2119#L409-1 assume !false; 2266#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2049#L354 assume !false; 2050#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2104#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2105#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2141#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2120#L334 assume !(0 != eval_~tmp___1~0); 2111#L370 start_simulation_~kernel_st~0 := 2; 2055#L212-2 assume !(1 == ~q_req_up~0); 2051#L212-3 start_simulation_~kernel_st~0 := 3; 2052#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2122#L265-4 assume !(0 == ~q_write_ev~0); 2076#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2077#L55-3 assume !(1 == ~p_dw_pc~0); 2057#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2058#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2294#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2293#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2129#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2130#L74-3 assume !(1 == ~c_dr_pc~0); 2291#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2290#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2289#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2288#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2287#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2286#L283-3 assume !(1 == ~q_write_ev~0); 2283#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2282#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2279#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2278#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2274#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2272#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2271#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2269#L426 assume !(0 != start_simulation_~tmp~4); 2119#L409-1 [2019-10-22 09:02:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 1 times [2019-10-22 09:02:10,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921138661] [2019-10-22 09:02:10,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,195 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1306066790, now seen corresponding path program 1 times [2019-10-22 09:02:10,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146510139] [2019-10-22 09:02:10,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146510139] [2019-10-22 09:02:10,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:10,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419796350] [2019-10-22 09:02:10,240 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:10,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:10,241 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-10-22 09:02:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,312 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2019-10-22 09:02:10,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:10,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 586 transitions. [2019-10-22 09:02:10,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 368 [2019-10-22 09:02:10,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 430 states and 586 transitions. [2019-10-22 09:02:10,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2019-10-22 09:02:10,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2019-10-22 09:02:10,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 430 states and 586 transitions. [2019-10-22 09:02:10,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,320 INFO L688 BuchiCegarLoop]: Abstraction has 430 states and 586 transitions. [2019-10-22 09:02:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states and 586 transitions. [2019-10-22 09:02:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 296. [2019-10-22 09:02:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-22 09:02:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 408 transitions. [2019-10-22 09:02:10,335 INFO L711 BuchiCegarLoop]: Abstraction has 296 states and 408 transitions. [2019-10-22 09:02:10,335 INFO L591 BuchiCegarLoop]: Abstraction has 296 states and 408 transitions. [2019-10-22 09:02:10,335 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:10,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 408 transitions. [2019-10-22 09:02:10,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 240 [2019-10-22 09:02:10,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,343 INFO L849 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] [2019-10-22 09:02:10,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,343 INFO L791 eck$LassoCheckResult]: Stem: 2835#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 2802#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; 2803#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 2794#L212 assume !(1 == ~q_req_up~0); 2796#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2843#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2844#L232-1 assume !(0 == ~q_read_ev~0); 2858#L265-1 assume !(0 == ~q_write_ev~0); 2814#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2815#L55 assume !(1 == ~p_dw_pc~0); 2906#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2845#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2846#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2903#L305 assume !(0 != activate_threads_~tmp~1); 2883#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2863#L74 assume !(1 == ~c_dr_pc~0); 2864#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2866#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2867#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2884#L313 assume !(0 != activate_threads_~tmp___0~1); 2885#L313-2 assume !(1 == ~q_read_ev~0); 2849#L283-1 assume !(1 == ~q_write_ev~0); 2777#L409-1 [2019-10-22 09:02:10,343 INFO L793 eck$LassoCheckResult]: Loop: 2777#L409-1 assume !false; 2778#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2805#L354 assume !false; 2962#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2961#L245 assume !(0 == ~p_dw_st~0); 2957#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 2954#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2950#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2913#L334 assume !(0 != eval_~tmp___1~0); 2915#L370 start_simulation_~kernel_st~0 := 2; 2946#L212-2 assume !(1 == ~q_req_up~0); 2781#L212-3 start_simulation_~kernel_st~0 := 3; 2782#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2852#L265-4 assume !(0 == ~q_write_ev~0); 2807#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2808#L55-3 assume !(1 == ~p_dw_pc~0); 2788#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2789#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2879#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2853#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2854#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2824#L74-3 assume !(1 == ~c_dr_pc~0); 2821#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2822#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2829#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2888#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2889#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2880#L283-3 assume !(1 == ~q_write_ev~0); 2881#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2890#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3071#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3069#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3068#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3064#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3062#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2891#L426 assume !(0 != start_simulation_~tmp~4); 2777#L409-1 [2019-10-22 09:02:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 2 times [2019-10-22 09:02:10,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072867197] [2019-10-22 09:02:10,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,365 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash -100688383, now seen corresponding path program 1 times [2019-10-22 09:02:10,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261741326] [2019-10-22 09:02:10,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261741326] [2019-10-22 09:02:10,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:10,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094177468] [2019-10-22 09:02:10,407 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:10,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:10,408 INFO L87 Difference]: Start difference. First operand 296 states and 408 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-10-22 09:02:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,470 INFO L93 Difference]: Finished difference Result 532 states and 732 transitions. [2019-10-22 09:02:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:10,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 732 transitions. [2019-10-22 09:02:10,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 476 [2019-10-22 09:02:10,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 732 transitions. [2019-10-22 09:02:10,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2019-10-22 09:02:10,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2019-10-22 09:02:10,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 732 transitions. [2019-10-22 09:02:10,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,480 INFO L688 BuchiCegarLoop]: Abstraction has 532 states and 732 transitions. [2019-10-22 09:02:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 732 transitions. [2019-10-22 09:02:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 302. [2019-10-22 09:02:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-22 09:02:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 410 transitions. [2019-10-22 09:02:10,490 INFO L711 BuchiCegarLoop]: Abstraction has 302 states and 410 transitions. [2019-10-22 09:02:10,490 INFO L591 BuchiCegarLoop]: Abstraction has 302 states and 410 transitions. [2019-10-22 09:02:10,490 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:10,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 410 transitions. [2019-10-22 09:02:10,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2019-10-22 09:02:10,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,493 INFO L849 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] [2019-10-22 09:02:10,493 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,493 INFO L791 eck$LassoCheckResult]: Stem: 3675#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 3642#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; 3643#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 3634#L212 assume !(1 == ~q_req_up~0); 3636#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3683#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3684#L232-1 assume !(0 == ~q_read_ev~0); 3700#L265-1 assume !(0 == ~q_write_ev~0); 3652#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3653#L55 assume !(1 == ~p_dw_pc~0); 3738#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3685#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3686#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3735#L305 assume !(0 != activate_threads_~tmp~1); 3719#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3703#L74 assume !(1 == ~c_dr_pc~0); 3704#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3706#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3707#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3720#L313 assume !(0 != activate_threads_~tmp___0~1); 3721#L313-2 assume !(1 == ~q_read_ev~0); 3689#L283-1 assume !(1 == ~q_write_ev~0); 3690#L409-1 [2019-10-22 09:02:10,493 INFO L793 eck$LassoCheckResult]: Loop: 3690#L409-1 assume !false; 3791#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3779#L354 assume !false; 3777#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3775#L245 assume !(0 == ~p_dw_st~0); 3772#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 3769#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3767#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 3764#L334 assume !(0 != eval_~tmp___1~0); 3761#L370 start_simulation_~kernel_st~0 := 2; 3756#L212-2 assume !(1 == ~q_req_up~0); 3751#L212-3 start_simulation_~kernel_st~0 := 3; 3749#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3747#L265-4 assume !(0 == ~q_write_ev~0); 3744#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3637#L55-3 assume !(1 == ~p_dw_pc~0); 3638#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 3837#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3835#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3833#L305-3 assume !(0 != activate_threads_~tmp~1); 3831#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3819#L74-3 assume !(1 == ~c_dr_pc~0); 3817#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3816#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3815#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3814#L313-3 assume !(0 != activate_threads_~tmp___0~1); 3812#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3808#L283-3 assume !(1 == ~q_write_ev~0); 3804#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3803#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3801#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3800#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3799#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3798#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3797#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3794#L426 assume !(0 != start_simulation_~tmp~4); 3690#L409-1 [2019-10-22 09:02:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 3 times [2019-10-22 09:02:10,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020109512] [2019-10-22 09:02:10,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,510 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1689036285, now seen corresponding path program 1 times [2019-10-22 09:02:10,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687758079] [2019-10-22 09:02:10,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687758079] [2019-10-22 09:02:10,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:10,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130943451] [2019-10-22 09:02:10,550 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:10,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,551 INFO L87 Difference]: Start difference. First operand 302 states and 410 transitions. cyclomatic complexity: 110 Second operand 3 states. [2019-10-22 09:02:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,574 INFO L93 Difference]: Finished difference Result 375 states and 490 transitions. [2019-10-22 09:02:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:10,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 490 transitions. [2019-10-22 09:02:10,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2019-10-22 09:02:10,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 490 transitions. [2019-10-22 09:02:10,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2019-10-22 09:02:10,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2019-10-22 09:02:10,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 490 transitions. [2019-10-22 09:02:10,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,580 INFO L688 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2019-10-22 09:02:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 490 transitions. [2019-10-22 09:02:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2019-10-22 09:02:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-10-22 09:02:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 490 transitions. [2019-10-22 09:02:10,587 INFO L711 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2019-10-22 09:02:10,587 INFO L591 BuchiCegarLoop]: Abstraction has 375 states and 490 transitions. [2019-10-22 09:02:10,587 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:02:10,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 490 transitions. [2019-10-22 09:02:10,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2019-10-22 09:02:10,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,590 INFO L849 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] [2019-10-22 09:02:10,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,590 INFO L791 eck$LassoCheckResult]: Stem: 4355#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 4324#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; 4325#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 4321#L212 assume !(1 == ~q_req_up~0); 4323#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4363#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4364#L232-1 assume !(0 == ~q_read_ev~0); 4383#L265-1 assume !(0 == ~q_write_ev~0); 4335#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4336#L55 assume !(1 == ~p_dw_pc~0); 4426#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 4365#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4366#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4423#L305 assume !(0 != activate_threads_~tmp~1); 4406#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4388#L74 assume !(1 == ~c_dr_pc~0); 4347#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 4348#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4390#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4407#L313 assume !(0 != activate_threads_~tmp___0~1); 4408#L313-2 assume !(1 == ~q_read_ev~0); 4372#L283-1 assume !(1 == ~q_write_ev~0); 4373#L409-1 assume !false; 4504#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4494#L354 assume !false; 4493#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4489#L245 assume !(0 == ~p_dw_st~0); 4487#L249 [2019-10-22 09:02:10,592 INFO L793 eck$LassoCheckResult]: Loop: 4487#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 4486#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4485#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4483#L334 assume 0 != eval_~tmp___1~0; 4484#L334-1 assume !(0 == ~p_dw_st~0); 4433#L339 assume !(0 == ~c_dr_st~0); 4496#L354 assume !false; 4384#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4385#L245 assume !(0 == ~p_dw_st~0); 4487#L249 [2019-10-22 09:02:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 1 times [2019-10-22 09:02:10,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727546889] [2019-10-22 09:02:10,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727546889] [2019-10-22 09:02:10,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:10,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694737775] [2019-10-22 09:02:10,613 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,613 INFO L82 PathProgramCache]: Analyzing trace with hash 145107811, now seen corresponding path program 1 times [2019-10-22 09:02:10,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963528952] [2019-10-22 09:02:10,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963528952] [2019-10-22 09:02:10,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:10,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983633378] [2019-10-22 09:02:10,651 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:10,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:10,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:10,652 INFO L87 Difference]: Start difference. First operand 375 states and 490 transitions. cyclomatic complexity: 117 Second operand 5 states. [2019-10-22 09:02:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,729 INFO L93 Difference]: Finished difference Result 415 states and 530 transitions. [2019-10-22 09:02:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:10,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 530 transitions. [2019-10-22 09:02:10,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 341 [2019-10-22 09:02:10,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 415 states and 530 transitions. [2019-10-22 09:02:10,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 415 [2019-10-22 09:02:10,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2019-10-22 09:02:10,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 530 transitions. [2019-10-22 09:02:10,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,736 INFO L688 BuchiCegarLoop]: Abstraction has 415 states and 530 transitions. [2019-10-22 09:02:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 530 transitions. [2019-10-22 09:02:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2019-10-22 09:02:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-10-22 09:02:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 486 transitions. [2019-10-22 09:02:10,743 INFO L711 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2019-10-22 09:02:10,743 INFO L591 BuchiCegarLoop]: Abstraction has 375 states and 486 transitions. [2019-10-22 09:02:10,743 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:02:10,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 486 transitions. [2019-10-22 09:02:10,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 301 [2019-10-22 09:02:10,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,745 INFO L849 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] [2019-10-22 09:02:10,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,746 INFO L791 eck$LassoCheckResult]: Stem: 5161#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 5129#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; 5130#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 5122#L212 assume !(1 == ~q_req_up~0); 5124#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5167#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5168#L232-1 assume !(0 == ~q_read_ev~0); 5187#L265-1 assume !(0 == ~q_write_ev~0); 5140#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5141#L55 assume !(1 == ~p_dw_pc~0); 5237#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 5169#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5170#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 5234#L305 assume !(0 != activate_threads_~tmp~1); 5215#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5192#L74 assume !(1 == ~c_dr_pc~0); 5193#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 5195#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5196#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5216#L313 assume !(0 != activate_threads_~tmp___0~1); 5217#L313-2 assume !(1 == ~q_read_ev~0); 5178#L283-1 assume !(1 == ~q_write_ev~0); 5179#L409-1 assume !false; 5173#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 5174#L354 assume !false; 5188#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5189#L245 assume !(0 == ~p_dw_st~0); 5160#L249 [2019-10-22 09:02:10,746 INFO L793 eck$LassoCheckResult]: Loop: 5160#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5175#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5317#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 5316#L334 assume 0 != eval_~tmp___1~0; 5315#L334-1 assume !(0 == ~p_dw_st~0); 5312#L339 assume !(0 == ~c_dr_st~0); 5302#L354 assume !false; 5300#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5159#L245 assume !(0 == ~p_dw_st~0); 5160#L249 [2019-10-22 09:02:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 2 times [2019-10-22 09:02:10,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397153833] [2019-10-22 09:02:10,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397153833] [2019-10-22 09:02:10,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:10,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949520285] [2019-10-22 09:02:10,767 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash -534950559, now seen corresponding path program 1 times [2019-10-22 09:02:10,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131123387] [2019-10-22 09:02:10,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131123387] [2019-10-22 09:02:10,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:10,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814637441] [2019-10-22 09:02:10,779 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:10,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,780 INFO L87 Difference]: Start difference. First operand 375 states and 486 transitions. cyclomatic complexity: 113 Second operand 3 states. [2019-10-22 09:02:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,803 INFO L93 Difference]: Finished difference Result 489 states and 622 transitions. [2019-10-22 09:02:10,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:10,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 489 states and 622 transitions. [2019-10-22 09:02:10,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-10-22 09:02:10,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 489 states to 489 states and 622 transitions. [2019-10-22 09:02:10,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 489 [2019-10-22 09:02:10,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 489 [2019-10-22 09:02:10,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 622 transitions. [2019-10-22 09:02:10,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,810 INFO L688 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2019-10-22 09:02:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 622 transitions. [2019-10-22 09:02:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-10-22 09:02:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-22 09:02:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 622 transitions. [2019-10-22 09:02:10,819 INFO L711 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2019-10-22 09:02:10,819 INFO L591 BuchiCegarLoop]: Abstraction has 489 states and 622 transitions. [2019-10-22 09:02:10,819 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:02:10,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 622 transitions. [2019-10-22 09:02:10,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-10-22 09:02:10,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,822 INFO L849 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] [2019-10-22 09:02:10,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,822 INFO L791 eck$LassoCheckResult]: Stem: 6032#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 5999#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; 6000#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 5993#L212 assume !(1 == ~q_req_up~0); 5995#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6038#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6039#L232-1 assume !(0 == ~q_read_ev~0); 6056#L265-1 assume !(0 == ~q_write_ev~0); 6010#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6011#L55 assume !(1 == ~p_dw_pc~0); 6099#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6040#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6041#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6096#L305 assume !(0 != activate_threads_~tmp~1); 6078#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6059#L74 assume !(1 == ~c_dr_pc~0); 6060#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6410#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6409#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6408#L313 assume !(0 != activate_threads_~tmp___0~1); 6081#L313-2 assume !(1 == ~q_read_ev~0); 6045#L283-1 assume !(1 == ~q_write_ev~0); 6046#L409-1 assume !false; 6403#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 6401#L354 assume !false; 6399#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6314#L245 assume !(0 == ~p_dw_st~0); 6316#L249 [2019-10-22 09:02:10,825 INFO L793 eck$LassoCheckResult]: Loop: 6316#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6155#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6311#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 6292#L334 assume 0 != eval_~tmp___1~0; 6207#L334-1 assume !(0 == ~p_dw_st~0); 6203#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 6196#L358 assume !(0 != eval_~tmp___0~2); 6197#L354 assume !false; 6321#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6317#L245 assume !(0 == ~p_dw_st~0); 6316#L249 [2019-10-22 09:02:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1163376516, now seen corresponding path program 3 times [2019-10-22 09:02:10,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881681078] [2019-10-22 09:02:10,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881681078] [2019-10-22 09:02:10,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:10,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313659783] [2019-10-22 09:02:10,859 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash 545725425, now seen corresponding path program 1 times [2019-10-22 09:02:10,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271130832] [2019-10-22 09:02:10,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,869 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,923 INFO L87 Difference]: Start difference. First operand 489 states and 622 transitions. cyclomatic complexity: 135 Second operand 3 states. [2019-10-22 09:02:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,945 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2019-10-22 09:02:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:10,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 427 transitions. [2019-10-22 09:02:10,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2019-10-22 09:02:10,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 344 states and 427 transitions. [2019-10-22 09:02:10,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 344 [2019-10-22 09:02:10,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 344 [2019-10-22 09:02:10,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 427 transitions. [2019-10-22 09:02:10,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:10,950 INFO L688 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2019-10-22 09:02:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 427 transitions. [2019-10-22 09:02:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-10-22 09:02:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-22 09:02:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2019-10-22 09:02:10,956 INFO L711 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2019-10-22 09:02:10,957 INFO L591 BuchiCegarLoop]: Abstraction has 344 states and 427 transitions. [2019-10-22 09:02:10,957 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:02:10,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 427 transitions. [2019-10-22 09:02:10,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2019-10-22 09:02:10,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,959 INFO L849 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, 1] [2019-10-22 09:02:10,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:10,960 INFO L791 eck$LassoCheckResult]: Stem: 6875#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 6841#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; 6842#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 6835#L212 assume !(1 == ~q_req_up~0); 6837#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6883#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6884#L232-1 assume !(0 == ~q_read_ev~0); 6901#L265-1 assume !(0 == ~q_write_ev~0); 6904#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6882#L55 assume !(1 == ~p_dw_pc~0); 6873#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6874#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6885#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6952#L305 assume !(0 != activate_threads_~tmp~1); 6923#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6907#L74 assume !(1 == ~c_dr_pc~0); 6866#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6867#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6909#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6924#L313 assume !(0 != activate_threads_~tmp___0~1); 6925#L313-2 assume !(1 == ~q_read_ev~0); 6892#L283-1 assume !(1 == ~q_write_ev~0); 6893#L409-1 assume !false; 7095#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 7093#L354 assume !false; 7091#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7088#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 7086#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7085#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 7084#L334 assume 0 != eval_~tmp___1~0; 7083#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 7082#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 7008#L118 assume 0 == ~p_dw_pc~0; 7006#L129-1 [2019-10-22 09:02:10,960 INFO L793 eck$LassoCheckResult]: Loop: 7006#L129-1 assume !false; 6986#L130 assume !(0 == ~q_free~0); 6987#L131 ~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_req_up~0 := 1; 7006#L129-1 [2019-10-22 09:02:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash 316097349, now seen corresponding path program 1 times [2019-10-22 09:02:10,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585142362] [2019-10-22 09:02:10,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 206771, now seen corresponding path program 1 times [2019-10-22 09:02:10,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685364266] [2019-10-22 09:02:10,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2006979089, now seen corresponding path program 1 times [2019-10-22 09:02:10,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958686097] [2019-10-22 09:02:10,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:11,007 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:11,039 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:11,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:11,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:11,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:11,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:11,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:11,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:11,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2.cil-2.c_Iteration12_Loop [2019-10-22 09:02:11,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:11,041 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:11,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,144 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:11,144 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:11,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:11,151 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,158 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:11,158 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_req_up~0=1} Honda state: {~q_req_up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:11,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:11,166 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,175 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:11,175 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_buf_0~0=6, ~p_last_write~0=6, ULTIMATE.start_do_write_p_#t~nondet2=6} Honda state: {~q_buf_0~0=6, ~p_last_write~0=6, ULTIMATE.start_do_write_p_#t~nondet2=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:11,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:11,189 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:11,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:11,201 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:11,220 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=1}, {~p_num_write~0=1}, {~p_num_write~0=-1}] Lambdas: [0, 2, 1] Nus: [1, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:11,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:11,227 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:11,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:11,241 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,254 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:11,256 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:11,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:11,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:11,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:11,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:11,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:11,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:11,257 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2.cil-2.c_Iteration12_Loop [2019-10-22 09:02:11,257 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:11,257 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:11,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,338 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:11,343 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:11,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,357 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,358 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,367 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:02:11,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,370 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,370 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:02:11,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,374 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,375 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:02:11,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,379 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,379 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,389 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,390 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:02:11,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,391 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:02:11,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,392 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,392 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,399 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,399 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,400 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,406 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,406 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,407 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:11,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,416 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,417 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,420 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:02:11,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,422 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,422 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:02:11,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,426 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,435 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:02:11,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,442 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,442 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,443 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:02:11,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,453 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,453 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:02:11,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,455 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:02:11,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,455 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,455 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,456 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,457 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:02:11,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,469 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,469 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,470 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,470 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:02:11,470 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,483 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,483 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,484 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,484 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,485 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,492 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,492 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,492 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,494 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:02:11,495 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:02:11,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,496 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:02:11,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,497 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,497 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:02:11,497 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,497 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,498 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,503 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,504 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:02:11,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,504 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,505 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,524 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,525 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:02:11,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,526 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,526 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,528 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:11,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,544 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,544 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:02:11,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,545 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,547 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,550 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:02:11,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,551 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,551 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,551 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,553 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:02:11,553 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,562 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,562 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,562 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,563 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,565 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:02:11,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,601 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,601 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,601 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,601 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,608 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:02:11,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,635 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,635 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,636 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:02:11,644 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:02:11,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,645 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:02:11,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,646 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,646 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,647 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,647 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,655 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,655 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,655 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,656 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,663 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,663 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,663 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,664 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,665 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:11,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,674 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,674 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:02:11,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,674 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:02:11,675 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:11,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,679 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:02:11,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,680 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,680 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,681 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:02:11,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,690 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,690 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,691 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:02:11,691 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,702 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,702 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,703 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,703 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:11,703 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:02:11,704 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:02:11,704 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,730 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:02:11,730 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:02:11,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,730 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:02:11,731 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,996 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-10-22 09:02:12,062 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:12,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:12,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:12,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:12,062 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:12,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:12,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:12,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2.cil-2.c_Iteration12_Lasso [2019-10-22 09:02:12,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:12,063 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:12,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:12,446 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:12,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,459 INFO L440 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_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:12,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,471 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,471 INFO L440 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_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:12,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,479 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,480 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:12,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:12,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,494 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,494 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/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 [2019-10-22 09:02:12,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,499 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,500 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,506 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,506 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a_t~0=0} Honda state: {~a_t~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,519 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,519 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=0, ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=0, 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_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,528 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,531 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,539 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,545 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Honda state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,552 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,556 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,557 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,564 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_pc~0=0} Honda state: {~c_dr_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,574 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,577 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,577 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_i~0=0} Honda state: {~c_dr_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,584 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,587 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,587 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6=0} Honda state: {ULTIMATE.start_eval_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,594 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,602 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0, ULTIMATE.start_exists_runnable_thread_~__retres1~2=0, ULTIMATE.start_exists_runnable_thread_#res=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=1, ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,618 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,618 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_st~0=0} Honda state: {~p_dw_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,622 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:12,629 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,645 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=1}, {~p_num_write~0=1}, {~p_num_write~0=-1}] Lambdas: [0, 2, 1] Nus: [1, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,654 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_pc~0=0} Honda state: {~p_dw_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,659 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,667 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,667 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_last_read~0=0} Honda state: {~c_last_read~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,672 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,679 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,679 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_i~0=0} Honda state: {~p_dw_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,693 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,693 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret4=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,699 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,699 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,708 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,708 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~4=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,712 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:12,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,725 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:02:12,726 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:12,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:12,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:12,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:12,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:12,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:12,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:12,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2.cil-2.c_Iteration12_Lasso [2019-10-22 09:02:12,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:12,727 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:12,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:13,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:13,015 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:13,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,024 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,024 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,026 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,026 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,030 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,034 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,039 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,039 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,043 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,046 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,048 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,048 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,059 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,059 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,062 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,062 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,069 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:13,069 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:13,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:13,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:13,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:13,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:13,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:13,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:13,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:13,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:13,076 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:13,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:13,077 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 09:02:13,078 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:02:13,092 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:13,106 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:13,107 INFO L444 ModelExtractionUtils]: 4 out of 11 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:02:13,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:13,110 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-10-22 09:02:13,110 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:13,111 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2019-10-22 09:02:13,119 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 09:02:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:13,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:13,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,213 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-10-22 09:02:13,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 344 states and 427 transitions. cyclomatic complexity: 84 Second operand 5 states. [2019-10-22 09:02:13,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 344 states and 427 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 2260 states and 2825 transitions. Complement of second has 10 states. [2019-10-22 09:02:13,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2019-10-22 09:02:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 494 transitions. [2019-10-22 09:02:13,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 33 letters. Loop has 3 letters. [2019-10-22 09:02:13,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:13,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 36 letters. Loop has 3 letters. [2019-10-22 09:02:13,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:13,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 494 transitions. Stem has 33 letters. Loop has 6 letters. [2019-10-22 09:02:13,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:13,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2260 states and 2825 transitions. [2019-10-22 09:02:13,445 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1134 [2019-10-22 09:02:13,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2260 states to 1818 states and 2267 transitions. [2019-10-22 09:02:13,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1267 [2019-10-22 09:02:13,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2019-10-22 09:02:13,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1818 states and 2267 transitions. [2019-10-22 09:02:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:13,457 INFO L688 BuchiCegarLoop]: Abstraction has 1818 states and 2267 transitions. [2019-10-22 09:02:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states and 2267 transitions. [2019-10-22 09:02:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1730. [2019-10-22 09:02:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-10-22 09:02:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2161 transitions. [2019-10-22 09:02:13,488 INFO L711 BuchiCegarLoop]: Abstraction has 1730 states and 2161 transitions. [2019-10-22 09:02:13,488 INFO L591 BuchiCegarLoop]: Abstraction has 1730 states and 2161 transitions. [2019-10-22 09:02:13,488 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:02:13,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1730 states and 2161 transitions. [2019-10-22 09:02:13,496 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1068 [2019-10-22 09:02:13,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:13,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:13,497 INFO L849 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, 1, 1] [2019-10-22 09:02:13,497 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,497 INFO L791 eck$LassoCheckResult]: Stem: 9672#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 9614#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; 9615#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 9612#L212 assume !(1 == ~q_req_up~0); 9597#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 9598#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 9686#L232-1 assume !(0 == ~q_read_ev~0); 9728#L265-1 assume !(0 == ~q_write_ev~0); 9639#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 9640#L55 assume !(1 == ~p_dw_pc~0); 9670#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 9671#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9687#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9760#L305 assume !(0 != activate_threads_~tmp~1); 9761#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9736#L74 assume !(1 == ~c_dr_pc~0); 9656#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 9657#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9738#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9765#L313 assume !(0 != activate_threads_~tmp___0~1); 9766#L313-2 assume !(1 == ~q_read_ev~0); 9703#L283-1 assume !(1 == ~q_write_ev~0); 9704#L409-1 assume !false; 10449#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10447#L354 assume !false; 10445#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10443#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10441#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10439#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10437#L334 assume 0 != eval_~tmp___1~0; 10435#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10433#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10431#L118 assume !(0 == ~p_dw_pc~0); 10429#L121 assume !(1 == ~p_dw_pc~0); 10424#L129-1 [2019-10-22 09:02:13,497 INFO L793 eck$LassoCheckResult]: Loop: 10424#L129-1 assume !false; 10425#L130 assume !(0 == ~q_free~0); 10396#L131 ~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_req_up~0 := 1; 10398#L129-1 assume !false; 10395#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10393#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 10112#L358 assume 0 != eval_~tmp___0~2;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 10381#L159 assume 0 == ~c_dr_pc~0; 10348#L11-2 assume !false; 10100#L171 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 10098#L354 assume !false; 10096#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10094#L245 assume !(0 == ~p_dw_st~0); 10091#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10088#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10085#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10084#L334 assume !(0 != eval_~tmp___1~0); 10083#L370 start_simulation_~kernel_st~0 := 2; 10078#L212-2 assume !(1 == ~q_req_up~0); 10076#L212-3 start_simulation_~kernel_st~0 := 3; 10075#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 10074#L265-4 assume !(0 == ~q_write_ev~0); 10073#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10072#L55-3 assume 1 == ~p_dw_pc~0; 10070#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 10069#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10068#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10066#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10065#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10063#L74-3 assume !(1 == ~c_dr_pc~0); 10062#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 10061#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10060#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10059#L313-3 assume !(0 != activate_threads_~tmp___0~1); 10058#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 10057#L283-3 assume !(1 == ~q_write_ev~0); 10014#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10056#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10055#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10054#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 10053#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10052#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 10051#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 10050#L426 assume !(0 != start_simulation_~tmp~4); 10049#L409-1 assume !false; 10048#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10047#L354 assume !false; 10046#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10045#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10044#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10043#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10042#L334 assume 0 != eval_~tmp___1~0; 10041#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10040#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10038#L118 assume !(0 == ~p_dw_pc~0); 10039#L121 assume 1 == ~p_dw_pc~0; 10116#L131 ~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_req_up~0 := 1; 10119#L129-1 assume !false; 10115#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10111#L339 assume !(0 == ~c_dr_st~0); 10109#L354 assume !false; 10107#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10105#L245 assume !(0 == ~p_dw_st~0); 10103#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10099#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10097#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10095#L334 assume !(0 != eval_~tmp___1~0); 10093#L370 start_simulation_~kernel_st~0 := 2; 10089#L212-2 assume 1 == ~q_req_up~0; 10086#L25-3 assume 0 == ~q_free~0;~q_write_ev~0 := 0; 10087#L25-5 assume 1 == ~q_free~0;~q_read_ev~0 := 0; 10277#L30-3 ~q_ev~0 := 0;~q_req_up~0 := 0; 10357#L212-3 start_simulation_~kernel_st~0 := 3; 10356#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 10355#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 10354#L270-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10353#L55-3 assume 1 == ~p_dw_pc~0; 10352#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 10350#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10335#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10336#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 10345#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10344#L74-3 assume 1 == ~c_dr_pc~0; 10342#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 10343#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10033#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10034#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 10459#L313-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 10457#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 10456#L288-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10455#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10454#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10453#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 10452#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10451#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 10450#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 10448#L426 assume !(0 != start_simulation_~tmp~4); 10446#L409-1 assume !false; 10444#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10442#L354 assume !false; 10440#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10438#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10436#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10434#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10432#L334 assume 0 != eval_~tmp___1~0; 10430#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 10428#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 10426#L118 assume !(0 == ~p_dw_pc~0); 10423#L121 assume !(1 == ~p_dw_pc~0); 10424#L129-1 [2019-10-22 09:02:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1209083458, now seen corresponding path program 1 times [2019-10-22 09:02:13,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108782199] [2019-10-22 09:02:13,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108782199] [2019-10-22 09:02:13,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530098041] [2019-10-22 09:02:13,564 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,564 INFO L82 PathProgramCache]: Analyzing trace with hash 672189047, now seen corresponding path program 1 times [2019-10-22 09:02:13,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511641730] [2019-10-22 09:02:13,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-22 09:02:13,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511641730] [2019-10-22 09:02:13,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339264827] [2019-10-22 09:02:13,593 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:13,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,594 INFO L87 Difference]: Start difference. First operand 1730 states and 2161 transitions. cyclomatic complexity: 439 Second operand 3 states. [2019-10-22 09:02:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,612 INFO L93 Difference]: Finished difference Result 1296 states and 1625 transitions. [2019-10-22 09:02:13,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1296 states and 1625 transitions. [2019-10-22 09:02:13,618 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 610 [2019-10-22 09:02:13,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1296 states to 1296 states and 1625 transitions. [2019-10-22 09:02:13,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 735 [2019-10-22 09:02:13,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2019-10-22 09:02:13,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1296 states and 1625 transitions. [2019-10-22 09:02:13,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:13,624 INFO L688 BuchiCegarLoop]: Abstraction has 1296 states and 1625 transitions. [2019-10-22 09:02:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states and 1625 transitions. [2019-10-22 09:02:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1252. [2019-10-22 09:02:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-10-22 09:02:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1565 transitions. [2019-10-22 09:02:13,644 INFO L711 BuchiCegarLoop]: Abstraction has 1252 states and 1565 transitions. [2019-10-22 09:02:13,644 INFO L591 BuchiCegarLoop]: Abstraction has 1252 states and 1565 transitions. [2019-10-22 09:02:13,644 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 09:02:13,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1252 states and 1565 transitions. [2019-10-22 09:02:13,649 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 594 [2019-10-22 09:02:13,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:13,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:13,650 INFO L849 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, 1, 1, 1] [2019-10-22 09:02:13,650 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,650 INFO L791 eck$LassoCheckResult]: Stem: 12701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 12647#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; 12648#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 12641#L212 assume !(1 == ~q_req_up~0); 12630#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 12631#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 12716#L232-1 assume !(0 == ~q_read_ev~0); 12754#L265-1 assume !(0 == ~q_write_ev~0); 12672#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12673#L55 assume !(1 == ~p_dw_pc~0); 12699#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 12700#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12717#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12781#L305 assume !(0 != activate_threads_~tmp~1); 12782#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12759#L74 assume !(1 == ~c_dr_pc~0); 12689#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 12690#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12761#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12786#L313 assume !(0 != activate_threads_~tmp___0~1); 12787#L313-2 assume !(1 == ~q_read_ev~0); 12730#L283-1 assume !(1 == ~q_write_ev~0); 12731#L409-1 assume !false; 13203#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 13202#L354 assume !false; 13201#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13200#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 13199#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13198#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13197#L334 assume 0 != eval_~tmp___1~0; 13196#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 13195#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 13194#L118 assume 0 == ~p_dw_pc~0; 13192#L129-1 assume !false; 13193#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 13313#L339 [2019-10-22 09:02:13,650 INFO L793 eck$LassoCheckResult]: Loop: 13313#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 13177#L358 assume !(0 != eval_~tmp___0~2); 13178#L354 assume !false; 13329#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13327#L245 assume !(0 == ~p_dw_st~0); 13324#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 13287#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13320#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13317#L334 assume 0 != eval_~tmp___1~0; 13315#L334-1 assume !(0 == ~p_dw_st~0); 13313#L339 [2019-10-22 09:02:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1173119927, now seen corresponding path program 1 times [2019-10-22 09:02:13,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382832375] [2019-10-22 09:02:13,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382832375] [2019-10-22 09:02:13,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:13,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137996440] [2019-10-22 09:02:13,667 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash -474460271, now seen corresponding path program 2 times [2019-10-22 09:02:13,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535261115] [2019-10-22 09:02:13,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:13,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,709 INFO L87 Difference]: Start difference. First operand 1252 states and 1565 transitions. cyclomatic complexity: 320 Second operand 3 states. [2019-10-22 09:02:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,737 INFO L93 Difference]: Finished difference Result 1925 states and 2391 transitions. [2019-10-22 09:02:13,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2391 transitions. [2019-10-22 09:02:13,746 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 965 [2019-10-22 09:02:13,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1924 states and 2390 transitions. [2019-10-22 09:02:13,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1122 [2019-10-22 09:02:13,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1122 [2019-10-22 09:02:13,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1924 states and 2390 transitions. [2019-10-22 09:02:13,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:13,758 INFO L688 BuchiCegarLoop]: Abstraction has 1924 states and 2390 transitions. [2019-10-22 09:02:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states and 2390 transitions. [2019-10-22 09:02:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1660. [2019-10-22 09:02:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-10-22 09:02:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2066 transitions. [2019-10-22 09:02:13,786 INFO L711 BuchiCegarLoop]: Abstraction has 1660 states and 2066 transitions. [2019-10-22 09:02:13,786 INFO L591 BuchiCegarLoop]: Abstraction has 1660 states and 2066 transitions. [2019-10-22 09:02:13,786 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 09:02:13,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1660 states and 2066 transitions. [2019-10-22 09:02:13,792 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 798 [2019-10-22 09:02:13,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:13,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:13,793 INFO L849 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, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,796 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,797 INFO L791 eck$LassoCheckResult]: Stem: 15882#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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; 15828#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; 15829#L452 havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 15817#L212 assume !(1 == ~q_req_up~0); 15811#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 15812#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 15895#L232-1 assume !(0 == ~q_read_ev~0); 15927#L265-1 assume !(0 == ~q_write_ev~0); 15846#L270-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15847#L55 assume !(1 == ~p_dw_pc~0); 15876#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 15877#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15896#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15947#L305 assume !(0 != activate_threads_~tmp~1); 15948#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15934#L74 assume !(1 == ~c_dr_pc~0); 15868#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 15869#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15936#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 15956#L313 assume !(0 != activate_threads_~tmp___0~1); 15957#L313-2 assume !(1 == ~q_read_ev~0); 15909#L283-1 assume !(1 == ~q_write_ev~0); 15910#L409-1 assume !false; 16496#L410 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 16495#L354 assume !false; 16494#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16493#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 16492#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16491#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16490#L334 assume 0 != eval_~tmp___1~0; 16488#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 16486#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 16482#L118 assume 0 == ~p_dw_pc~0; 16468#L129-1 assume !false; 16442#L130 assume !(0 == ~q_free~0); 16279#L131 ~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_req_up~0 := 1; 16370#L129-1 assume !false; 17091#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 17090#L339 [2019-10-22 09:02:13,797 INFO L793 eck$LassoCheckResult]: Loop: 17090#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 16584#L358 assume !(0 != eval_~tmp___0~2); 17089#L354 assume !false; 17105#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 17103#L245 assume !(0 == ~p_dw_st~0); 17101#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 16798#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 17098#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 17094#L334 assume 0 != eval_~tmp___1~0; 17092#L334-1 assume !(0 == ~p_dw_st~0); 17090#L339 [2019-10-22 09:02:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -266582925, now seen corresponding path program 1 times [2019-10-22 09:02:13,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144217090] [2019-10-22 09:02:13,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,809 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash -474460271, now seen corresponding path program 3 times [2019-10-22 09:02:13,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306110372] [2019-10-22 09:02:13,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,820 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1848061315, now seen corresponding path program 1 times [2019-10-22 09:02:13,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516168709] [2019-10-22 09:02:13,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:13,854 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:14,159 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2019-10-22 09:02:14,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:14 BoogieIcfgContainer [2019-10-22 09:02:14,245 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:14,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:14,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:14,245 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:14,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:09" (3/4) ... [2019-10-22 09:02:14,248 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:02:14,302 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_231d652f-51b8-466c-a2eb-b7e57aecc694/bin/uautomizer/witness.graphml [2019-10-22 09:02:14,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:14,304 INFO L168 Benchmark]: Toolchain (without parser) took 6088.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 941.8 MB in the beginning and 979.5 MB in the end (delta: -37.7 MB). Peak memory consumption was 152.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,305 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:14,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.27 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,305 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,306 INFO L168 Benchmark]: RCFGBuilder took 561.08 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.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,306 INFO L168 Benchmark]: BuchiAutomizer took 5092.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 986.1 MB in the end (delta: 104.7 MB). Peak memory consumption was 156.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,306 INFO L168 Benchmark]: Witness Printer took 57.80 ms. Allocated memory is still 1.2 GB. Free memory was 986.1 MB in the beginning and 979.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:14,308 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.27 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 561.08 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.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5092.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 986.1 MB in the end (delta: 104.7 MB). Peak memory consumption was 156.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.80 ms. Allocated memory is still 1.2 GB. Free memory was 986.1 MB in the beginning and 979.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 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 7 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1660 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 3.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1730 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1841 SDtfs, 2087 SDslu, 2232 SDs, 0 SdLazy, 243 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN2 SILU0 SILI8 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq201 hnf90 smp100 dnf132 smp100 tf104 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 354]: 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, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3677439b=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@330bf7d8=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e78c4e0=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=1, tmp___0=0, q_write_ev=2, __retres1=1, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@750af629=0, q_free=0, __retres1=0, p_dw_st=2, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b891e38=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c4069e7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10492b72=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 329]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] p_dw_pc = 1 Loop: [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] return (__retres1); [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...