./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix029_power.opt_pso.opt_rmo.opt.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/mix029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix029_power.opt_pso.opt_rmo.opt.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-28 01:31:21,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:31:21,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:31:21,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:31:21,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:31:21,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:31:21,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:31:21,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:31:21,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:31:21,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:31:21,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:31:21,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:31:21,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:31:21,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:31:21,626 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:31:21,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:31:21,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:31:21,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:31:21,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:31:21,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:31:21,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:31:21,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:31:21,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:31:21,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:31:21,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:31:21,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:31:21,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:31:21,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:31:21,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:31:21,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:31:21,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:31:21,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:31:21,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:31:21,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:31:21,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:31:21,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:31:21,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:31:21,638 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-28 01:31:21,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:31:21,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:31:21,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:31:21,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:31:21,886 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:31:21,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-06-28 01:31:23,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:31:23,258 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:31:23,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-06-28 01:31:23,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762eb6761/e503f1be52af4838acad6db158a00d38/FLAG576fd197d [2024-06-28 01:31:23,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762eb6761/e503f1be52af4838acad6db158a00d38 [2024-06-28 01:31:23,289 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:31:23,290 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:31:23,291 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-nonrel/mix029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-28 01:31:23,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:31:23,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:31:23,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:31:23,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:31:23,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:31:23,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:31:23" (1/2) ... [2024-06-28 01:31:23,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e1f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:31:23, skipping insertion in model container [2024-06-28 01:31:23,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:31:23" (1/2) ... [2024-06-28 01:31:23,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7cd02a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:31:23, skipping insertion in model container [2024-06-28 01:31:23,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:31:23" (2/2) ... [2024-06-28 01:31:23,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e1f44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:23, skipping insertion in model container [2024-06-28 01:31:23,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:31:23" (2/2) ... [2024-06-28 01:31:23,512 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:31:23,601 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:31:23,606 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:31:23,606 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:31:23,607 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:31:23,607 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:31:23,607 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:31:23,608 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-06-28 01:31:23,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:31:23,791 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-06-28 01:31:23,962 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:31:23,977 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:31:24,012 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:31:24,108 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:31:24,152 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:31:24,153 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24 WrapperNode [2024-06-28 01:31:24,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:31:24,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:31:24,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:31:24,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:31:24,159 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 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,190 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 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,228 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-06-28 01:31:24,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:31:24,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:31:24,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:31:24,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:31:24,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,271 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-28 01:31:24,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:31:24,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:31:24,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:31:24,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:31:24,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (1/1) ... [2024-06-28 01:31:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:31:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:31:24,349 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-28 01:31:24,356 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-28 01:31:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:31:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:31:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:31:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:31:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:31:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:31:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:31:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:31:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:31:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:31:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:31:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:31:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:31:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:31:24,406 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:31:24,538 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:31:24,541 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:31:24,872 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:31:24,873 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:31:25,020 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:31:25,021 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:31:25,021 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:31:25 BoogieIcfgContainer [2024-06-28 01:31:25,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:31:25,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:31:25,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:31:25,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:31:25,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:31:23" (1/4) ... [2024-06-28 01:31:25,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71900e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:31:25, skipping insertion in model container [2024-06-28 01:31:25,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:31:23" (2/4) ... [2024-06-28 01:31:25,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71900e04 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:31:25, skipping insertion in model container [2024-06-28 01:31:25,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:31:24" (3/4) ... [2024-06-28 01:31:25,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71900e04 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:31:25, skipping insertion in model container [2024-06-28 01:31:25,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:31:25" (4/4) ... [2024-06-28 01:31:25,069 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2024-06-28 01:31:25,082 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:31:25,083 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:31:25,083 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:31:25,132 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:31:25,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 58 transitions, 132 flow [2024-06-28 01:31:25,196 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2024-06-28 01:31:25,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:31:25,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 1/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-06-28 01:31:25,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 58 transitions, 132 flow [2024-06-28 01:31:25,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 54 transitions, 120 flow [2024-06-28 01:31:25,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:31:25,223 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;@65ce2eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:31:25,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:31:25,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:31:25,227 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 01:31:25,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:31:25,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:25,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:31:25,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:25,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 368454972, now seen corresponding path program 1 times [2024-06-28 01:31:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:25,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070747658] [2024-06-28 01:31:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:26,127 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-28 01:31:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070747658] [2024-06-28 01:31:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070747658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:26,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:26,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:31:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672523830] [2024-06-28 01:31:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:31:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:26,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:31:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:31:26,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2024-06-28 01:31:26,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-28 01:31:26,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:26,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2024-06-28 01:31:26,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:29,164 INFO L124 PetriNetUnfolderBase]: 22729/32288 cut-off events. [2024-06-28 01:31:29,165 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-06-28 01:31:29,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62918 conditions, 32288 events. 22729/32288 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 213807 event pairs, 14900 based on Foata normal form. 841/31535 useless extension candidates. Maximal degree in co-relation 62905. Up to 30214 conditions per place. [2024-06-28 01:31:29,367 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 53 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:31:29,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 285 flow [2024-06-28 01:31:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:31:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:31:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-28 01:31:29,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6839080459770115 [2024-06-28 01:31:29,379 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 119 transitions. [2024-06-28 01:31:29,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 285 flow [2024-06-28 01:31:29,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:31:29,384 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 160 flow [2024-06-28 01:31:29,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2024-06-28 01:31:29,388 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-06-28 01:31:29,388 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 160 flow [2024-06-28 01:31:29,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-28 01:31:29,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:29,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:29,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:31:29,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:29,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1897929947, now seen corresponding path program 1 times [2024-06-28 01:31:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404760519] [2024-06-28 01:31:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:30,048 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-28 01:31:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:30,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404760519] [2024-06-28 01:31:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404760519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:30,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:31:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341733634] [2024-06-28 01:31:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:30,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:31:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:31:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:31:30,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-28 01:31:30,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 160 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-28 01:31:30,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:30,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-28 01:31:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:33,192 INFO L124 PetriNetUnfolderBase]: 27173/39390 cut-off events. [2024-06-28 01:31:33,193 INFO L125 PetriNetUnfolderBase]: For 6264/6264 co-relation queries the response was YES. [2024-06-28 01:31:33,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84559 conditions, 39390 events. 27173/39390 cut-off events. For 6264/6264 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 273712 event pairs, 20289 based on Foata normal form. 4/37083 useless extension candidates. Maximal degree in co-relation 84547. Up to 35967 conditions per place. [2024-06-28 01:31:33,479 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 69 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2024-06-28 01:31:33,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 410 flow [2024-06-28 01:31:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:31:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:31:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2024-06-28 01:31:33,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2024-06-28 01:31:33,486 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 160 flow. Second operand 4 states and 152 transitions. [2024-06-28 01:31:33,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 410 flow [2024-06-28 01:31:33,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:31:33,664 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 218 flow [2024-06-28 01:31:33,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-28 01:31:33,665 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2024-06-28 01:31:33,665 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 218 flow [2024-06-28 01:31:33,665 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-28 01:31:33,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:33,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:33,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:31:33,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:33,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2012714570, now seen corresponding path program 1 times [2024-06-28 01:31:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259712588] [2024-06-28 01:31:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:34,511 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-28 01:31:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:34,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259712588] [2024-06-28 01:31:34,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259712588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:34,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:34,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:31:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248008002] [2024-06-28 01:31:34,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:34,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:31:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:34,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:31:34,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:31:34,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-06-28 01:31:34,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-28 01:31:34,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:34,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-06-28 01:31:34,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:38,352 INFO L124 PetriNetUnfolderBase]: 34493/46589 cut-off events. [2024-06-28 01:31:38,353 INFO L125 PetriNetUnfolderBase]: For 18443/18443 co-relation queries the response was YES. [2024-06-28 01:31:38,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113320 conditions, 46589 events. 34493/46589 cut-off events. For 18443/18443 co-relation queries the response was YES. Maximal size of possible extension queue 1616. Compared 284216 event pairs, 16369 based on Foata normal form. 8/44872 useless extension candidates. Maximal degree in co-relation 113306. Up to 45394 conditions per place. [2024-06-28 01:31:38,642 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 97 selfloop transitions, 20 changer transitions 0/129 dead transitions. [2024-06-28 01:31:38,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 638 flow [2024-06-28 01:31:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:31:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:31:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-06-28 01:31:38,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6235632183908046 [2024-06-28 01:31:38,645 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 218 flow. Second operand 6 states and 217 transitions. [2024-06-28 01:31:38,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 638 flow [2024-06-28 01:31:38,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 602 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:31:38,651 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 297 flow [2024-06-28 01:31:38,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-28 01:31:38,652 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-06-28 01:31:38,652 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 297 flow [2024-06-28 01:31:38,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-28 01:31:38,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:38,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:38,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:31:38,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:38,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2106995212, now seen corresponding path program 1 times [2024-06-28 01:31:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799900144] [2024-06-28 01:31:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:39,440 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-28 01:31:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799900144] [2024-06-28 01:31:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799900144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:39,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:31:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5849061] [2024-06-28 01:31:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:39,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:31:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:31:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:31:39,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-28 01:31:39,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-28 01:31:39,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:39,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-28 01:31:39,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:43,527 INFO L124 PetriNetUnfolderBase]: 32283/45437 cut-off events. [2024-06-28 01:31:43,527 INFO L125 PetriNetUnfolderBase]: For 32043/32043 co-relation queries the response was YES. [2024-06-28 01:31:43,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118317 conditions, 45437 events. 32283/45437 cut-off events. For 32043/32043 co-relation queries the response was YES. Maximal size of possible extension queue 1553. Compared 298864 event pairs, 15646 based on Foata normal form. 3/43525 useless extension candidates. Maximal degree in co-relation 118300. Up to 42647 conditions per place. [2024-06-28 01:31:44,027 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 82 selfloop transitions, 12 changer transitions 0/105 dead transitions. [2024-06-28 01:31:44,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 105 transitions, 583 flow [2024-06-28 01:31:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:31:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:31:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-28 01:31:44,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-06-28 01:31:44,029 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 297 flow. Second operand 5 states and 158 transitions. [2024-06-28 01:31:44,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 105 transitions, 583 flow [2024-06-28 01:31:44,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 534 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:31:44,043 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 324 flow [2024-06-28 01:31:44,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2024-06-28 01:31:44,045 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2024-06-28 01:31:44,045 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 324 flow [2024-06-28 01:31:44,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-28 01:31:44,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:44,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:44,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:31:44,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:44,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 917368558, now seen corresponding path program 1 times [2024-06-28 01:31:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:44,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827863433] [2024-06-28 01:31:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:44,755 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-28 01:31:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827863433] [2024-06-28 01:31:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827863433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:44,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:31:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674955319] [2024-06-28 01:31:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:44,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:31:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:31:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:31:44,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-28 01:31:44,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-28 01:31:44,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:44,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-28 01:31:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:49,041 INFO L124 PetriNetUnfolderBase]: 32261/47531 cut-off events. [2024-06-28 01:31:49,042 INFO L125 PetriNetUnfolderBase]: For 53000/53000 co-relation queries the response was YES. [2024-06-28 01:31:49,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129731 conditions, 47531 events. 32261/47531 cut-off events. For 53000/53000 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 340272 event pairs, 17920 based on Foata normal form. 6/44475 useless extension candidates. Maximal degree in co-relation 129712. Up to 42586 conditions per place. [2024-06-28 01:31:49,356 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 97 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2024-06-28 01:31:49,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 763 flow [2024-06-28 01:31:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:31:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:31:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-06-28 01:31:49,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-06-28 01:31:49,360 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 324 flow. Second operand 6 states and 186 transitions. [2024-06-28 01:31:49,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 763 flow [2024-06-28 01:31:49,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 691 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-28 01:31:49,375 INFO L231 Difference]: Finished difference. Result has 79 places, 94 transitions, 474 flow [2024-06-28 01:31:49,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=79, PETRI_TRANSITIONS=94} [2024-06-28 01:31:49,377 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-06-28 01:31:49,378 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 94 transitions, 474 flow [2024-06-28 01:31:49,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-28 01:31:49,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:49,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:49,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:31:49,379 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:49,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:49,379 INFO L85 PathProgramCache]: Analyzing trace with hash 890873970, now seen corresponding path program 1 times [2024-06-28 01:31:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:49,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401989850] [2024-06-28 01:31:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:49,520 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-28 01:31:49,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401989850] [2024-06-28 01:31:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401989850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:31:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135270938] [2024-06-28 01:31:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:49,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:31:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:31:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:31:49,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 58 [2024-06-28 01:31:49,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 94 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-28 01:31:49,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:49,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 58 [2024-06-28 01:31:49,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:50,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] L784-->L796: Formula: (and (= 2 v_~y$w_buff0~0_117) (= v_~y$r_buff0_thd4~0_81 v_~y$r_buff1_thd4~0_83) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_118) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_41) (= v_~y$w_buff0_used~0_159 1) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_101 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff1_thd2~0_73) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_41, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][32], [P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 18#L759true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 43#L779true, 117#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 80#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 101#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~y~0 1) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 49#L796true, 35#L880true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 87#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 22#L816true]) [2024-06-28 01:31:50,553 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-06-28 01:31:50,554 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-06-28 01:31:50,554 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-06-28 01:31:50,554 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-06-28 01:31:50,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] L784-->L796: Formula: (and (= 2 v_~y$w_buff0~0_117) (= v_~y$r_buff0_thd4~0_81 v_~y$r_buff1_thd4~0_83) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_118) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_41) (= v_~y$w_buff0_used~0_159 1) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_101 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff1_thd2~0_73) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_41, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][32], [P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 18#L759true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 117#true, 43#L779true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 80#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 51#L18-1true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 101#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~y~0 1) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 49#L796true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 87#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 22#L816true]) [2024-06-28 01:31:50,627 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-06-28 01:31:50,627 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-28 01:31:50,627 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-28 01:31:50,627 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-28 01:31:50,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] L784-->L796: Formula: (and (= 2 v_~y$w_buff0~0_117) (= v_~y$r_buff0_thd4~0_81 v_~y$r_buff1_thd4~0_83) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_118) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_41) (= v_~y$w_buff0_used~0_159 1) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_101 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff1_thd2~0_73) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_41, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][32], [P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 18#L759true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), P2Thread1of1ForFork0InUse, 2#ULTIMATE.startEXITtrue, P3Thread1of1ForFork2InUse, 117#true, 43#L779true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 80#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 101#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~y~0 1) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 49#L796true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 87#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 22#L816true]) [2024-06-28 01:31:50,741 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-06-28 01:31:50,741 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-28 01:31:50,741 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-28 01:31:50,741 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-28 01:31:51,052 INFO L124 PetriNetUnfolderBase]: 7873/13990 cut-off events. [2024-06-28 01:31:51,053 INFO L125 PetriNetUnfolderBase]: For 19265/20677 co-relation queries the response was YES. [2024-06-28 01:31:51,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35251 conditions, 13990 events. 7873/13990 cut-off events. For 19265/20677 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 121304 event pairs, 3489 based on Foata normal form. 17/12585 useless extension candidates. Maximal degree in co-relation 35230. Up to 9096 conditions per place. [2024-06-28 01:31:51,153 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 40 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2024-06-28 01:31:51,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 542 flow [2024-06-28 01:31:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:31:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:31:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-06-28 01:31:51,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.764367816091954 [2024-06-28 01:31:51,155 INFO L175 Difference]: Start difference. First operand has 79 places, 94 transitions, 474 flow. Second operand 3 states and 133 transitions. [2024-06-28 01:31:51,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 542 flow [2024-06-28 01:31:51,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 520 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-28 01:31:51,169 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 408 flow [2024-06-28 01:31:51,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2024-06-28 01:31:51,169 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-06-28 01:31:51,170 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 408 flow [2024-06-28 01:31:51,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-28 01:31:51,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:51,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:51,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:31:51,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:51,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1892650573, now seen corresponding path program 1 times [2024-06-28 01:31:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706873626] [2024-06-28 01:31:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:51,913 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-28 01:31:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706873626] [2024-06-28 01:31:51,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706873626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:51,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:51,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:31:51,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034806322] [2024-06-28 01:31:51,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:51,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:31:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:31:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:31:52,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 01:31:52,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 408 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-28 01:31:52,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:52,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 01:31:52,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:31:56,550 INFO L124 PetriNetUnfolderBase]: 32958/45252 cut-off events. [2024-06-28 01:31:56,550 INFO L125 PetriNetUnfolderBase]: For 88770/88785 co-relation queries the response was YES. [2024-06-28 01:31:56,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133984 conditions, 45252 events. 32958/45252 cut-off events. For 88770/88785 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 282272 event pairs, 15974 based on Foata normal form. 15/44840 useless extension candidates. Maximal degree in co-relation 133961. Up to 43390 conditions per place. [2024-06-28 01:31:56,854 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 98 selfloop transitions, 28 changer transitions 4/140 dead transitions. [2024-06-28 01:31:56,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 140 transitions, 880 flow [2024-06-28 01:31:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:31:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:31:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-28 01:31:56,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2024-06-28 01:31:56,855 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 408 flow. Second operand 6 states and 190 transitions. [2024-06-28 01:31:56,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 140 transitions, 880 flow [2024-06-28 01:31:56,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 140 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:31:56,877 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 525 flow [2024-06-28 01:31:56,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2024-06-28 01:31:56,877 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-06-28 01:31:56,878 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 525 flow [2024-06-28 01:31:56,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-28 01:31:56,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:31:56,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:31:56,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:31:56,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:31:56,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:31:56,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1599799263, now seen corresponding path program 2 times [2024-06-28 01:31:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:31:56,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969765271] [2024-06-28 01:31:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:31:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:31:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:31:57,525 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-28 01:31:57,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:31:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969765271] [2024-06-28 01:31:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969765271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:31:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:31:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:31:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348377388] [2024-06-28 01:31:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:31:57,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:31:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:31:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:31:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:31:57,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-28 01:31:57,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 525 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-28 01:31:57,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:31:57,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-28 01:31:57,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand