./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix008_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix008_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:21:10,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:21:10,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:21:10,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:21:10,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:21:10,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:21:10,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:21:10,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:21:10,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:21:10,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:21:10,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:21:10,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:21:10,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:21:10,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:21:10,792 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:21:10,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:21:10,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:21:10,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:21:10,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:21:10,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:21:10,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:21:10,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:21:10,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:21:10,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:21:10,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:21:10,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:21:10,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:21:10,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:21:10,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:21:10,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:21:10,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:21:10,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:21:10,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:21:10,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:21:10,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:21:10,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:21:10,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:21:10,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:21:10,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:21:10,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:21:10,800 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:21:10,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:21:10,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:21:10,801 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:21:11,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:21:11,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:21:11,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:21:11,047 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:21:11,047 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:21:11,048 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/mix008_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-28 01:21:11,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:21:11,316 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:21:11,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:21:12,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:21:12,660 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:21:12,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:21:12,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d464159/319cab4345044ac48b0e98598533fc61/FLAGe5b8838eb [2024-06-28 01:21:12,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d464159/319cab4345044ac48b0e98598533fc61 [2024-06-28 01:21:12,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:21:12,691 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:21:12,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:21:12,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:21:12,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:21:12,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:21:11" (1/2) ... [2024-06-28 01:21:12,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484c05ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:21:12, skipping insertion in model container [2024-06-28 01:21:12,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:21:11" (1/2) ... [2024-06-28 01:21:12,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@a1055ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:21:12, skipping insertion in model container [2024-06-28 01:21:12,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:21:12" (2/2) ... [2024-06-28 01:21:12,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484c05ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:12, skipping insertion in model container [2024-06-28 01:21:12,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:21:12" (2/2) ... [2024-06-28 01:21:12,701 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:21:12,867 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:21:12,868 INFO L97 edCorrectnessWitness]: Location invariant before [L872-L872] ((((((((((((((((((((((! multithreaded || (z == 0 || z == 1)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:21:12,869 INFO L97 edCorrectnessWitness]: Location invariant before [L877-L877] ((((((((((((((((((((((! multithreaded || (z == 0 || z == 1)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:21:12,869 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ((((((((((((((((((((((! multithreaded || (z == 0 || z == 1)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:21:12,869 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ((((((((((((((((((((((! multithreaded || (z == 0 || z == 1)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0) [2024-06-28 01:21:12,869 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:21:12,869 INFO L106 edCorrectnessWitness]: ghost_update [L870-L870] multithreaded = 1; [2024-06-28 01:21:12,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:21:13,077 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-28 01:21:13,267 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:21:13,284 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:21:13,317 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:21:13,421 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:21:13,458 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:21:13,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13 WrapperNode [2024-06-28 01:21:13,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:21:13,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:21:13,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:21:13,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:21:13,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,545 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-06-28 01:21:13,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:21:13,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:21:13,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:21:13,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:21:13,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,601 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:21:13,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:21:13,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:21:13,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:21:13,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:21:13,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (1/1) ... [2024-06-28 01:21:13,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:21:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:21:13,681 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:21:13,710 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:21:13,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:21:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:21:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:21:13,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:21:13,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:21:13,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:21:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:21:13,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:21:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:21:13,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:21:13,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:21:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:21:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:21:13,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:21:13,730 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:21:13,869 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:21:13,871 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:21:14,262 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:21:14,262 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:21:14,461 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:21:14,462 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:21:14,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:21:14 BoogieIcfgContainer [2024-06-28 01:21:14,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:21:14,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:21:14,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:21:14,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:21:14,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:21:11" (1/4) ... [2024-06-28 01:21:14,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446296a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:21:14, skipping insertion in model container [2024-06-28 01:21:14,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:21:12" (2/4) ... [2024-06-28 01:21:14,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446296a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:21:14, skipping insertion in model container [2024-06-28 01:21:14,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:21:13" (3/4) ... [2024-06-28 01:21:14,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446296a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:21:14, skipping insertion in model container [2024-06-28 01:21:14,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:21:14" (4/4) ... [2024-06-28 01:21:14,472 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 01:21:14,488 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:21:14,489 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:21:14,489 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:21:14,554 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:21:14,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:21:14,633 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:21:14,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:21:14,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-06-28 01:21:14,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:21:14,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:21:14,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:21:14,664 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;@6a4b2cbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:21:14,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:21:14,667 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:21:14,667 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:21:14,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:21:14,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:14,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:21:14,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:14,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash 384939040, now seen corresponding path program 1 times [2024-06-28 01:21:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122161981] [2024-06-28 01:21:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:15,925 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:21:15,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:15,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122161981] [2024-06-28 01:21:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122161981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:15,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:15,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:21:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110112423] [2024-06-28 01:21:15,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:15,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:21:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:15,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:21:15,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:21:16,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:21:16,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 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:21:16,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:16,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:21:16,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:21,468 INFO L124 PetriNetUnfolderBase]: 30443/45297 cut-off events. [2024-06-28 01:21:21,468 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2024-06-28 01:21:21,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86119 conditions, 45297 events. 30443/45297 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 332376 event pairs, 25364 based on Foata normal form. 1051/43276 useless extension candidates. Maximal degree in co-relation 86106. Up to 40281 conditions per place. [2024-06-28 01:21:21,870 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 53 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:21:21,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 285 flow [2024-06-28 01:21:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:21:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:21:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-28 01:21:21,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-06-28 01:21:21,883 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 119 transitions. [2024-06-28 01:21:21,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 285 flow [2024-06-28 01:21:21,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:21:21,892 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:21:21,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-28 01:21:21,897 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:21:21,897 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:21:21,898 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:21:21,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:21,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:21:21,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:21:21,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:21,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash 384940390, now seen corresponding path program 1 times [2024-06-28 01:21:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806162243] [2024-06-28 01:21:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:21,984 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:21:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806162243] [2024-06-28 01:21:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806162243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:21:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499849774] [2024-06-28 01:21:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:21:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:21,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:21:21,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:21:21,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2024-06-28 01:21:21,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:21:21,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:21,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2024-06-28 01:21:21,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:23,379 INFO L124 PetriNetUnfolderBase]: 5221/9274 cut-off events. [2024-06-28 01:21:23,379 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2024-06-28 01:21:23,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17574 conditions, 9274 events. 5221/9274 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 74674 event pairs, 3401 based on Foata normal form. 0/8465 useless extension candidates. Maximal degree in co-relation 17562. Up to 6080 conditions per place. [2024-06-28 01:21:23,426 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 45 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2024-06-28 01:21:23,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 297 flow [2024-06-28 01:21:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:21:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:21:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2024-06-28 01:21:23,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7966101694915254 [2024-06-28 01:21:23,430 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 3 states and 141 transitions. [2024-06-28 01:21:23,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 297 flow [2024-06-28 01:21:23,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:21:23,433 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 154 flow [2024-06-28 01:21:23,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-28 01:21:23,434 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:21:23,434 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 154 flow [2024-06-28 01:21:23,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:21:23,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:23,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:23,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:21:23,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:23,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 560498826, now seen corresponding path program 1 times [2024-06-28 01:21:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335796635] [2024-06-28 01:21:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:24,218 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:21:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335796635] [2024-06-28 01:21:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335796635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:24,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:21:24,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172641408] [2024-06-28 01:21:24,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:24,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:21:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:24,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:21:24,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:21:24,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:21:24,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:21:24,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:24,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:21:24,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:27,529 INFO L124 PetriNetUnfolderBase]: 25896/38472 cut-off events. [2024-06-28 01:21:27,529 INFO L125 PetriNetUnfolderBase]: For 8445/8445 co-relation queries the response was YES. [2024-06-28 01:21:27,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81683 conditions, 38472 events. 25896/38472 cut-off events. For 8445/8445 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 272428 event pairs, 18867 based on Foata normal form. 4/37286 useless extension candidates. Maximal degree in co-relation 81670. Up to 34302 conditions per place. [2024-06-28 01:21:27,736 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 65 selfloop transitions, 10 changer transitions 2/91 dead transitions. [2024-06-28 01:21:27,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 404 flow [2024-06-28 01:21:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:21:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:21:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-06-28 01:21:27,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6313559322033898 [2024-06-28 01:21:27,739 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 154 flow. Second operand 4 states and 149 transitions. [2024-06-28 01:21:27,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 404 flow [2024-06-28 01:21:27,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:21:27,743 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 235 flow [2024-06-28 01:21:27,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-28 01:21:27,745 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:21:27,745 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 235 flow [2024-06-28 01:21:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:21:27,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:27,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:27,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:21:27,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:27,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 195596325, now seen corresponding path program 1 times [2024-06-28 01:21:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:27,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258394926] [2024-06-28 01:21:27,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:27,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:28,633 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:21:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258394926] [2024-06-28 01:21:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258394926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:28,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:21:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601054406] [2024-06-28 01:21:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:21:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:21:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:21:28,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:21:28,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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:21:28,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:28,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:21:28,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:31,501 INFO L124 PetriNetUnfolderBase]: 22379/33939 cut-off events. [2024-06-28 01:21:31,502 INFO L125 PetriNetUnfolderBase]: For 15307/15307 co-relation queries the response was YES. [2024-06-28 01:21:31,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77875 conditions, 33939 events. 22379/33939 cut-off events. For 15307/15307 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 243988 event pairs, 13622 based on Foata normal form. 7/32833 useless extension candidates. Maximal degree in co-relation 77860. Up to 29590 conditions per place. [2024-06-28 01:21:31,678 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 86 selfloop transitions, 23 changer transitions 0/123 dead transitions. [2024-06-28 01:21:31,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 123 transitions, 649 flow [2024-06-28 01:21:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:21:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:21:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2024-06-28 01:21:31,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6508474576271186 [2024-06-28 01:21:31,681 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 235 flow. Second operand 5 states and 192 transitions. [2024-06-28 01:21:31,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 123 transitions, 649 flow [2024-06-28 01:21:31,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 634 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 01:21:31,688 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 382 flow [2024-06-28 01:21:31,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2024-06-28 01:21:31,689 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2024-06-28 01:21:31,689 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 382 flow [2024-06-28 01:21:31,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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:21:31,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:31,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:31,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:21:31,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:31,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash 604884253, now seen corresponding path program 1 times [2024-06-28 01:21:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444091424] [2024-06-28 01:21:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:32,981 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:21:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444091424] [2024-06-28 01:21:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444091424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:32,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:32,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:21:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617071077] [2024-06-28 01:21:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:32,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:21:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:32,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:21:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:21:33,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:21:33,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:21:33,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:33,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:21:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:36,121 INFO L124 PetriNetUnfolderBase]: 22416/34005 cut-off events. [2024-06-28 01:21:36,122 INFO L125 PetriNetUnfolderBase]: For 36321/36326 co-relation queries the response was YES. [2024-06-28 01:21:36,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89266 conditions, 34005 events. 22416/34005 cut-off events. For 36321/36326 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 244837 event pairs, 12011 based on Foata normal form. 11/32895 useless extension candidates. Maximal degree in co-relation 89247. Up to 29588 conditions per place. [2024-06-28 01:21:36,370 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 99 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2024-06-28 01:21:36,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 141 transitions, 850 flow [2024-06-28 01:21:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:21:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:21:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-06-28 01:21:36,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-06-28 01:21:36,372 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 382 flow. Second operand 6 states and 228 transitions. [2024-06-28 01:21:36,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 141 transitions, 850 flow [2024-06-28 01:21:36,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 141 transitions, 838 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-28 01:21:36,387 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 480 flow [2024-06-28 01:21:36,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2024-06-28 01:21:36,388 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:21:36,388 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 480 flow [2024-06-28 01:21:36,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:21:36,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:36,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:36,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:21:36,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:36,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:36,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1010430780, now seen corresponding path program 1 times [2024-06-28 01:21:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805532903] [2024-06-28 01:21:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:36,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:37,825 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:21:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805532903] [2024-06-28 01:21:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805532903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:21:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109113477] [2024-06-28 01:21:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:21:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:21:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:21:37,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:21:37,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 480 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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:21:37,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:37,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:21:37,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:41,162 INFO L124 PetriNetUnfolderBase]: 22480/31667 cut-off events. [2024-06-28 01:21:41,162 INFO L125 PetriNetUnfolderBase]: For 54760/54765 co-relation queries the response was YES. [2024-06-28 01:21:41,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94811 conditions, 31667 events. 22480/31667 cut-off events. For 54760/54765 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 203058 event pairs, 9487 based on Foata normal form. 18/31416 useless extension candidates. Maximal degree in co-relation 94789. Up to 29541 conditions per place. [2024-06-28 01:21:41,334 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 110 selfloop transitions, 52 changer transitions 0/176 dead transitions. [2024-06-28 01:21:41,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 176 transitions, 1216 flow [2024-06-28 01:21:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:21:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:21:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2024-06-28 01:21:41,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6319612590799032 [2024-06-28 01:21:41,514 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 480 flow. Second operand 7 states and 261 transitions. [2024-06-28 01:21:41,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 176 transitions, 1216 flow [2024-06-28 01:21:41,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 176 transitions, 1146 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:21:41,539 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 774 flow [2024-06-28 01:21:41,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=774, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2024-06-28 01:21:41,540 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 18 predicate places. [2024-06-28 01:21:41,540 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 774 flow [2024-06-28 01:21:41,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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:21:41,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:41,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:21:41,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:41,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 278737206, now seen corresponding path program 1 times [2024-06-28 01:21:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927970094] [2024-06-28 01:21:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:42,382 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:21:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927970094] [2024-06-28 01:21:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927970094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:42,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:42,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:21:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730789209] [2024-06-28 01:21:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:42,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:21:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:42,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:21:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:21:42,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:21:42,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:21:42,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:42,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:21:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:46,756 INFO L124 PetriNetUnfolderBase]: 26050/39161 cut-off events. [2024-06-28 01:21:46,757 INFO L125 PetriNetUnfolderBase]: For 102213/102213 co-relation queries the response was YES. [2024-06-28 01:21:46,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123449 conditions, 39161 events. 26050/39161 cut-off events. For 102213/102213 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 282448 event pairs, 14138 based on Foata normal form. 3/38113 useless extension candidates. Maximal degree in co-relation 123422. Up to 34508 conditions per place. [2024-06-28 01:21:47,021 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 101 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2024-06-28 01:21:47,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 131 transitions, 1068 flow [2024-06-28 01:21:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:21:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:21:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-06-28 01:21:47,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2024-06-28 01:21:47,022 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 774 flow. Second operand 5 states and 155 transitions. [2024-06-28 01:21:47,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 131 transitions, 1068 flow [2024-06-28 01:21:47,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 131 transitions, 976 flow, removed 46 selfloop flow, removed 0 redundant places. [2024-06-28 01:21:47,070 INFO L231 Difference]: Finished difference. Result has 90 places, 108 transitions, 734 flow [2024-06-28 01:21:47,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=734, PETRI_PLACES=90, PETRI_TRANSITIONS=108} [2024-06-28 01:21:47,071 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 23 predicate places. [2024-06-28 01:21:47,071 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 108 transitions, 734 flow [2024-06-28 01:21:47,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:21:47,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:47,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:47,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:21:47,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:47,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 18602543, now seen corresponding path program 1 times [2024-06-28 01:21:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784227876] [2024-06-28 01:21:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:48,004 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:21:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784227876] [2024-06-28 01:21:48,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784227876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:48,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:48,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:21:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168689732] [2024-06-28 01:21:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:48,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:21:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:21:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:21:48,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:21:48,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 108 transitions, 734 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:21:48,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:48,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:21:48,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:21:53,245 INFO L124 PetriNetUnfolderBase]: 31566/47080 cut-off events. [2024-06-28 01:21:53,245 INFO L125 PetriNetUnfolderBase]: For 102538/102538 co-relation queries the response was YES. [2024-06-28 01:21:53,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139805 conditions, 47080 events. 31566/47080 cut-off events. For 102538/102538 co-relation queries the response was YES. Maximal size of possible extension queue 1582. Compared 338845 event pairs, 16498 based on Foata normal form. 10/45989 useless extension candidates. Maximal degree in co-relation 139774. Up to 41514 conditions per place. [2024-06-28 01:21:53,565 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 125 selfloop transitions, 28 changer transitions 0/164 dead transitions. [2024-06-28 01:21:53,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 164 transitions, 1290 flow [2024-06-28 01:21:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:21:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:21:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-06-28 01:21:53,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53954802259887 [2024-06-28 01:21:53,568 INFO L175 Difference]: Start difference. First operand has 90 places, 108 transitions, 734 flow. Second operand 6 states and 191 transitions. [2024-06-28 01:21:53,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 164 transitions, 1290 flow [2024-06-28 01:21:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 1237 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 01:21:53,606 INFO L231 Difference]: Finished difference. Result has 94 places, 122 transitions, 883 flow [2024-06-28 01:21:53,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=883, PETRI_PLACES=94, PETRI_TRANSITIONS=122} [2024-06-28 01:21:53,607 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2024-06-28 01:21:53,608 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 122 transitions, 883 flow [2024-06-28 01:21:53,609 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:21:53,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:53,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:53,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:21:53,610 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:53,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 570035666, now seen corresponding path program 1 times [2024-06-28 01:21:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:53,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676136358] [2024-06-28 01:21:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:54,543 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:21:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676136358] [2024-06-28 01:21:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676136358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:21:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427009478] [2024-06-28 01:21:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:54,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:21:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:21:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:21:54,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:21:54,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 122 transitions, 883 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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:21:54,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:54,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:21:54,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand