./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:27:09,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:27:09,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:27:09,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:27:09,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:27:09,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:27:09,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:27:09,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:27:09,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:27:09,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:27:09,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:27:09,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:27:09,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:27:09,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:27:09,661 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:27:09,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:27:09,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:27:09,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:27:09,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:27:09,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:27:09,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:27:09,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:27:09,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:27:09,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:27:09,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:27:09,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:27:09,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:27:09,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:27:09,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:27:09,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:27:09,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:27:09,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:27:09,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:27:09,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:27:09,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:27:09,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:27:09,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:27:09,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:27:09,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:27:09,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:27:09,669 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:27:09,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:27:09,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:27:09,670 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:27:09,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:27:09,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:27:09,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:27:09,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:27:09,920 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:27:09,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-27 22:27:10,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:27:11,087 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:27:11,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-27 22:27:11,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cad4afb1/ea258b50e09446b6837f2a2aa949b754/FLAG13d3dfa14 [2024-06-27 22:27:11,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cad4afb1/ea258b50e09446b6837f2a2aa949b754 [2024-06-27 22:27:11,114 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:27:11,115 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:27:11,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 22:27:11,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:27:11,214 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:27:11,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:27:11,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:27:11,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:27:11,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:27:11" (1/2) ... [2024-06-27 22:27:11,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765c1975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:27:11, skipping insertion in model container [2024-06-27 22:27:11,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:27:11" (1/2) ... [2024-06-27 22:27:11,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c5ace65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:27:11, skipping insertion in model container [2024-06-27 22:27:11,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:27:11" (2/2) ... [2024-06-27 22:27:11,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765c1975 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11, skipping insertion in model container [2024-06-27 22:27:11,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:27:11" (2/2) ... [2024-06-27 22:27:11,226 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:27:11,257 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:27:11,258 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:27:11,259 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:27:11,259 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:27:11,259 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:27:11,260 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:27:11,260 INFO L106 edCorrectnessWitness]: ghost_update [L862-L862] multithreaded = 1; [2024-06-27 22:27:11,303 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:27:11,439 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-06-27 22:27:11,557 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:27:11,565 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:27:11,607 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:27:11,871 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:27:11,898 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:27:11,898 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11 WrapperNode [2024-06-27 22:27:11,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:27:11,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:27:11,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:27:11,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:27:11,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:11,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,000 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-06-27 22:27:12,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:27:12,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:27:12,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:27:12,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:27:12,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,061 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:27:12,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:27:12,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:27:12,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:27:12,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:27:12,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (1/1) ... [2024-06-27 22:27:12,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:27:12,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:27:12,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:27:12,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:27:12,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:27:12,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:27:12,209 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:27:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:27:12,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:27:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:27:12,209 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:27:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:27:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 22:27:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 22:27:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:27:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:27:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:27:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:27:12,212 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:27:12,327 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:27:12,328 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:27:12,932 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:27:12,932 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:27:13,117 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:27:13,117 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:27:13,118 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:27:13 BoogieIcfgContainer [2024-06-27 22:27:13,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:27:13,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:27:13,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:27:13,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:27:13,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:27:11" (1/4) ... [2024-06-27 22:27:13,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740013a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:27:13, skipping insertion in model container [2024-06-27 22:27:13,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:27:11" (2/4) ... [2024-06-27 22:27:13,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740013a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:27:13, skipping insertion in model container [2024-06-27 22:27:13,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:27:11" (3/4) ... [2024-06-27 22:27:13,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740013a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:27:13, skipping insertion in model container [2024-06-27 22:27:13,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:27:13" (4/4) ... [2024-06-27 22:27:13,128 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-27 22:27:13,142 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:27:13,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 22:27:13,143 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:27:13,228 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:27:13,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-27 22:27:13,296 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-27 22:27:13,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:27:13,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 53 events. 1/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-06-27 22:27:13,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-27 22:27:13,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 53 transitions, 118 flow [2024-06-27 22:27:13,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:27:13,324 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28a9f64e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:27:13,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-27 22:27:13,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:27:13,329 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:27:13,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:27:13,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:13,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:27:13,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:13,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 377541598, now seen corresponding path program 1 times [2024-06-27 22:27:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878375111] [2024-06-27 22:27:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878375111] [2024-06-27 22:27:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878375111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:27:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136294970] [2024-06-27 22:27:14,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:27:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:14,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:27:14,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:27:15,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-27 22:27:15,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:15,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:15,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-27 22:27:15,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:18,675 INFO L124 PetriNetUnfolderBase]: 25051/37651 cut-off events. [2024-06-27 22:27:18,676 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-06-27 22:27:18,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71334 conditions, 37651 events. 25051/37651 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 273791 event pairs, 21691 based on Foata normal form. 1050/36280 useless extension candidates. Maximal degree in co-relation 71321. Up to 33232 conditions per place. [2024-06-27 22:27:18,915 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 52 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-06-27 22:27:18,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 275 flow [2024-06-27 22:27:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:27:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:27:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-06-27 22:27:18,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672514619883041 [2024-06-27 22:27:18,926 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 118 flow. Second operand 3 states and 115 transitions. [2024-06-27 22:27:18,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 275 flow [2024-06-27 22:27:18,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:27:18,936 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 153 flow [2024-06-27 22:27:18,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-06-27 22:27:18,941 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2024-06-27 22:27:18,941 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 153 flow [2024-06-27 22:27:18,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:18,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:18,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:18,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:27:18,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:18,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2040249884, now seen corresponding path program 1 times [2024-06-27 22:27:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135946428] [2024-06-27 22:27:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:18,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:20,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:20,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135946428] [2024-06-27 22:27:20,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135946428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:20,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:20,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:27:20,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014422997] [2024-06-27 22:27:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:20,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:27:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:27:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:27:20,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-27 22:27:20,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:20,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:20,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-27 22:27:20,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:23,868 INFO L124 PetriNetUnfolderBase]: 25052/36942 cut-off events. [2024-06-27 22:27:23,868 INFO L125 PetriNetUnfolderBase]: For 5524/5524 co-relation queries the response was YES. [2024-06-27 22:27:24,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78683 conditions, 36942 events. 25052/36942 cut-off events. For 5524/5524 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 258990 event pairs, 18473 based on Foata normal form. 4/34737 useless extension candidates. Maximal degree in co-relation 78671. Up to 33209 conditions per place. [2024-06-27 22:27:24,235 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 66 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2024-06-27 22:27:24,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 405 flow [2024-06-27 22:27:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:27:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:27:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-06-27 22:27:24,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6359649122807017 [2024-06-27 22:27:24,242 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 153 flow. Second operand 4 states and 145 transitions. [2024-06-27 22:27:24,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 405 flow [2024-06-27 22:27:24,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:27:24,246 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 237 flow [2024-06-27 22:27:24,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-27 22:27:24,247 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2024-06-27 22:27:24,249 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 237 flow [2024-06-27 22:27:24,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:24,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:24,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:24,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:27:24,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:24,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1176762099, now seen corresponding path program 1 times [2024-06-27 22:27:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462750988] [2024-06-27 22:27:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:25,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462750988] [2024-06-27 22:27:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462750988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:27:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877277883] [2024-06-27 22:27:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:25,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:27:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:27:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:27:25,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-27 22:27:25,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:25,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:25,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-27 22:27:25,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:29,082 INFO L124 PetriNetUnfolderBase]: 25257/37263 cut-off events. [2024-06-27 22:27:29,082 INFO L125 PetriNetUnfolderBase]: For 17263/17263 co-relation queries the response was YES. [2024-06-27 22:27:29,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87453 conditions, 37263 events. 25257/37263 cut-off events. For 17263/17263 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 261344 event pairs, 15248 based on Foata normal form. 10/35064 useless extension candidates. Maximal degree in co-relation 87438. Up to 33241 conditions per place. [2024-06-27 22:27:29,293 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 89 selfloop transitions, 24 changer transitions 2/128 dead transitions. [2024-06-27 22:27:29,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 675 flow [2024-06-27 22:27:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:27:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:27:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2024-06-27 22:27:29,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6771929824561403 [2024-06-27 22:27:29,296 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 237 flow. Second operand 5 states and 193 transitions. [2024-06-27 22:27:29,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 675 flow [2024-06-27 22:27:29,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 128 transitions, 660 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 22:27:29,303 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 395 flow [2024-06-27 22:27:29,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-06-27 22:27:29,304 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2024-06-27 22:27:29,305 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 395 flow [2024-06-27 22:27:29,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:29,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:29,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:29,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:27:29,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:29,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2119885733, now seen corresponding path program 1 times [2024-06-27 22:27:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:29,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511183732] [2024-06-27 22:27:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511183732] [2024-06-27 22:27:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511183732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:31,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:27:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786870177] [2024-06-27 22:27:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:27:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:27:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:27:31,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 22:27:31,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:31,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:31,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 22:27:31,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:35,238 INFO L124 PetriNetUnfolderBase]: 25274/37934 cut-off events. [2024-06-27 22:27:35,238 INFO L125 PetriNetUnfolderBase]: For 41515/41517 co-relation queries the response was YES. [2024-06-27 22:27:35,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103284 conditions, 37934 events. 25274/37934 cut-off events. For 41515/41517 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 274017 event pairs, 14946 based on Foata normal form. 22/35778 useless extension candidates. Maximal degree in co-relation 103264. Up to 33029 conditions per place. [2024-06-27 22:27:35,501 INFO L140 encePairwiseOnDemand]: 40/57 looper letters, 109 selfloop transitions, 45 changer transitions 3/169 dead transitions. [2024-06-27 22:27:35,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 1068 flow [2024-06-27 22:27:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:27:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:27:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-06-27 22:27:35,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-27 22:27:35,503 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 395 flow. Second operand 7 states and 247 transitions. [2024-06-27 22:27:35,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 1068 flow [2024-06-27 22:27:35,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 169 transitions, 1056 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 22:27:35,536 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 681 flow [2024-06-27 22:27:35,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=681, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2024-06-27 22:27:35,537 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 19 predicate places. [2024-06-27 22:27:35,537 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 681 flow [2024-06-27 22:27:35,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:35,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:35,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:35,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:27:35,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:35,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1291947284, now seen corresponding path program 1 times [2024-06-27 22:27:35,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:35,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832005948] [2024-06-27 22:27:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832005948] [2024-06-27 22:27:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832005948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:27:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273375709] [2024-06-27 22:27:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:37,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:27:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:27:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:27:38,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 22:27:38,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 681 flow. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:38,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:38,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 22:27:38,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:42,091 INFO L124 PetriNetUnfolderBase]: 25733/38631 cut-off events. [2024-06-27 22:27:42,091 INFO L125 PetriNetUnfolderBase]: For 87469/87469 co-relation queries the response was YES. [2024-06-27 22:27:42,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124223 conditions, 38631 events. 25733/38631 cut-off events. For 87469/87469 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 278897 event pairs, 13286 based on Foata normal form. 41/36488 useless extension candidates. Maximal degree in co-relation 124196. Up to 33351 conditions per place. [2024-06-27 22:27:42,365 INFO L140 encePairwiseOnDemand]: 41/57 looper letters, 140 selfloop transitions, 37 changer transitions 4/193 dead transitions. [2024-06-27 22:27:42,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 193 transitions, 1446 flow [2024-06-27 22:27:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:27:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:27:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2024-06-27 22:27:42,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6074561403508771 [2024-06-27 22:27:42,367 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 681 flow. Second operand 8 states and 277 transitions. [2024-06-27 22:27:42,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 193 transitions, 1446 flow [2024-06-27 22:27:42,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 193 transitions, 1370 flow, removed 37 selfloop flow, removed 1 redundant places. [2024-06-27 22:27:42,434 INFO L231 Difference]: Finished difference. Result has 91 places, 113 transitions, 846 flow [2024-06-27 22:27:42,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=846, PETRI_PLACES=91, PETRI_TRANSITIONS=113} [2024-06-27 22:27:42,435 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 26 predicate places. [2024-06-27 22:27:42,435 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 113 transitions, 846 flow [2024-06-27 22:27:42,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:42,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:42,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:27:42,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:42,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1664927783, now seen corresponding path program 1 times [2024-06-27 22:27:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:42,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019523899] [2024-06-27 22:27:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:44,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019523899] [2024-06-27 22:27:44,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019523899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:44,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:44,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:27:44,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20915119] [2024-06-27 22:27:44,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:44,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:27:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:44,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:27:44,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:27:44,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 22:27:44,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 113 transitions, 846 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:44,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:44,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 22:27:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:48,952 INFO L124 PetriNetUnfolderBase]: 29223/43312 cut-off events. [2024-06-27 22:27:48,952 INFO L125 PetriNetUnfolderBase]: For 115627/115627 co-relation queries the response was YES. [2024-06-27 22:27:49,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142556 conditions, 43312 events. 29223/43312 cut-off events. For 115627/115627 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 309944 event pairs, 15647 based on Foata normal form. 6/40969 useless extension candidates. Maximal degree in co-relation 142525. Up to 38668 conditions per place. [2024-06-27 22:27:49,263 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 111 selfloop transitions, 19 changer transitions 0/141 dead transitions. [2024-06-27 22:27:49,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 1198 flow [2024-06-27 22:27:49,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:27:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:27:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-06-27 22:27:49,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2024-06-27 22:27:49,264 INFO L175 Difference]: Start difference. First operand has 91 places, 113 transitions, 846 flow. Second operand 5 states and 155 transitions. [2024-06-27 22:27:49,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 1198 flow [2024-06-27 22:27:49,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 141 transitions, 1126 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 22:27:49,315 INFO L231 Difference]: Finished difference. Result has 93 places, 115 transitions, 854 flow [2024-06-27 22:27:49,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=854, PETRI_PLACES=93, PETRI_TRANSITIONS=115} [2024-06-27 22:27:49,316 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 28 predicate places. [2024-06-27 22:27:49,316 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 854 flow [2024-06-27 22:27:49,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:49,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:49,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:27:49,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:49,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1053750585, now seen corresponding path program 1 times [2024-06-27 22:27:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650253570] [2024-06-27 22:27:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:51,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:51,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650253570] [2024-06-27 22:27:51,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650253570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:51,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:27:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788309351] [2024-06-27 22:27:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:51,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:27:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:51,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:27:51,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:27:51,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 22:27:51,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 115 transitions, 854 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:51,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:51,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 22:27:51,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:27:56,145 INFO L124 PetriNetUnfolderBase]: 29675/43231 cut-off events. [2024-06-27 22:27:56,145 INFO L125 PetriNetUnfolderBase]: For 125409/125409 co-relation queries the response was YES. [2024-06-27 22:27:56,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146193 conditions, 43231 events. 29675/43231 cut-off events. For 125409/125409 co-relation queries the response was YES. Maximal size of possible extension queue 1420. Compared 298214 event pairs, 14431 based on Foata normal form. 12/40890 useless extension candidates. Maximal degree in co-relation 146158. Up to 38993 conditions per place. [2024-06-27 22:27:56,422 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 132 selfloop transitions, 29 changer transitions 2/174 dead transitions. [2024-06-27 22:27:56,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 174 transitions, 1529 flow [2024-06-27 22:27:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:27:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:27:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-06-27 22:27:56,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213032581453634 [2024-06-27 22:27:56,424 INFO L175 Difference]: Start difference. First operand has 93 places, 115 transitions, 854 flow. Second operand 7 states and 208 transitions. [2024-06-27 22:27:56,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 174 transitions, 1529 flow [2024-06-27 22:27:56,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 174 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:27:56,481 INFO L231 Difference]: Finished difference. Result has 99 places, 131 transitions, 1105 flow [2024-06-27 22:27:56,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1105, PETRI_PLACES=99, PETRI_TRANSITIONS=131} [2024-06-27 22:27:56,482 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 34 predicate places. [2024-06-27 22:27:56,482 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 131 transitions, 1105 flow [2024-06-27 22:27:56,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:56,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:27:56,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:27:56,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:27:56,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:27:56,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:27:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1384553783, now seen corresponding path program 2 times [2024-06-27 22:27:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:27:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036977558] [2024-06-27 22:27:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:27:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:27:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:27:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:27:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:27:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036977558] [2024-06-27 22:27:57,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036977558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:27:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:27:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:27:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010955967] [2024-06-27 22:27:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:27:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:27:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:27:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:27:57,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:27:57,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 22:27:57,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 131 transitions, 1105 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:27:57,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:27:57,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 22:27:57,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand