./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:07:39,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:07:39,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:07:39,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:07:39,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:07:39,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:07:39,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:07:39,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:07:39,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:07:39,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:07:39,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:07:39,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:07:39,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:07:39,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:07:39,728 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:07:39,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:07:39,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:07:39,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:07:39,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:07:39,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:07:39,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:07:39,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:07:39,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:07:39,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:07:39,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:07:39,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:07:39,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:07:39,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:07:39,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:07:39,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:07:39,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:07:39,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:07:39,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:07:39,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:07:39,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:07:39,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:07:39,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:07:39,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:07:39,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:07:39,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:07:39,744 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:07:39,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:07:39,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:07:39,745 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:07:39,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:07:39,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:07:39,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:07:39,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:07:39,974 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:07:39,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-14 15:07:41,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:07:41,402 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:07:41,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-14 15:07:41,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d978b26e/400bcd9ddb024fd69bb386e7bf6c9588/FLAG41340f4a9 [2024-06-14 15:07:41,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d978b26e/400bcd9ddb024fd69bb386e7bf6c9588 [2024-06-14 15:07:41,440 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:07:41,440 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:07:41,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.yml/witness.yml [2024-06-14 15:07:41,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:07:41,622 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:07:41,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:07:41,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:07:41,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:07:41,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:07:41" (1/2) ... [2024-06-14 15:07:41,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ba4e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:07:41, skipping insertion in model container [2024-06-14 15:07:41,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:07:41" (1/2) ... [2024-06-14 15:07:41,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@18b028ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:07:41, skipping insertion in model container [2024-06-14 15:07:41,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:07:41" (2/2) ... [2024-06-14 15:07:41,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ba4e36 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:41, skipping insertion in model container [2024-06-14 15:07:41,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:07:41" (2/2) ... [2024-06-14 15:07:41,634 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:07:41,707 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:07:41,708 INFO L97 edCorrectnessWitness]: Location invariant before [L820-L820] (((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:07:41,709 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:07:41,709 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:07:41,709 INFO L106 edCorrectnessWitness]: ghost_update [L818-L818] multithreaded = 1; [2024-06-14 15:07:41,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:07:42,087 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:07:42,105 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:07:42,420 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:07:42,454 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:07:42,455 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42 WrapperNode [2024-06-14 15:07:42,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:07:42,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:07:42,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:07:42,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:07:42,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,682 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 115 [2024-06-14 15:07:42,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:07:42,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:07:42,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:07:42,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:07:42,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,748 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-14 15:07:42,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:07:42,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:07:42,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:07:42,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:07:42,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (1/1) ... [2024-06-14 15:07:42,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:07:42,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:07:42,830 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-14 15:07:42,857 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-14 15:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:07:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:07:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:07:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:07:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:07:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:07:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:07:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:07:42,879 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:07:43,047 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:07:43,050 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:07:43,995 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:07:43,995 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:07:44,245 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:07:44,245 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:07:44,252 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:07:44 BoogieIcfgContainer [2024-06-14 15:07:44,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:07:44,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:07:44,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:07:44,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:07:44,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:07:41" (1/4) ... [2024-06-14 15:07:44,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a93f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:07:44, skipping insertion in model container [2024-06-14 15:07:44,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:07:41" (2/4) ... [2024-06-14 15:07:44,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a93f01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:07:44, skipping insertion in model container [2024-06-14 15:07:44,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:07:42" (3/4) ... [2024-06-14 15:07:44,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a93f01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:07:44, skipping insertion in model container [2024-06-14 15:07:44,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:07:44" (4/4) ... [2024-06-14 15:07:44,261 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-14 15:07:44,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:07:44,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:07:44,279 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:07:44,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:07:44,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:07:44,469 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:07:44,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:07:44,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:07:44,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:07:44,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:07:44,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:07:44,499 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;@6387ac1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:07:44,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:07:44,507 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:07:44,507 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:07:44,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:07:44,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:44,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:07:44,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:44,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1723506688, now seen corresponding path program 1 times [2024-06-14 15:07:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013362716] [2024-06-14 15:07:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:50,744 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-14 15:07:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013362716] [2024-06-14 15:07:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013362716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:07:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412314810] [2024-06-14 15:07:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:50,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:07:50,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:50,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:07:50,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:07:50,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:07:50,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-14 15:07:50,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:50,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:07:50,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:51,208 INFO L124 PetriNetUnfolderBase]: 153/294 cut-off events. [2024-06-14 15:07:51,209 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:07:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 294 events. 153/294 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1087 event pairs, 89 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 575. Up to 272 conditions per place. [2024-06-14 15:07:51,216 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:07:51,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-14 15:07:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:07:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:07:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-14 15:07:51,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-06-14 15:07:51,231 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 55 transitions. [2024-06-14 15:07:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-14 15:07:51,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:07:51,236 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:07:51,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:07:51,242 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:07:51,242 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:07:51,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-14 15:07:51,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:51,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:51,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:07:51,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:51,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1566654583, now seen corresponding path program 1 times [2024-06-14 15:07:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303823438] [2024-06-14 15:07:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:55,681 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-14 15:07:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303823438] [2024-06-14 15:07:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303823438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:55,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:55,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:07:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691934149] [2024-06-14 15:07:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:55,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:07:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:55,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:07:55,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:07:55,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:07:55,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-14 15:07:55,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:55,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:07:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:56,066 INFO L124 PetriNetUnfolderBase]: 150/294 cut-off events. [2024-06-14 15:07:56,066 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-06-14 15:07:56,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 294 events. 150/294 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1077 event pairs, 68 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 649. Up to 258 conditions per place. [2024-06-14 15:07:56,073 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:07:56,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-14 15:07:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:07:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:07:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-14 15:07:56,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-14 15:07:56,078 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-14 15:07:56,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-14 15:07:56,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:07:56,082 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:07:56,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:07:56,084 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:07:56,085 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:07:56,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-14 15:07:56,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:56,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:07:56,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:56,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1230432702, now seen corresponding path program 1 times [2024-06-14 15:07:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718070295] [2024-06-14 15:07:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:00,935 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-14 15:08:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:00,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718070295] [2024-06-14 15:08:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718070295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:00,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:00,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:08:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312946822] [2024-06-14 15:08:00,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:00,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:08:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:08:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:08:01,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:08:01,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 15:08:01,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:01,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:08:01,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:01,408 INFO L124 PetriNetUnfolderBase]: 180/341 cut-off events. [2024-06-14 15:08:01,409 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-06-14 15:08:01,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 341 events. 180/341 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1239 event pairs, 52 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 838. Up to 291 conditions per place. [2024-06-14 15:08:01,412 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2024-06-14 15:08:01,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 244 flow [2024-06-14 15:08:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:08:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:08:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 15:08:01,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-14 15:08:01,414 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 6 states and 95 transitions. [2024-06-14 15:08:01,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 244 flow [2024-06-14 15:08:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 232 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:08:01,417 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 136 flow [2024-06-14 15:08:01,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-14 15:08:01,418 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 15:08:01,418 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 136 flow [2024-06-14 15:08:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-14 15:08:01,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:01,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:01,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:08:01,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:01,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -511291276, now seen corresponding path program 1 times [2024-06-14 15:08:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899828172] [2024-06-14 15:08:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:06,180 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-14 15:08:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899828172] [2024-06-14 15:08:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899828172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:08:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142095513] [2024-06-14 15:08:06,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:06,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:08:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:08:06,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:08:06,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:08:06,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-14 15:08:06,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:06,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:08:06,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:06,716 INFO L124 PetriNetUnfolderBase]: 176/331 cut-off events. [2024-06-14 15:08:06,717 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-06-14 15:08:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 331 events. 176/331 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1163 event pairs, 30 based on Foata normal form. 4/327 useless extension candidates. Maximal degree in co-relation 911. Up to 265 conditions per place. [2024-06-14 15:08:06,721 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2024-06-14 15:08:06,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 264 flow [2024-06-14 15:08:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:08:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:08:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 15:08:06,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 15:08:06,726 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 136 flow. Second operand 7 states and 104 transitions. [2024-06-14 15:08:06,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 264 flow [2024-06-14 15:08:06,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 247 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:08:06,729 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 135 flow [2024-06-14 15:08:06,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-06-14 15:08:06,731 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-14 15:08:06,731 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 135 flow [2024-06-14 15:08:06,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-14 15:08:06,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:06,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:06,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:08:06,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:06,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -640432288, now seen corresponding path program 1 times [2024-06-14 15:08:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24169384] [2024-06-14 15:08:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:14,609 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-14 15:08:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24169384] [2024-06-14 15:08:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24169384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:14,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:08:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937453468] [2024-06-14 15:08:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:08:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:08:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:08:14,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:08:14,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-14 15:08:14,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:14,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:08:14,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:15,072 INFO L124 PetriNetUnfolderBase]: 174/328 cut-off events. [2024-06-14 15:08:15,072 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2024-06-14 15:08:15,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 328 events. 174/328 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1151 event pairs, 47 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 950. Up to 304 conditions per place. [2024-06-14 15:08:15,075 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-14 15:08:15,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 223 flow [2024-06-14 15:08:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:08:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:08:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2024-06-14 15:08:15,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:08:15,076 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 135 flow. Second operand 5 states and 65 transitions. [2024-06-14 15:08:15,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 223 flow [2024-06-14 15:08:15,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 199 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:08:15,079 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 138 flow [2024-06-14 15:08:15,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-06-14 15:08:15,080 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-14 15:08:15,080 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 138 flow [2024-06-14 15:08:15,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-14 15:08:15,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:15,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:15,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:08:15,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:15,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1621436392, now seen corresponding path program 1 times [2024-06-14 15:08:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385703573] [2024-06-14 15:08:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:23,107 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-14 15:08:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385703573] [2024-06-14 15:08:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385703573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:08:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153938038] [2024-06-14 15:08:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:23,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:08:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:08:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:08:23,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:08:23,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-14 15:08:23,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:23,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:08:23,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:23,604 INFO L124 PetriNetUnfolderBase]: 199/358 cut-off events. [2024-06-14 15:08:23,605 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2024-06-14 15:08:23,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 358 events. 199/358 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1221 event pairs, 55 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1101. Up to 343 conditions per place. [2024-06-14 15:08:23,608 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2024-06-14 15:08:23,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 238 flow [2024-06-14 15:08:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:08:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:08:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-14 15:08:23,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:08:23,610 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 138 flow. Second operand 6 states and 70 transitions. [2024-06-14 15:08:23,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 238 flow [2024-06-14 15:08:23,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 227 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:08:23,613 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 160 flow [2024-06-14 15:08:23,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 15:08:23,614 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:08:23,614 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 160 flow [2024-06-14 15:08:23,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-14 15:08:23,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:23,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:23,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:08:23,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:23,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -444124955, now seen corresponding path program 1 times [2024-06-14 15:08:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:23,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888224673] [2024-06-14 15:08:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:29,870 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-14 15:08:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888224673] [2024-06-14 15:08:29,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888224673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:29,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:08:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789859725] [2024-06-14 15:08:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:08:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:29,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:08:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:08:29,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:08:29,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-14 15:08:29,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:29,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:08:29,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:30,251 INFO L124 PetriNetUnfolderBase]: 188/349 cut-off events. [2024-06-14 15:08:30,251 INFO L125 PetriNetUnfolderBase]: For 991/991 co-relation queries the response was YES. [2024-06-14 15:08:30,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 349 events. 188/349 cut-off events. For 991/991 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1223 event pairs, 53 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1142. Up to 304 conditions per place. [2024-06-14 15:08:30,254 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-14 15:08:30,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 302 flow [2024-06-14 15:08:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:08:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:08:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2024-06-14 15:08:30,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:08:30,256 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 160 flow. Second operand 6 states and 81 transitions. [2024-06-14 15:08:30,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 302 flow [2024-06-14 15:08:30,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 285 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:08:30,259 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 190 flow [2024-06-14 15:08:30,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-14 15:08:30,259 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:08:30,260 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 190 flow [2024-06-14 15:08:30,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-14 15:08:30,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:30,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:30,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:08:30,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:30,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -416211935, now seen corresponding path program 2 times [2024-06-14 15:08:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135979610] [2024-06-14 15:08:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:36,222 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-14 15:08:36,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135979610] [2024-06-14 15:08:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135979610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:08:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979264895] [2024-06-14 15:08:36,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:36,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:08:36,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:36,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:08:36,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:08:36,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:08:36,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-14 15:08:36,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:36,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:08:36,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:36,651 INFO L124 PetriNetUnfolderBase]: 186/346 cut-off events. [2024-06-14 15:08:36,652 INFO L125 PetriNetUnfolderBase]: For 1268/1268 co-relation queries the response was YES. [2024-06-14 15:08:36,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 346 events. 186/346 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1207 event pairs, 52 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1206. Up to 314 conditions per place. [2024-06-14 15:08:36,657 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-14 15:08:36,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 286 flow [2024-06-14 15:08:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:08:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:08:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-14 15:08:36,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:08:36,660 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 190 flow. Second operand 6 states and 75 transitions. [2024-06-14 15:08:36,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 286 flow [2024-06-14 15:08:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 272 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 15:08:36,664 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 197 flow [2024-06-14 15:08:36,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-14 15:08:36,667 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-14 15:08:36,667 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 197 flow [2024-06-14 15:08:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-14 15:08:36,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:36,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:08:36,669 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:36,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -443909629, now seen corresponding path program 1 times [2024-06-14 15:08:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158889322] [2024-06-14 15:08:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:43,063 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-14 15:08:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158889322] [2024-06-14 15:08:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158889322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:08:43,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791494857] [2024-06-14 15:08:43,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:43,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:08:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:08:43,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:08:43,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:08:43,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:08:43,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:43,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:08:43,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:43,660 INFO L124 PetriNetUnfolderBase]: 194/351 cut-off events. [2024-06-14 15:08:43,660 INFO L125 PetriNetUnfolderBase]: For 1472/1472 co-relation queries the response was YES. [2024-06-14 15:08:43,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 351 events. 194/351 cut-off events. For 1472/1472 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1181 event pairs, 51 based on Foata normal form. 3/352 useless extension candidates. Maximal degree in co-relation 1242. Up to 327 conditions per place. [2024-06-14 15:08:43,663 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2024-06-14 15:08:43,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 323 flow [2024-06-14 15:08:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:08:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:08:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-14 15:08:43,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2024-06-14 15:08:43,664 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 197 flow. Second operand 7 states and 81 transitions. [2024-06-14 15:08:43,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 323 flow [2024-06-14 15:08:43,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 299 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 15:08:43,667 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 212 flow [2024-06-14 15:08:43,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-06-14 15:08:43,668 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-14 15:08:43,668 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 212 flow [2024-06-14 15:08:43,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:08:43,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:43,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:43,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:08:43,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:43,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1050225587, now seen corresponding path program 1 times [2024-06-14 15:08:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830533099] [2024-06-14 15:08:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:49,670 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-14 15:08:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830533099] [2024-06-14 15:08:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830533099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:49,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:49,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:08:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460200243] [2024-06-14 15:08:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:08:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:08:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:08:49,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:08:49,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-14 15:08:49,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:49,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:08:49,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:50,186 INFO L124 PetriNetUnfolderBase]: 183/342 cut-off events. [2024-06-14 15:08:50,186 INFO L125 PetriNetUnfolderBase]: For 1715/1715 co-relation queries the response was YES. [2024-06-14 15:08:50,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 342 events. 183/342 cut-off events. For 1715/1715 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1187 event pairs, 48 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1266. Up to 295 conditions per place. [2024-06-14 15:08:50,190 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 42 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-14 15:08:50,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 358 flow [2024-06-14 15:08:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:08:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:08:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 15:08:50,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:08:50,192 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 212 flow. Second operand 7 states and 91 transitions. [2024-06-14 15:08:50,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 358 flow [2024-06-14 15:08:50,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 335 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:08:50,198 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 228 flow [2024-06-14 15:08:50,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-14 15:08:50,200 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-14 15:08:50,203 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 228 flow [2024-06-14 15:08:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-14 15:08:50,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:50,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:50,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:08:50,203 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:50,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash -882971063, now seen corresponding path program 2 times [2024-06-14 15:08:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:50,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552697882] [2024-06-14 15:08:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:50,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:56,456 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-14 15:08:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552697882] [2024-06-14 15:08:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552697882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:56,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:08:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542736565] [2024-06-14 15:08:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:56,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:08:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:08:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:08:56,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:08:56,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-14 15:08:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:08:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:56,832 INFO L124 PetriNetUnfolderBase]: 186/347 cut-off events. [2024-06-14 15:08:56,832 INFO L125 PetriNetUnfolderBase]: For 2040/2040 co-relation queries the response was YES. [2024-06-14 15:08:56,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 347 events. 186/347 cut-off events. For 2040/2040 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1208 event pairs, 49 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1343. Up to 284 conditions per place. [2024-06-14 15:08:56,836 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 37 selfloop transitions, 17 changer transitions 0/58 dead transitions. [2024-06-14 15:08:56,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 410 flow [2024-06-14 15:08:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:08:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:08:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2024-06-14 15:08:56,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 15:08:56,838 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 228 flow. Second operand 7 states and 100 transitions. [2024-06-14 15:08:56,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 410 flow [2024-06-14 15:08:56,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 387 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:08:56,842 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 276 flow [2024-06-14 15:08:56,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-06-14 15:08:56,843 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-14 15:08:56,844 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 276 flow [2024-06-14 15:08:56,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-14 15:08:56,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:56,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:56,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:08:56,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:56,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1050105431, now seen corresponding path program 1 times [2024-06-14 15:08:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:56,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606181928] [2024-06-14 15:08:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:02,082 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-14 15:09:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606181928] [2024-06-14 15:09:02,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606181928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:02,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:02,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103329321] [2024-06-14 15:09:02,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:02,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:02,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:09:02,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 276 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:02,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:02,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:09:02,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:02,498 INFO L124 PetriNetUnfolderBase]: 215/387 cut-off events. [2024-06-14 15:09:02,498 INFO L125 PetriNetUnfolderBase]: For 2560/2560 co-relation queries the response was YES. [2024-06-14 15:09:02,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 387 events. 215/387 cut-off events. For 2560/2560 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1322 event pairs, 53 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1570. Up to 351 conditions per place. [2024-06-14 15:09:02,501 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 46 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-14 15:09:02,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 498 flow [2024-06-14 15:09:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-14 15:09:02,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:09:02,503 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 276 flow. Second operand 8 states and 92 transitions. [2024-06-14 15:09:02,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 498 flow [2024-06-14 15:09:02,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 472 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:09:02,507 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 371 flow [2024-06-14 15:09:02,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-06-14 15:09:02,508 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2024-06-14 15:09:02,508 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 371 flow [2024-06-14 15:09:02,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:02,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:02,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:02,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:09:02,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:02,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -17667257, now seen corresponding path program 2 times [2024-06-14 15:09:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301866195] [2024-06-14 15:09:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:08,551 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-14 15:09:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301866195] [2024-06-14 15:09:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301866195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:08,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:08,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491423959] [2024-06-14 15:09:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:08,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:09:08,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 371 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:08,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:08,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:09:08,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:08,978 INFO L124 PetriNetUnfolderBase]: 218/392 cut-off events. [2024-06-14 15:09:08,978 INFO L125 PetriNetUnfolderBase]: For 3060/3060 co-relation queries the response was YES. [2024-06-14 15:09:08,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 392 events. 218/392 cut-off events. For 3060/3060 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1336 event pairs, 51 based on Foata normal form. 1/391 useless extension candidates. Maximal degree in co-relation 1719. Up to 366 conditions per place. [2024-06-14 15:09:08,981 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 50 selfloop transitions, 14 changer transitions 0/66 dead transitions. [2024-06-14 15:09:08,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 553 flow [2024-06-14 15:09:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2024-06-14 15:09:08,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2024-06-14 15:09:08,983 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 371 flow. Second operand 7 states and 82 transitions. [2024-06-14 15:09:08,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 553 flow [2024-06-14 15:09:08,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 66 transitions, 547 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-14 15:09:08,988 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 412 flow [2024-06-14 15:09:08,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2024-06-14 15:09:08,988 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2024-06-14 15:09:08,989 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 412 flow [2024-06-14 15:09:08,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:08,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:08,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:08,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:09:08,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:08,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -872974097, now seen corresponding path program 3 times [2024-06-14 15:09:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:08,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272254346] [2024-06-14 15:09:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:14,767 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-14 15:09:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272254346] [2024-06-14 15:09:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272254346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404437698] [2024-06-14 15:09:14,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:14,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:14,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:14,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-14 15:09:14,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:14,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:14,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:15,213 INFO L124 PetriNetUnfolderBase]: 204/377 cut-off events. [2024-06-14 15:09:15,213 INFO L125 PetriNetUnfolderBase]: For 3560/3560 co-relation queries the response was YES. [2024-06-14 15:09:15,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 377 events. 204/377 cut-off events. For 3560/3560 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1309 event pairs, 49 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1701. Up to 334 conditions per place. [2024-06-14 15:09:15,218 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-06-14 15:09:15,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 65 transitions, 542 flow [2024-06-14 15:09:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-14 15:09:15,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2024-06-14 15:09:15,220 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 412 flow. Second operand 7 states and 85 transitions. [2024-06-14 15:09:15,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 65 transitions, 542 flow [2024-06-14 15:09:15,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 65 transitions, 513 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:15,226 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 410 flow [2024-06-14 15:09:15,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-06-14 15:09:15,226 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-14 15:09:15,226 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 410 flow [2024-06-14 15:09:15,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-14 15:09:15,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:15,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:15,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:09:15,227 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:15,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -872736761, now seen corresponding path program 3 times [2024-06-14 15:09:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009233958] [2024-06-14 15:09:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:20,018 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-14 15:09:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009233958] [2024-06-14 15:09:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009233958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587172569] [2024-06-14 15:09:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:20,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:09:20,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 410 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:20,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:20,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:09:20,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:20,428 INFO L124 PetriNetUnfolderBase]: 214/386 cut-off events. [2024-06-14 15:09:20,428 INFO L125 PetriNetUnfolderBase]: For 3871/3871 co-relation queries the response was YES. [2024-06-14 15:09:20,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 386 events. 214/386 cut-off events. For 3871/3871 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1312 event pairs, 51 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1759. Up to 367 conditions per place. [2024-06-14 15:09:20,431 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-06-14 15:09:20,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 65 transitions, 550 flow [2024-06-14 15:09:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 15:09:20,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-14 15:09:20,433 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 410 flow. Second operand 7 states and 79 transitions. [2024-06-14 15:09:20,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 65 transitions, 550 flow [2024-06-14 15:09:20,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 65 transitions, 515 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:09:20,438 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 402 flow [2024-06-14 15:09:20,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-06-14 15:09:20,439 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 44 predicate places. [2024-06-14 15:09:20,439 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 402 flow [2024-06-14 15:09:20,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:20,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:20,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:20,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:09:20,440 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:20,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash 856376485, now seen corresponding path program 4 times [2024-06-14 15:09:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747988151] [2024-06-14 15:09:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:27,838 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-14 15:09:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747988151] [2024-06-14 15:09:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747988151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:27,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275281190] [2024-06-14 15:09:27,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:27,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:27,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:27,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:09:27,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:27,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:27,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:09:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:28,317 INFO L124 PetriNetUnfolderBase]: 212/383 cut-off events. [2024-06-14 15:09:28,317 INFO L125 PetriNetUnfolderBase]: For 4273/4273 co-relation queries the response was YES. [2024-06-14 15:09:28,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 383 events. 212/383 cut-off events. For 4273/4273 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1305 event pairs, 51 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1762. Up to 335 conditions per place. [2024-06-14 15:09:28,320 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 47 selfloop transitions, 24 changer transitions 0/73 dead transitions. [2024-06-14 15:09:28,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 593 flow [2024-06-14 15:09:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:09:28,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:09:28,321 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 402 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:09:28,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 593 flow [2024-06-14 15:09:28,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 566 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 15:09:28,327 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 472 flow [2024-06-14 15:09:28,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=472, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2024-06-14 15:09:28,327 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-14 15:09:28,328 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 472 flow [2024-06-14 15:09:28,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:09:28,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:28,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:28,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:09:28,328 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:28,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1802655646, now seen corresponding path program 1 times [2024-06-14 15:09:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:28,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898116427] [2024-06-14 15:09:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:35,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:35,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898116427] [2024-06-14 15:09:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898116427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277352226] [2024-06-14 15:09:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:35,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:35,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:35,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 472 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:09:35,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:35,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:36,395 INFO L124 PetriNetUnfolderBase]: 208/384 cut-off events. [2024-06-14 15:09:36,395 INFO L125 PetriNetUnfolderBase]: For 5092/5092 co-relation queries the response was YES. [2024-06-14 15:09:36,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 384 events. 208/384 cut-off events. For 5092/5092 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1351 event pairs, 46 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 1889. Up to 310 conditions per place. [2024-06-14 15:09:36,399 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2024-06-14 15:09:36,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 734 flow [2024-06-14 15:09:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:09:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:09:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:09:36,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:09:36,401 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 472 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:09:36,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 734 flow [2024-06-14 15:09:36,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 683 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:36,408 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 498 flow [2024-06-14 15:09:36,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-06-14 15:09:36,408 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-14 15:09:36,409 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 498 flow [2024-06-14 15:09:36,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:09:36,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:36,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:36,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:09:36,409 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:36,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 282849749, now seen corresponding path program 1 times [2024-06-14 15:09:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027406953] [2024-06-14 15:09:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:36,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:42,553 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-14 15:09:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027406953] [2024-06-14 15:09:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027406953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488136880] [2024-06-14 15:09:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:42,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:09:42,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 498 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:09:42,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:42,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:09:42,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:43,007 INFO L124 PetriNetUnfolderBase]: 223/401 cut-off events. [2024-06-14 15:09:43,008 INFO L125 PetriNetUnfolderBase]: For 5642/5642 co-relation queries the response was YES. [2024-06-14 15:09:43,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 401 events. 223/401 cut-off events. For 5642/5642 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1386 event pairs, 47 based on Foata normal form. 1/400 useless extension candidates. Maximal degree in co-relation 2023. Up to 362 conditions per place. [2024-06-14 15:09:43,012 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 63 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2024-06-14 15:09:43,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 706 flow [2024-06-14 15:09:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:09:43,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:09:43,014 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 498 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:09:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 706 flow [2024-06-14 15:09:43,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 671 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:43,022 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 520 flow [2024-06-14 15:09:43,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-06-14 15:09:43,023 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-14 15:09:43,023 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 520 flow [2024-06-14 15:09:43,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:09:43,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:43,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:43,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:09:43,024 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:43,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 286424514, now seen corresponding path program 2 times [2024-06-14 15:09:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:43,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430965679] [2024-06-14 15:09:43,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:49,883 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-14 15:09:49,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430965679] [2024-06-14 15:09:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430965679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520244409] [2024-06-14 15:09:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:49,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:50,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:50,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:09:50,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:50,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:50,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:50,441 INFO L124 PetriNetUnfolderBase]: 211/388 cut-off events. [2024-06-14 15:09:50,442 INFO L125 PetriNetUnfolderBase]: For 6217/6217 co-relation queries the response was YES. [2024-06-14 15:09:50,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 388 events. 211/388 cut-off events. For 6217/6217 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1366 event pairs, 45 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 2018. Up to 325 conditions per place. [2024-06-14 15:09:50,446 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2024-06-14 15:09:50,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 81 transitions, 698 flow [2024-06-14 15:09:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 15:09:50,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 15:09:50,450 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 520 flow. Second operand 8 states and 101 transitions. [2024-06-14 15:09:50,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 81 transitions, 698 flow [2024-06-14 15:09:50,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 653 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:09:50,457 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 512 flow [2024-06-14 15:09:50,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=512, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2024-06-14 15:09:50,458 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 15:09:50,458 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 512 flow [2024-06-14 15:09:50,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:09:50,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:50,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:50,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:09:50,459 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:50,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1491688384, now seen corresponding path program 1 times [2024-06-14 15:09:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626548331] [2024-06-14 15:09:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:56,624 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-14 15:09:56,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:56,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626548331] [2024-06-14 15:09:56,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626548331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:56,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:56,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:56,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467482045] [2024-06-14 15:09:56,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:56,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:56,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:56,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:09:56,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 512 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:09:56,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:56,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:09:56,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:57,064 INFO L124 PetriNetUnfolderBase]: 240/429 cut-off events. [2024-06-14 15:09:57,064 INFO L125 PetriNetUnfolderBase]: For 7613/7613 co-relation queries the response was YES. [2024-06-14 15:09:57,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 429 events. 240/429 cut-off events. For 7613/7613 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1531 event pairs, 52 based on Foata normal form. 3/430 useless extension candidates. Maximal degree in co-relation 2231. Up to 349 conditions per place. [2024-06-14 15:09:57,068 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 59 selfloop transitions, 28 changer transitions 0/89 dead transitions. [2024-06-14 15:09:57,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 786 flow [2024-06-14 15:09:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:09:57,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:09:57,072 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 512 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:09:57,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 786 flow [2024-06-14 15:09:57,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 89 transitions, 749 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:09:57,080 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 582 flow [2024-06-14 15:09:57,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=582, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2024-06-14 15:09:57,082 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-14 15:09:57,082 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 582 flow [2024-06-14 15:09:57,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:09:57,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:57,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:09:57,083 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:57,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1491688601, now seen corresponding path program 2 times [2024-06-14 15:09:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:57,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450316739] [2024-06-14 15:09:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:02,245 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-14 15:10:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450316739] [2024-06-14 15:10:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450316739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349156962] [2024-06-14 15:10:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:02,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:02,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:02,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 582 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:02,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:02,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:02,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:02,643 INFO L124 PetriNetUnfolderBase]: 248/442 cut-off events. [2024-06-14 15:10:02,643 INFO L125 PetriNetUnfolderBase]: For 8253/8253 co-relation queries the response was YES. [2024-06-14 15:10:02,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 442 events. 248/442 cut-off events. For 8253/8253 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1592 event pairs, 51 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 2448. Up to 351 conditions per place. [2024-06-14 15:10:02,647 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 32 changer transitions 0/93 dead transitions. [2024-06-14 15:10:02,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 936 flow [2024-06-14 15:10:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-14 15:10:02,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:10:02,648 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 582 flow. Second operand 8 states and 100 transitions. [2024-06-14 15:10:02,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 936 flow [2024-06-14 15:10:02,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 914 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:10:02,656 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 694 flow [2024-06-14 15:10:02,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=694, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-06-14 15:10:02,657 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-14 15:10:02,657 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 694 flow [2024-06-14 15:10:02,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:02,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:02,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:02,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:10:02,658 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:02,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1806465081, now seen corresponding path program 3 times [2024-06-14 15:10:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:02,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518125262] [2024-06-14 15:10:02,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:02,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:08,666 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-14 15:10:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518125262] [2024-06-14 15:10:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518125262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004741559] [2024-06-14 15:10:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:08,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:08,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:08,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:08,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 694 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:08,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:08,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:08,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:09,037 INFO L124 PetriNetUnfolderBase]: 267/475 cut-off events. [2024-06-14 15:10:09,037 INFO L125 PetriNetUnfolderBase]: For 9299/9299 co-relation queries the response was YES. [2024-06-14 15:10:09,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 475 events. 267/475 cut-off events. For 9299/9299 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1762 event pairs, 58 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2720. Up to 407 conditions per place. [2024-06-14 15:10:09,042 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 28 changer transitions 0/102 dead transitions. [2024-06-14 15:10:09,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 1070 flow [2024-06-14 15:10:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:10:09,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:10:09,043 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 694 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:10:09,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 1070 flow [2024-06-14 15:10:09,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 1012 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-14 15:10:09,056 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 847 flow [2024-06-14 15:10:09,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=847, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2024-06-14 15:10:09,057 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:10:09,057 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 847 flow [2024-06-14 15:10:09,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:09,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:09,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:09,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:10:09,058 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:09,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 286568664, now seen corresponding path program 3 times [2024-06-14 15:10:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371789956] [2024-06-14 15:10:09,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:16,325 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-14 15:10:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:16,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371789956] [2024-06-14 15:10:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371789956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:16,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:16,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724488484] [2024-06-14 15:10:16,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:16,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:16,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:16,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 847 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:10:16,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:16,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:16,775 INFO L124 PetriNetUnfolderBase]: 259/469 cut-off events. [2024-06-14 15:10:16,775 INFO L125 PetriNetUnfolderBase]: For 10367/10367 co-relation queries the response was YES. [2024-06-14 15:10:16,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 469 events. 259/469 cut-off events. For 10367/10367 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1755 event pairs, 48 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 2800. Up to 366 conditions per place. [2024-06-14 15:10:16,779 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 61 selfloop transitions, 28 changer transitions 0/104 dead transitions. [2024-06-14 15:10:16,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 1071 flow [2024-06-14 15:10:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:10:16,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:10:16,780 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 847 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:10:16,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 1071 flow [2024-06-14 15:10:16,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 104 transitions, 1014 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:10:16,790 INFO L231 Difference]: Finished difference. Result has 106 places, 94 transitions, 874 flow [2024-06-14 15:10:16,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=874, PETRI_PLACES=106, PETRI_TRANSITIONS=94} [2024-06-14 15:10:16,791 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-14 15:10:16,791 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 94 transitions, 874 flow [2024-06-14 15:10:16,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:10:16,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:16,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:16,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:10:16,792 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:16,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash -547684096, now seen corresponding path program 2 times [2024-06-14 15:10:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236163014] [2024-06-14 15:10:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:23,053 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-14 15:10:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236163014] [2024-06-14 15:10:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236163014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781761193] [2024-06-14 15:10:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:23,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:23,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:23,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 94 transitions, 874 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:23,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:23,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:23,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:23,518 INFO L124 PetriNetUnfolderBase]: 279/495 cut-off events. [2024-06-14 15:10:23,518 INFO L125 PetriNetUnfolderBase]: For 11664/11664 co-relation queries the response was YES. [2024-06-14 15:10:23,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 495 events. 279/495 cut-off events. For 11664/11664 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1830 event pairs, 56 based on Foata normal form. 3/496 useless extension candidates. Maximal degree in co-relation 2990. Up to 441 conditions per place. [2024-06-14 15:10:23,522 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 18 changer transitions 0/108 dead transitions. [2024-06-14 15:10:23,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 108 transitions, 1178 flow [2024-06-14 15:10:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:10:23,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 15:10:23,524 INFO L175 Difference]: Start difference. First operand has 106 places, 94 transitions, 874 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:10:23,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 108 transitions, 1178 flow [2024-06-14 15:10:23,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 1112 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:23,543 INFO L231 Difference]: Finished difference. Result has 108 places, 96 transitions, 865 flow [2024-06-14 15:10:23,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=865, PETRI_PLACES=108, PETRI_TRANSITIONS=96} [2024-06-14 15:10:23,544 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-14 15:10:23,544 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 96 transitions, 865 flow [2024-06-14 15:10:23,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:23,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:23,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:23,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:10:23,545 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:23,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1285027504, now seen corresponding path program 3 times [2024-06-14 15:10:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910812900] [2024-06-14 15:10:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:29,486 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-14 15:10:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:29,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910812900] [2024-06-14 15:10:29,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910812900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:29,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:29,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964418635] [2024-06-14 15:10:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:29,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:29,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:29,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:29,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 96 transitions, 865 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:29,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:29,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:29,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:30,108 INFO L124 PetriNetUnfolderBase]: 288/510 cut-off events. [2024-06-14 15:10:30,108 INFO L125 PetriNetUnfolderBase]: For 12665/12665 co-relation queries the response was YES. [2024-06-14 15:10:30,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 510 events. 288/510 cut-off events. For 12665/12665 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1905 event pairs, 56 based on Foata normal form. 3/511 useless extension candidates. Maximal degree in co-relation 3079. Up to 481 conditions per place. [2024-06-14 15:10:30,112 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2024-06-14 15:10:30,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 1117 flow [2024-06-14 15:10:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 15:10:30,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:10:30,113 INFO L175 Difference]: Start difference. First operand has 108 places, 96 transitions, 865 flow. Second operand 8 states and 90 transitions. [2024-06-14 15:10:30,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 1117 flow [2024-06-14 15:10:30,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 1061 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:30,127 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 864 flow [2024-06-14 15:10:30,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=864, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2024-06-14 15:10:30,128 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-14 15:10:30,128 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 864 flow [2024-06-14 15:10:30,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:30,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:30,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:30,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:10:30,129 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:30,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1285035161, now seen corresponding path program 4 times [2024-06-14 15:10:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:30,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771507802] [2024-06-14 15:10:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:36,286 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-14 15:10:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:36,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771507802] [2024-06-14 15:10:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771507802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:36,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688690213] [2024-06-14 15:10:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:36,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:36,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:36,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:36,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 864 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:36,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:36,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:36,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:36,722 INFO L124 PetriNetUnfolderBase]: 291/515 cut-off events. [2024-06-14 15:10:36,722 INFO L125 PetriNetUnfolderBase]: For 12850/12850 co-relation queries the response was YES. [2024-06-14 15:10:36,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3178 conditions, 515 events. 291/515 cut-off events. For 12850/12850 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1925 event pairs, 56 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 3123. Up to 492 conditions per place. [2024-06-14 15:10:36,727 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 92 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2024-06-14 15:10:36,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 107 transitions, 1116 flow [2024-06-14 15:10:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:10:36,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:10:36,729 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 864 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:10:36,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 107 transitions, 1116 flow [2024-06-14 15:10:36,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 107 transitions, 1083 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:36,747 INFO L231 Difference]: Finished difference. Result has 112 places, 100 transitions, 892 flow [2024-06-14 15:10:36,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=892, PETRI_PLACES=112, PETRI_TRANSITIONS=100} [2024-06-14 15:10:36,748 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2024-06-14 15:10:36,748 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 100 transitions, 892 flow [2024-06-14 15:10:36,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:36,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:36,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:36,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:10:36,748 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:36,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1292392546, now seen corresponding path program 4 times [2024-06-14 15:10:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954424525] [2024-06-14 15:10:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:43,920 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-14 15:10:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954424525] [2024-06-14 15:10:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954424525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892409137] [2024-06-14 15:10:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:44,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:44,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 100 transitions, 892 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:10:44,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:44,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:44,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:44,336 INFO L124 PetriNetUnfolderBase]: 277/500 cut-off events. [2024-06-14 15:10:44,336 INFO L125 PetriNetUnfolderBase]: For 13572/13572 co-relation queries the response was YES. [2024-06-14 15:10:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 500 events. 277/500 cut-off events. For 13572/13572 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1902 event pairs, 54 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 3040. Up to 440 conditions per place. [2024-06-14 15:10:44,341 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 80 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2024-06-14 15:10:44,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 1116 flow [2024-06-14 15:10:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 15:10:44,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-14 15:10:44,345 INFO L175 Difference]: Start difference. First operand has 112 places, 100 transitions, 892 flow. Second operand 8 states and 95 transitions. [2024-06-14 15:10:44,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 1116 flow [2024-06-14 15:10:44,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 109 transitions, 1077 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:44,366 INFO L231 Difference]: Finished difference. Result has 114 places, 102 transitions, 910 flow [2024-06-14 15:10:44,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=910, PETRI_PLACES=114, PETRI_TRANSITIONS=102} [2024-06-14 15:10:44,367 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2024-06-14 15:10:44,367 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 102 transitions, 910 flow [2024-06-14 15:10:44,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-14 15:10:44,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:44,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:44,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:10:44,368 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:44,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1292392391, now seen corresponding path program 5 times [2024-06-14 15:10:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188609796] [2024-06-14 15:10:44,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:50,266 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-14 15:10:50,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:50,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188609796] [2024-06-14 15:10:50,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188609796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:50,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:50,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033653170] [2024-06-14 15:10:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:50,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:50,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:50,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 102 transitions, 910 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:50,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:50,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:50,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:50,719 INFO L124 PetriNetUnfolderBase]: 292/517 cut-off events. [2024-06-14 15:10:50,719 INFO L125 PetriNetUnfolderBase]: For 14442/14442 co-relation queries the response was YES. [2024-06-14 15:10:50,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 517 events. 292/517 cut-off events. For 14442/14442 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1946 event pairs, 56 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 3195. Up to 478 conditions per place. [2024-06-14 15:10:50,724 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-06-14 15:10:50,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 112 transitions, 1232 flow [2024-06-14 15:10:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:10:50,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:10:50,725 INFO L175 Difference]: Start difference. First operand has 114 places, 102 transitions, 910 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:10:50,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 112 transitions, 1232 flow [2024-06-14 15:10:50,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 1191 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:50,740 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 948 flow [2024-06-14 15:10:50,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=948, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-06-14 15:10:50,741 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-06-14 15:10:50,741 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 948 flow [2024-06-14 15:10:50,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:50,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:50,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:50,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:10:50,742 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:50,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1292386811, now seen corresponding path program 6 times [2024-06-14 15:10:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199650827] [2024-06-14 15:10:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:56,815 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-14 15:10:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199650827] [2024-06-14 15:10:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199650827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267735407] [2024-06-14 15:10:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:56,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:56,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:56,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:10:56,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 948 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:56,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:56,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:10:56,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:57,233 INFO L124 PetriNetUnfolderBase]: 290/514 cut-off events. [2024-06-14 15:10:57,234 INFO L125 PetriNetUnfolderBase]: For 15052/15052 co-relation queries the response was YES. [2024-06-14 15:10:57,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 514 events. 290/514 cut-off events. For 15052/15052 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1933 event pairs, 56 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 3188. Up to 476 conditions per place. [2024-06-14 15:10:57,237 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 21 changer transitions 0/111 dead transitions. [2024-06-14 15:10:57,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 111 transitions, 1182 flow [2024-06-14 15:10:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:10:57,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:10:57,239 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 948 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:10:57,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 111 transitions, 1182 flow [2024-06-14 15:10:57,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 111 transitions, 1110 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:10:57,262 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 923 flow [2024-06-14 15:10:57,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=923, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2024-06-14 15:10:57,263 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:10:57,263 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 923 flow [2024-06-14 15:10:57,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:10:57,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:57,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:57,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:10:57,264 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:57,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1285034944, now seen corresponding path program 4 times [2024-06-14 15:10:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243718723] [2024-06-14 15:10:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:03,169 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-14 15:11:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243718723] [2024-06-14 15:11:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243718723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:11:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413571872] [2024-06-14 15:11:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:03,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:11:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:11:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:11:03,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:11:03,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 923 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:11:03,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:03,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:11:03,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:03,676 INFO L124 PetriNetUnfolderBase]: 284/505 cut-off events. [2024-06-14 15:11:03,676 INFO L125 PetriNetUnfolderBase]: For 15483/15483 co-relation queries the response was YES. [2024-06-14 15:11:03,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 505 events. 284/505 cut-off events. For 15483/15483 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1899 event pairs, 54 based on Foata normal form. 3/506 useless extension candidates. Maximal degree in co-relation 3075. Up to 464 conditions per place. [2024-06-14 15:11:03,680 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 97 selfloop transitions, 16 changer transitions 0/115 dead transitions. [2024-06-14 15:11:03,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 115 transitions, 1177 flow [2024-06-14 15:11:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:11:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:11:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:11:03,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:11:03,681 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 923 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:11:03,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 115 transitions, 1177 flow [2024-06-14 15:11:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 1119 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:11:03,698 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 902 flow [2024-06-14 15:11:03,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=902, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2024-06-14 15:11:03,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:11:03,699 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 902 flow [2024-06-14 15:11:03,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:11:03,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:03,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:03,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:11:03,699 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:03,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 777862333, now seen corresponding path program 7 times [2024-06-14 15:11:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026912282] [2024-06-14 15:11:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:11,932 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-14 15:11:11,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026912282] [2024-06-14 15:11:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026912282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:11,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:11:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651134365] [2024-06-14 15:11:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:11,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:11:11,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:11,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:11:11,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:11:12,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:11:12,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 902 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:11:12,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:12,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:11:12,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:12,588 INFO L124 PetriNetUnfolderBase]: 282/502 cut-off events. [2024-06-14 15:11:12,589 INFO L125 PetriNetUnfolderBase]: For 15107/15107 co-relation queries the response was YES. [2024-06-14 15:11:12,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3108 conditions, 502 events. 282/502 cut-off events. For 15107/15107 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1892 event pairs, 49 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 3049. Up to 397 conditions per place. [2024-06-14 15:11:12,594 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 44 changer transitions 0/118 dead transitions. [2024-06-14 15:11:12,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 118 transitions, 1187 flow [2024-06-14 15:11:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:11:12,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:11:12,595 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 902 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:11:12,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 118 transitions, 1187 flow [2024-06-14 15:11:12,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 1134 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:12,617 INFO L231 Difference]: Finished difference. Result has 122 places, 106 transitions, 986 flow [2024-06-14 15:11:12,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=986, PETRI_PLACES=122, PETRI_TRANSITIONS=106} [2024-06-14 15:11:12,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-14 15:11:12,618 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 106 transitions, 986 flow [2024-06-14 15:11:12,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-14 15:11:12,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:12,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:12,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:11:12,618 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:12,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 47690444, now seen corresponding path program 1 times [2024-06-14 15:11:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098737432] [2024-06-14 15:11:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:19,285 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-14 15:11:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098737432] [2024-06-14 15:11:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098737432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816933624] [2024-06-14 15:11:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:19,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:19,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:19,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:19,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:19,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 106 transitions, 986 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:19,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:19,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:19,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:19,928 INFO L124 PetriNetUnfolderBase]: 280/510 cut-off events. [2024-06-14 15:11:19,928 INFO L125 PetriNetUnfolderBase]: For 17907/17907 co-relation queries the response was YES. [2024-06-14 15:11:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 510 events. 280/510 cut-off events. For 17907/17907 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2000 event pairs, 26 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 3248. Up to 375 conditions per place. [2024-06-14 15:11:19,932 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 84 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-06-14 15:11:19,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 1352 flow [2024-06-14 15:11:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:11:19,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:11:19,933 INFO L175 Difference]: Start difference. First operand has 122 places, 106 transitions, 986 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:11:19,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 1352 flow [2024-06-14 15:11:19,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 127 transitions, 1245 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:11:19,952 INFO L231 Difference]: Finished difference. Result has 126 places, 108 transitions, 971 flow [2024-06-14 15:11:19,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=971, PETRI_PLACES=126, PETRI_TRANSITIONS=108} [2024-06-14 15:11:19,953 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-14 15:11:19,953 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 108 transitions, 971 flow [2024-06-14 15:11:19,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:19,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:19,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:19,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:11:19,954 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:19,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 47751018, now seen corresponding path program 1 times [2024-06-14 15:11:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107176887] [2024-06-14 15:11:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:26,292 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-14 15:11:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107176887] [2024-06-14 15:11:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107176887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:26,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:26,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088067580] [2024-06-14 15:11:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:26,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:26,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:11:26,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 108 transitions, 971 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:11:26,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:26,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:11:26,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:26,858 INFO L124 PetriNetUnfolderBase]: 301/536 cut-off events. [2024-06-14 15:11:26,858 INFO L125 PetriNetUnfolderBase]: For 18868/18868 co-relation queries the response was YES. [2024-06-14 15:11:26,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 536 events. 301/536 cut-off events. For 18868/18868 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2074 event pairs, 45 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 3403. Up to 457 conditions per place. [2024-06-14 15:11:26,862 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 97 selfloop transitions, 30 changer transitions 0/129 dead transitions. [2024-06-14 15:11:26,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 1379 flow [2024-06-14 15:11:26,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:11:26,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:11:26,863 INFO L175 Difference]: Start difference. First operand has 126 places, 108 transitions, 971 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:11:26,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 1379 flow [2024-06-14 15:11:26,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 1323 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:11:26,884 INFO L231 Difference]: Finished difference. Result has 130 places, 112 transitions, 1028 flow [2024-06-14 15:11:26,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1028, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2024-06-14 15:11:26,885 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2024-06-14 15:11:26,885 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 1028 flow [2024-06-14 15:11:26,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:11:26,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:26,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:26,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:11:26,885 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:26,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash 47750894, now seen corresponding path program 2 times [2024-06-14 15:11:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:26,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498899061] [2024-06-14 15:11:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:34,083 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-14 15:11:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498899061] [2024-06-14 15:11:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498899061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:34,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376941827] [2024-06-14 15:11:34,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:34,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:34,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 1028 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:34,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:34,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:34,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:34,719 INFO L124 PetriNetUnfolderBase]: 294/533 cut-off events. [2024-06-14 15:11:34,719 INFO L125 PetriNetUnfolderBase]: For 20942/20942 co-relation queries the response was YES. [2024-06-14 15:11:34,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3491 conditions, 533 events. 294/533 cut-off events. For 20942/20942 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2120 event pairs, 43 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 3429. Up to 424 conditions per place. [2024-06-14 15:11:34,723 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 86 selfloop transitions, 25 changer transitions 0/130 dead transitions. [2024-06-14 15:11:34,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 130 transitions, 1308 flow [2024-06-14 15:11:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:11:34,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:11:34,725 INFO L175 Difference]: Start difference. First operand has 130 places, 112 transitions, 1028 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:11:34,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 130 transitions, 1308 flow [2024-06-14 15:11:34,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 130 transitions, 1254 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 15:11:34,752 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 1042 flow [2024-06-14 15:11:34,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1042, PETRI_PLACES=134, PETRI_TRANSITIONS=113} [2024-06-14 15:11:34,753 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-14 15:11:34,753 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 1042 flow [2024-06-14 15:11:34,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:34,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:34,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:34,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:11:34,753 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:34,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash 178408498, now seen corresponding path program 1 times [2024-06-14 15:11:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:34,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591933594] [2024-06-14 15:11:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:41,154 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-14 15:11:41,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591933594] [2024-06-14 15:11:41,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591933594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:41,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:41,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191222767] [2024-06-14 15:11:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:41,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:41,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:11:41,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 113 transitions, 1042 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:11:41,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:41,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:11:41,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:41,662 INFO L124 PetriNetUnfolderBase]: 314/559 cut-off events. [2024-06-14 15:11:41,663 INFO L125 PetriNetUnfolderBase]: For 22697/22697 co-relation queries the response was YES. [2024-06-14 15:11:41,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3684 conditions, 559 events. 314/559 cut-off events. For 22697/22697 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2212 event pairs, 44 based on Foata normal form. 3/560 useless extension candidates. Maximal degree in co-relation 3620. Up to 500 conditions per place. [2024-06-14 15:11:41,667 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 103 selfloop transitions, 24 changer transitions 0/129 dead transitions. [2024-06-14 15:11:41,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 129 transitions, 1350 flow [2024-06-14 15:11:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:11:41,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:11:41,668 INFO L175 Difference]: Start difference. First operand has 134 places, 113 transitions, 1042 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:11:41,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 129 transitions, 1350 flow [2024-06-14 15:11:41,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 1294 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:11:41,692 INFO L231 Difference]: Finished difference. Result has 135 places, 115 transitions, 1062 flow [2024-06-14 15:11:41,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1062, PETRI_PLACES=135, PETRI_TRANSITIONS=115} [2024-06-14 15:11:41,693 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-14 15:11:41,693 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 115 transitions, 1062 flow [2024-06-14 15:11:41,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:11:41,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:41,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:41,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:11:41,693 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:41,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash 161374698, now seen corresponding path program 2 times [2024-06-14 15:11:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:41,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348559265] [2024-06-14 15:11:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:47,912 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-14 15:11:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348559265] [2024-06-14 15:11:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348559265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:47,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:47,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009731227] [2024-06-14 15:11:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:47,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:47,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:48,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:11:48,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 115 transitions, 1062 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:11:48,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:48,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:11:48,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:48,444 INFO L124 PetriNetUnfolderBase]: 317/564 cut-off events. [2024-06-14 15:11:48,444 INFO L125 PetriNetUnfolderBase]: For 22649/22649 co-relation queries the response was YES. [2024-06-14 15:11:48,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 564 events. 317/564 cut-off events. For 22649/22649 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2233 event pairs, 44 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 3703. Up to 511 conditions per place. [2024-06-14 15:11:48,448 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 103 selfloop transitions, 24 changer transitions 0/129 dead transitions. [2024-06-14 15:11:48,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 129 transitions, 1368 flow [2024-06-14 15:11:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 15:11:48,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-14 15:11:48,450 INFO L175 Difference]: Start difference. First operand has 135 places, 115 transitions, 1062 flow. Second operand 9 states and 103 transitions. [2024-06-14 15:11:48,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 129 transitions, 1368 flow [2024-06-14 15:11:48,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 129 transitions, 1310 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:48,479 INFO L231 Difference]: Finished difference. Result has 137 places, 117 transitions, 1084 flow [2024-06-14 15:11:48,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1084, PETRI_PLACES=137, PETRI_TRANSITIONS=117} [2024-06-14 15:11:48,479 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-14 15:11:48,480 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 117 transitions, 1084 flow [2024-06-14 15:11:48,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:11:48,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:48,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:48,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:11:48,480 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:48,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 178403538, now seen corresponding path program 3 times [2024-06-14 15:11:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:48,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104096441] [2024-06-14 15:11:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:55,905 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-14 15:11:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104096441] [2024-06-14 15:11:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104096441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:55,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909389124] [2024-06-14 15:11:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:55,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:56,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:56,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 117 transitions, 1084 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:56,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:56,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:56,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:56,518 INFO L124 PetriNetUnfolderBase]: 302/547 cut-off events. [2024-06-14 15:11:56,518 INFO L125 PetriNetUnfolderBase]: For 23411/23411 co-relation queries the response was YES. [2024-06-14 15:11:56,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 547 events. 302/547 cut-off events. For 23411/23411 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2194 event pairs, 41 based on Foata normal form. 2/547 useless extension candidates. Maximal degree in co-relation 3547. Up to 451 conditions per place. [2024-06-14 15:11:56,523 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 89 selfloop transitions, 21 changer transitions 0/130 dead transitions. [2024-06-14 15:11:56,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 130 transitions, 1336 flow [2024-06-14 15:11:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:11:56,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:11:56,526 INFO L175 Difference]: Start difference. First operand has 137 places, 117 transitions, 1084 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:11:56,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 130 transitions, 1336 flow [2024-06-14 15:11:56,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 130 transitions, 1270 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:56,568 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 1064 flow [2024-06-14 15:11:56,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1064, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2024-06-14 15:11:56,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-14 15:11:56,569 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 1064 flow [2024-06-14 15:11:56,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:56,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:56,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:56,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:11:56,570 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:56,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash 50547528, now seen corresponding path program 3 times [2024-06-14 15:11:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:56,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496866994] [2024-06-14 15:11:56,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:03,053 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-14 15:12:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496866994] [2024-06-14 15:12:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496866994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128972246] [2024-06-14 15:12:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:03,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:03,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 1064 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:03,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:03,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:03,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:03,559 INFO L124 PetriNetUnfolderBase]: 312/556 cut-off events. [2024-06-14 15:12:03,559 INFO L125 PetriNetUnfolderBase]: For 22999/22999 co-relation queries the response was YES. [2024-06-14 15:12:03,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 556 events. 312/556 cut-off events. For 22999/22999 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2186 event pairs, 43 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3571. Up to 495 conditions per place. [2024-06-14 15:12:03,563 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 27 changer transitions 0/129 dead transitions. [2024-06-14 15:12:03,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 129 transitions, 1348 flow [2024-06-14 15:12:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:12:03,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:12:03,564 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 1064 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:12:03,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 129 transitions, 1348 flow [2024-06-14 15:12:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 129 transitions, 1290 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:03,595 INFO L231 Difference]: Finished difference. Result has 140 places, 117 transitions, 1065 flow [2024-06-14 15:12:03,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1065, PETRI_PLACES=140, PETRI_TRANSITIONS=117} [2024-06-14 15:12:03,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-06-14 15:12:03,596 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 117 transitions, 1065 flow [2024-06-14 15:12:03,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:03,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:03,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:03,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:12:03,596 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:03,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash 920878356, now seen corresponding path program 4 times [2024-06-14 15:12:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:03,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933111064] [2024-06-14 15:12:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:10,458 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-14 15:12:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:10,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933111064] [2024-06-14 15:12:10,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933111064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:10,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:10,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:10,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710554618] [2024-06-14 15:12:10,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:10,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:10,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:10,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:10,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:10,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:10,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 117 transitions, 1065 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:10,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:10,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:10,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:10,896 INFO L124 PetriNetUnfolderBase]: 320/569 cut-off events. [2024-06-14 15:12:10,896 INFO L125 PetriNetUnfolderBase]: For 24980/24980 co-relation queries the response was YES. [2024-06-14 15:12:10,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 569 events. 320/569 cut-off events. For 24980/24980 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2264 event pairs, 45 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 3712. Up to 446 conditions per place. [2024-06-14 15:12:10,903 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 79 selfloop transitions, 51 changer transitions 0/132 dead transitions. [2024-06-14 15:12:10,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 132 transitions, 1479 flow [2024-06-14 15:12:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:12:10,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:12:10,910 INFO L175 Difference]: Start difference. First operand has 140 places, 117 transitions, 1065 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:12:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 132 transitions, 1479 flow [2024-06-14 15:12:10,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 1406 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:10,960 INFO L231 Difference]: Finished difference. Result has 141 places, 121 transitions, 1155 flow [2024-06-14 15:12:10,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1155, PETRI_PLACES=141, PETRI_TRANSITIONS=121} [2024-06-14 15:12:10,961 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-14 15:12:10,962 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 121 transitions, 1155 flow [2024-06-14 15:12:10,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:10,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:10,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:10,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:12:10,962 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:10,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1868355016, now seen corresponding path program 4 times [2024-06-14 15:12:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034883015] [2024-06-14 15:12:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:19,094 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-14 15:12:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034883015] [2024-06-14 15:12:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034883015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813089874] [2024-06-14 15:12:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:19,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:19,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:19,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:19,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 121 transitions, 1155 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:19,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:19,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:19,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:19,638 INFO L124 PetriNetUnfolderBase]: 314/567 cut-off events. [2024-06-14 15:12:19,638 INFO L125 PetriNetUnfolderBase]: For 27530/27530 co-relation queries the response was YES. [2024-06-14 15:12:19,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 567 events. 314/567 cut-off events. For 27530/27530 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2309 event pairs, 46 based on Foata normal form. 2/567 useless extension candidates. Maximal degree in co-relation 3781. Up to 445 conditions per place. [2024-06-14 15:12:19,642 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 81 selfloop transitions, 30 changer transitions 0/133 dead transitions. [2024-06-14 15:12:19,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 133 transitions, 1421 flow [2024-06-14 15:12:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:12:19,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:12:19,644 INFO L175 Difference]: Start difference. First operand has 141 places, 121 transitions, 1155 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:12:19,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 133 transitions, 1421 flow [2024-06-14 15:12:19,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 133 transitions, 1331 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:12:19,680 INFO L231 Difference]: Finished difference. Result has 145 places, 122 transitions, 1149 flow [2024-06-14 15:12:19,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=145, PETRI_TRANSITIONS=122} [2024-06-14 15:12:19,680 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 114 predicate places. [2024-06-14 15:12:19,680 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 122 transitions, 1149 flow [2024-06-14 15:12:19,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:19,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:19,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:12:19,681 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:19,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash 293879158, now seen corresponding path program 2 times [2024-06-14 15:12:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037664001] [2024-06-14 15:12:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:26,248 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-14 15:12:26,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:26,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037664001] [2024-06-14 15:12:26,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037664001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:26,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610359725] [2024-06-14 15:12:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:26,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:26,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:26,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 122 transitions, 1149 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:26,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:26,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:26,724 INFO L124 PetriNetUnfolderBase]: 358/632 cut-off events. [2024-06-14 15:12:26,724 INFO L125 PetriNetUnfolderBase]: For 33622/33622 co-relation queries the response was YES. [2024-06-14 15:12:26,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 632 events. 358/632 cut-off events. For 33622/33622 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2612 event pairs, 53 based on Foata normal form. 3/633 useless extension candidates. Maximal degree in co-relation 4357. Up to 406 conditions per place. [2024-06-14 15:12:26,730 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 55 changer transitions 0/146 dead transitions. [2024-06-14 15:12:26,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 146 transitions, 1709 flow [2024-06-14 15:12:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:12:26,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:12:26,732 INFO L175 Difference]: Start difference. First operand has 145 places, 122 transitions, 1149 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:12:26,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 146 transitions, 1709 flow [2024-06-14 15:12:26,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 1635 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:12:26,794 INFO L231 Difference]: Finished difference. Result has 147 places, 128 transitions, 1260 flow [2024-06-14 15:12:26,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1260, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2024-06-14 15:12:26,795 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2024-06-14 15:12:26,795 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 1260 flow [2024-06-14 15:12:26,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:26,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:26,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:26,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:12:26,796 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:26,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1868359790, now seen corresponding path program 5 times [2024-06-14 15:12:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174889216] [2024-06-14 15:12:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:33,624 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-14 15:12:33,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174889216] [2024-06-14 15:12:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174889216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:33,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041342403] [2024-06-14 15:12:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:33,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:33,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:33,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:33,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 1260 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:33,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:33,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:33,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:34,080 INFO L124 PetriNetUnfolderBase]: 361/637 cut-off events. [2024-06-14 15:12:34,080 INFO L125 PetriNetUnfolderBase]: For 33764/33764 co-relation queries the response was YES. [2024-06-14 15:12:34,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4573 conditions, 637 events. 361/637 cut-off events. For 33764/33764 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2632 event pairs, 56 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 4501. Up to 527 conditions per place. [2024-06-14 15:12:34,086 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 89 selfloop transitions, 49 changer transitions 0/140 dead transitions. [2024-06-14 15:12:34,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 140 transitions, 1580 flow [2024-06-14 15:12:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 15:12:34,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:12:34,093 INFO L175 Difference]: Start difference. First operand has 147 places, 128 transitions, 1260 flow. Second operand 9 states and 108 transitions. [2024-06-14 15:12:34,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 140 transitions, 1580 flow [2024-06-14 15:12:34,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 140 transitions, 1517 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 15:12:34,156 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 1325 flow [2024-06-14 15:12:34,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1325, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2024-06-14 15:12:34,157 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-14 15:12:34,157 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 1325 flow [2024-06-14 15:12:34,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:34,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:34,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:34,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:12:34,158 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:34,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash 166016328, now seen corresponding path program 6 times [2024-06-14 15:12:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:34,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011167215] [2024-06-14 15:12:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:40,898 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-14 15:12:40,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:40,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011167215] [2024-06-14 15:12:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011167215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833629236] [2024-06-14 15:12:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:40,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:41,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:41,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 1325 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:41,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:41,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:41,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:41,381 INFO L124 PetriNetUnfolderBase]: 364/642 cut-off events. [2024-06-14 15:12:41,381 INFO L125 PetriNetUnfolderBase]: For 35325/35325 co-relation queries the response was YES. [2024-06-14 15:12:41,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 642 events. 364/642 cut-off events. For 35325/35325 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2659 event pairs, 64 based on Foata normal form. 1/641 useless extension candidates. Maximal degree in co-relation 4595. Up to 570 conditions per place. [2024-06-14 15:12:41,386 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 105 selfloop transitions, 35 changer transitions 0/142 dead transitions. [2024-06-14 15:12:41,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 142 transitions, 1660 flow [2024-06-14 15:12:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:12:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:12:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:12:41,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:12:41,389 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 1325 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:12:41,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 142 transitions, 1660 flow [2024-06-14 15:12:41,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 142 transitions, 1554 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:12:41,437 INFO L231 Difference]: Finished difference. Result has 156 places, 133 transitions, 1340 flow [2024-06-14 15:12:41,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1340, PETRI_PLACES=156, PETRI_TRANSITIONS=133} [2024-06-14 15:12:41,438 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 15:12:41,438 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 133 transitions, 1340 flow [2024-06-14 15:12:41,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:41,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:41,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:41,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:12:41,438 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:41,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 293699668, now seen corresponding path program 3 times [2024-06-14 15:12:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862099082] [2024-06-14 15:12:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:47,799 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-14 15:12:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862099082] [2024-06-14 15:12:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862099082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:47,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:47,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516196562] [2024-06-14 15:12:47,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:47,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:47,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:47,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:47,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 133 transitions, 1340 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:47,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:47,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:47,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:48,281 INFO L124 PetriNetUnfolderBase]: 373/657 cut-off events. [2024-06-14 15:12:48,281 INFO L125 PetriNetUnfolderBase]: For 38831/38831 co-relation queries the response was YES. [2024-06-14 15:12:48,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4762 conditions, 657 events. 373/657 cut-off events. For 38831/38831 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2741 event pairs, 53 based on Foata normal form. 3/658 useless extension candidates. Maximal degree in co-relation 4686. Up to 424 conditions per place. [2024-06-14 15:12:48,286 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 52 changer transitions 0/155 dead transitions. [2024-06-14 15:12:48,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 155 transitions, 1892 flow [2024-06-14 15:12:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:12:48,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-14 15:12:48,288 INFO L175 Difference]: Start difference. First operand has 156 places, 133 transitions, 1340 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:12:48,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 155 transitions, 1892 flow [2024-06-14 15:12:48,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 1828 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:12:48,343 INFO L231 Difference]: Finished difference. Result has 160 places, 135 transitions, 1408 flow [2024-06-14 15:12:48,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1408, PETRI_PLACES=160, PETRI_TRANSITIONS=135} [2024-06-14 15:12:48,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-14 15:12:48,344 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 135 transitions, 1408 flow [2024-06-14 15:12:48,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:48,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:48,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:48,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:12:48,344 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:48,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash 166016514, now seen corresponding path program 4 times [2024-06-14 15:12:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:48,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327142811] [2024-06-14 15:12:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:55,085 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-14 15:12:55,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:55,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327142811] [2024-06-14 15:12:55,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327142811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:55,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:55,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:55,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556832089] [2024-06-14 15:12:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:55,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:55,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:55,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:55,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:12:55,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 135 transitions, 1408 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:55,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:55,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:12:55,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:55,522 INFO L124 PetriNetUnfolderBase]: 367/648 cut-off events. [2024-06-14 15:12:55,522 INFO L125 PetriNetUnfolderBase]: For 37855/37855 co-relation queries the response was YES. [2024-06-14 15:12:55,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4700 conditions, 648 events. 367/648 cut-off events. For 37855/37855 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2695 event pairs, 51 based on Foata normal form. 3/649 useless extension candidates. Maximal degree in co-relation 4623. Up to 420 conditions per place. [2024-06-14 15:12:55,527 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 98 selfloop transitions, 54 changer transitions 0/154 dead transitions. [2024-06-14 15:12:55,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 154 transitions, 1850 flow [2024-06-14 15:12:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:12:55,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:12:55,528 INFO L175 Difference]: Start difference. First operand has 160 places, 135 transitions, 1408 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:12:55,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 154 transitions, 1850 flow [2024-06-14 15:12:55,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 154 transitions, 1737 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 15:12:55,587 INFO L231 Difference]: Finished difference. Result has 163 places, 135 transitions, 1409 flow [2024-06-14 15:12:55,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1409, PETRI_PLACES=163, PETRI_TRANSITIONS=135} [2024-06-14 15:12:55,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-14 15:12:55,587 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 135 transitions, 1409 flow [2024-06-14 15:12:55,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:12:55,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:55,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:55,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:12:55,588 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:55,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash 201478412, now seen corresponding path program 5 times [2024-06-14 15:12:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795294839] [2024-06-14 15:12:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:03,121 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-14 15:13:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:03,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795294839] [2024-06-14 15:13:03,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795294839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:03,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:03,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466740020] [2024-06-14 15:13:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:03,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:03,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:03,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 135 transitions, 1409 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:03,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:03,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:03,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:03,695 INFO L124 PetriNetUnfolderBase]: 351/630 cut-off events. [2024-06-14 15:13:03,695 INFO L125 PetriNetUnfolderBase]: For 36496/36496 co-relation queries the response was YES. [2024-06-14 15:13:03,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4509 conditions, 630 events. 351/630 cut-off events. For 36496/36496 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2657 event pairs, 57 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 4431. Up to 549 conditions per place. [2024-06-14 15:13:03,700 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 106 selfloop transitions, 14 changer transitions 0/144 dead transitions. [2024-06-14 15:13:03,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 144 transitions, 1669 flow [2024-06-14 15:13:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:13:03,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:13:03,702 INFO L175 Difference]: Start difference. First operand has 163 places, 135 transitions, 1409 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:13:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 144 transitions, 1669 flow [2024-06-14 15:13:03,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 144 transitions, 1534 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:13:03,757 INFO L231 Difference]: Finished difference. Result has 163 places, 135 transitions, 1306 flow [2024-06-14 15:13:03,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1306, PETRI_PLACES=163, PETRI_TRANSITIONS=135} [2024-06-14 15:13:03,757 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-14 15:13:03,758 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 135 transitions, 1306 flow [2024-06-14 15:13:03,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:03,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:03,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:03,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:13:03,758 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:03,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1409457772, now seen corresponding path program 7 times [2024-06-14 15:13:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747480445] [2024-06-14 15:13:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:10,198 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-14 15:13:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747480445] [2024-06-14 15:13:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747480445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:10,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092455446] [2024-06-14 15:13:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:10,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:10,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:10,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:10,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:13:10,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 135 transitions, 1306 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:10,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:10,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:13:10,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:10,642 INFO L124 PetriNetUnfolderBase]: 367/648 cut-off events. [2024-06-14 15:13:10,643 INFO L125 PetriNetUnfolderBase]: For 36413/36413 co-relation queries the response was YES. [2024-06-14 15:13:10,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 648 events. 367/648 cut-off events. For 36413/36413 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2705 event pairs, 59 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 4447. Up to 607 conditions per place. [2024-06-14 15:13:10,648 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 119 selfloop transitions, 24 changer transitions 0/145 dead transitions. [2024-06-14 15:13:10,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1640 flow [2024-06-14 15:13:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:13:10,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:13:10,649 INFO L175 Difference]: Start difference. First operand has 163 places, 135 transitions, 1306 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:13:10,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1640 flow [2024-06-14 15:13:10,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 145 transitions, 1560 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:13:10,716 INFO L231 Difference]: Finished difference. Result has 164 places, 137 transitions, 1313 flow [2024-06-14 15:13:10,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1313, PETRI_PLACES=164, PETRI_TRANSITIONS=137} [2024-06-14 15:13:10,716 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-14 15:13:10,716 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 137 transitions, 1313 flow [2024-06-14 15:13:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:10,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:10,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:10,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:13:10,717 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:10,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:10,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1409457586, now seen corresponding path program 5 times [2024-06-14 15:13:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324290589] [2024-06-14 15:13:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:16,907 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-14 15:13:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324290589] [2024-06-14 15:13:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324290589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259073553] [2024-06-14 15:13:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:16,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:17,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:13:17,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 137 transitions, 1313 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:17,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:17,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:13:17,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:17,345 INFO L124 PetriNetUnfolderBase]: 376/663 cut-off events. [2024-06-14 15:13:17,345 INFO L125 PetriNetUnfolderBase]: For 40116/40116 co-relation queries the response was YES. [2024-06-14 15:13:17,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 663 events. 376/663 cut-off events. For 40116/40116 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2787 event pairs, 57 based on Foata normal form. 3/664 useless extension candidates. Maximal degree in co-relation 4533. Up to 552 conditions per place. [2024-06-14 15:13:17,350 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 28 changer transitions 0/154 dead transitions. [2024-06-14 15:13:17,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 154 transitions, 1775 flow [2024-06-14 15:13:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:13:17,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:13:17,351 INFO L175 Difference]: Start difference. First operand has 164 places, 137 transitions, 1313 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:13:17,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 154 transitions, 1775 flow [2024-06-14 15:13:17,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 154 transitions, 1654 flow, removed 18 selfloop flow, removed 11 redundant places. [2024-06-14 15:13:17,421 INFO L231 Difference]: Finished difference. Result has 162 places, 139 transitions, 1279 flow [2024-06-14 15:13:17,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=162, PETRI_TRANSITIONS=139} [2024-06-14 15:13:17,422 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 15:13:17,422 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 139 transitions, 1279 flow [2024-06-14 15:13:17,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:17,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:17,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:17,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:13:17,422 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:17,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 331477832, now seen corresponding path program 8 times [2024-06-14 15:13:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398645225] [2024-06-14 15:13:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:24,490 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-14 15:13:24,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398645225] [2024-06-14 15:13:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398645225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:24,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485723875] [2024-06-14 15:13:24,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:24,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:24,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:24,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:24,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:24,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:13:24,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 139 transitions, 1279 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:24,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:24,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:13:24,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:25,006 INFO L124 PetriNetUnfolderBase]: 379/668 cut-off events. [2024-06-14 15:13:25,006 INFO L125 PetriNetUnfolderBase]: For 39226/39226 co-relation queries the response was YES. [2024-06-14 15:13:25,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4559 conditions, 668 events. 379/668 cut-off events. For 39226/39226 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2805 event pairs, 63 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 4482. Up to 615 conditions per place. [2024-06-14 15:13:25,011 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 122 selfloop transitions, 28 changer transitions 0/152 dead transitions. [2024-06-14 15:13:25,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 152 transitions, 1759 flow [2024-06-14 15:13:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:13:25,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-14 15:13:25,012 INFO L175 Difference]: Start difference. First operand has 162 places, 139 transitions, 1279 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:13:25,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 152 transitions, 1759 flow [2024-06-14 15:13:25,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 152 transitions, 1677 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:13:25,075 INFO L231 Difference]: Finished difference. Result has 164 places, 143 transitions, 1326 flow [2024-06-14 15:13:25,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1326, PETRI_PLACES=164, PETRI_TRANSITIONS=143} [2024-06-14 15:13:25,076 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-14 15:13:25,076 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 143 transitions, 1326 flow [2024-06-14 15:13:25,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:25,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:25,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:25,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:13:25,077 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:25,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1409278096, now seen corresponding path program 6 times [2024-06-14 15:13:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36313728] [2024-06-14 15:13:25,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:31,337 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-14 15:13:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36313728] [2024-06-14 15:13:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36313728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:31,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737297476] [2024-06-14 15:13:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:31,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:31,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:31,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:13:31,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 143 transitions, 1326 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:31,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:31,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:13:31,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:31,843 INFO L124 PetriNetUnfolderBase]: 403/707 cut-off events. [2024-06-14 15:13:31,843 INFO L125 PetriNetUnfolderBase]: For 46896/46896 co-relation queries the response was YES. [2024-06-14 15:13:31,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 707 events. 403/707 cut-off events. For 46896/46896 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3018 event pairs, 65 based on Foata normal form. 3/708 useless extension candidates. Maximal degree in co-relation 4828. Up to 577 conditions per place. [2024-06-14 15:13:31,849 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 131 selfloop transitions, 30 changer transitions 0/163 dead transitions. [2024-06-14 15:13:31,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 163 transitions, 1928 flow [2024-06-14 15:13:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:13:31,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:13:31,850 INFO L175 Difference]: Start difference. First operand has 164 places, 143 transitions, 1326 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:13:31,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 163 transitions, 1928 flow [2024-06-14 15:13:31,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 163 transitions, 1861 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-14 15:13:31,925 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 1368 flow [2024-06-14 15:13:31,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1368, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2024-06-14 15:13:31,925 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-14 15:13:31,925 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 1368 flow [2024-06-14 15:13:31,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:31,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:31,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:31,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:13:31,926 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:31,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash 331655462, now seen corresponding path program 9 times [2024-06-14 15:13:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170299107] [2024-06-14 15:13:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:38,269 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-14 15:13:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170299107] [2024-06-14 15:13:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170299107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036079270] [2024-06-14 15:13:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:38,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:13:38,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 1368 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:38,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:38,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:13:38,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:38,705 INFO L124 PetriNetUnfolderBase]: 406/712 cut-off events. [2024-06-14 15:13:38,705 INFO L125 PetriNetUnfolderBase]: For 46261/46261 co-relation queries the response was YES. [2024-06-14 15:13:38,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 712 events. 406/712 cut-off events. For 46261/46261 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3047 event pairs, 69 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 4928. Up to 671 conditions per place. [2024-06-14 15:13:38,711 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 132 selfloop transitions, 23 changer transitions 0/157 dead transitions. [2024-06-14 15:13:38,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 157 transitions, 1720 flow [2024-06-14 15:13:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:13:38,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:13:38,712 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 1368 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:13:38,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 157 transitions, 1720 flow [2024-06-14 15:13:38,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 157 transitions, 1667 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:13:38,778 INFO L231 Difference]: Finished difference. Result has 173 places, 149 transitions, 1394 flow [2024-06-14 15:13:38,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1394, PETRI_PLACES=173, PETRI_TRANSITIONS=149} [2024-06-14 15:13:38,778 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-14 15:13:38,778 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 149 transitions, 1394 flow [2024-06-14 15:13:38,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:38,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:38,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:13:38,779 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:38,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1173094118, now seen corresponding path program 1 times [2024-06-14 15:13:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842648033] [2024-06-14 15:13:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:38,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:44,126 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-14 15:13:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842648033] [2024-06-14 15:13:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842648033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995002073] [2024-06-14 15:13:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:44,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:13:44,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 149 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:44,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:44,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:13:44,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:44,717 INFO L124 PetriNetUnfolderBase]: 402/706 cut-off events. [2024-06-14 15:13:44,717 INFO L125 PetriNetUnfolderBase]: For 46795/46795 co-relation queries the response was YES. [2024-06-14 15:13:44,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 706 events. 402/706 cut-off events. For 46795/46795 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3010 event pairs, 61 based on Foata normal form. 2/706 useless extension candidates. Maximal degree in co-relation 4781. Up to 672 conditions per place. [2024-06-14 15:13:44,723 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 144 selfloop transitions, 15 changer transitions 0/161 dead transitions. [2024-06-14 15:13:44,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 161 transitions, 1752 flow [2024-06-14 15:13:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:13:44,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:13:44,724 INFO L175 Difference]: Start difference. First operand has 173 places, 149 transitions, 1394 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:13:44,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 161 transitions, 1752 flow [2024-06-14 15:13:44,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 161 transitions, 1693 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:13:44,797 INFO L231 Difference]: Finished difference. Result has 174 places, 151 transitions, 1392 flow [2024-06-14 15:13:44,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1392, PETRI_PLACES=174, PETRI_TRANSITIONS=151} [2024-06-14 15:13:44,798 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-14 15:13:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 151 transitions, 1392 flow [2024-06-14 15:13:44,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:13:44,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:44,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:44,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:13:44,798 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:44,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1181376946, now seen corresponding path program 7 times [2024-06-14 15:13:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:44,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498817790] [2024-06-14 15:13:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:49,964 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-14 15:13:49,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498817790] [2024-06-14 15:13:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498817790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:49,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105803174] [2024-06-14 15:13:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:49,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:49,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:49,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:50,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:50,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 151 transitions, 1392 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:50,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:50,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:50,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:50,439 INFO L124 PetriNetUnfolderBase]: 426/745 cut-off events. [2024-06-14 15:13:50,439 INFO L125 PetriNetUnfolderBase]: For 54039/54039 co-relation queries the response was YES. [2024-06-14 15:13:50,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5239 conditions, 745 events. 426/745 cut-off events. For 54039/54039 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3222 event pairs, 68 based on Foata normal form. 3/746 useless extension candidates. Maximal degree in co-relation 5157. Up to 656 conditions per place. [2024-06-14 15:13:50,446 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 147 selfloop transitions, 22 changer transitions 0/171 dead transitions. [2024-06-14 15:13:50,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 171 transitions, 2026 flow [2024-06-14 15:13:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:13:50,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:13:50,447 INFO L175 Difference]: Start difference. First operand has 174 places, 151 transitions, 1392 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:13:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 171 transitions, 2026 flow [2024-06-14 15:13:50,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 171 transitions, 1982 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:13:50,534 INFO L231 Difference]: Finished difference. Result has 176 places, 155 transitions, 1445 flow [2024-06-14 15:13:50,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1445, PETRI_PLACES=176, PETRI_TRANSITIONS=155} [2024-06-14 15:13:50,534 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 15:13:50,534 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 155 transitions, 1445 flow [2024-06-14 15:13:50,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:50,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:50,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:50,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:13:50,535 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:50,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1181383642, now seen corresponding path program 10 times [2024-06-14 15:13:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:50,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441481360] [2024-06-14 15:13:50,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:56,139 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-14 15:13:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:56,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441481360] [2024-06-14 15:13:56,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441481360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:56,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938604619] [2024-06-14 15:13:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:56,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:56,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:56,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 155 transitions, 1445 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:56,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:56,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:56,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:56,562 INFO L124 PetriNetUnfolderBase]: 424/742 cut-off events. [2024-06-14 15:13:56,562 INFO L125 PetriNetUnfolderBase]: For 52063/52063 co-relation queries the response was YES. [2024-06-14 15:13:56,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 742 events. 424/742 cut-off events. For 52063/52063 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3215 event pairs, 72 based on Foata normal form. 1/741 useless extension candidates. Maximal degree in co-relation 5144. Up to 716 conditions per place. [2024-06-14 15:13:56,569 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 146 selfloop transitions, 15 changer transitions 0/163 dead transitions. [2024-06-14 15:13:56,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 163 transitions, 1785 flow [2024-06-14 15:13:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:13:56,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:13:56,570 INFO L175 Difference]: Start difference. First operand has 176 places, 155 transitions, 1445 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:13:56,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 163 transitions, 1785 flow [2024-06-14 15:13:56,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 163 transitions, 1717 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:13:56,657 INFO L231 Difference]: Finished difference. Result has 179 places, 155 transitions, 1412 flow [2024-06-14 15:13:56,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1412, PETRI_PLACES=179, PETRI_TRANSITIONS=155} [2024-06-14 15:13:56,657 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-14 15:13:56,658 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 155 transitions, 1412 flow [2024-06-14 15:13:56,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:56,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:56,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:56,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:13:56,658 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:56,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1181146306, now seen corresponding path program 8 times [2024-06-14 15:13:56,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:56,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504410899] [2024-06-14 15:13:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:02,566 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-14 15:14:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504410899] [2024-06-14 15:14:02,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504410899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:02,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:02,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151226797] [2024-06-14 15:14:02,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:02,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:02,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:02,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:02,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 155 transitions, 1412 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:02,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:02,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:03,095 INFO L124 PetriNetUnfolderBase]: 418/733 cut-off events. [2024-06-14 15:14:03,095 INFO L125 PetriNetUnfolderBase]: For 52199/52199 co-relation queries the response was YES. [2024-06-14 15:14:03,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 733 events. 418/733 cut-off events. For 52199/52199 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3173 event pairs, 66 based on Foata normal form. 3/734 useless extension candidates. Maximal degree in co-relation 4898. Up to 691 conditions per place. [2024-06-14 15:14:03,102 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 150 selfloop transitions, 15 changer transitions 0/167 dead transitions. [2024-06-14 15:14:03,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 167 transitions, 1772 flow [2024-06-14 15:14:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 15:14:03,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 15:14:03,103 INFO L175 Difference]: Start difference. First operand has 179 places, 155 transitions, 1412 flow. Second operand 9 states and 101 transitions. [2024-06-14 15:14:03,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 167 transitions, 1772 flow [2024-06-14 15:14:03,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 167 transitions, 1711 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:03,187 INFO L231 Difference]: Finished difference. Result has 180 places, 155 transitions, 1386 flow [2024-06-14 15:14:03,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1386, PETRI_PLACES=180, PETRI_TRANSITIONS=155} [2024-06-14 15:14:03,187 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-14 15:14:03,187 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 155 transitions, 1386 flow [2024-06-14 15:14:03,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:03,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:03,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:03,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:14:03,188 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:03,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1409284606, now seen corresponding path program 9 times [2024-06-14 15:14:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398150073] [2024-06-14 15:14:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:09,308 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-14 15:14:09,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:09,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398150073] [2024-06-14 15:14:09,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398150073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852426688] [2024-06-14 15:14:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:09,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:09,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 155 transitions, 1386 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:09,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:09,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:09,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:09,819 INFO L124 PetriNetUnfolderBase]: 412/724 cut-off events. [2024-06-14 15:14:09,819 INFO L125 PetriNetUnfolderBase]: For 49591/49591 co-relation queries the response was YES. [2024-06-14 15:14:09,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4785 conditions, 724 events. 412/724 cut-off events. For 49591/49591 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3130 event pairs, 64 based on Foata normal form. 3/725 useless extension candidates. Maximal degree in co-relation 4700. Up to 585 conditions per place. [2024-06-14 15:14:09,825 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 137 selfloop transitions, 33 changer transitions 0/172 dead transitions. [2024-06-14 15:14:09,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 172 transitions, 1880 flow [2024-06-14 15:14:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:14:09,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:14:09,826 INFO L175 Difference]: Start difference. First operand has 180 places, 155 transitions, 1386 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:14:09,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 172 transitions, 1880 flow [2024-06-14 15:14:09,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 172 transitions, 1831 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:09,902 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1408 flow [2024-06-14 15:14:09,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1408, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-14 15:14:09,903 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-14 15:14:09,903 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1408 flow [2024-06-14 15:14:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:09,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:09,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:09,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:14:09,903 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:09,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash -315144996, now seen corresponding path program 10 times [2024-06-14 15:14:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250831682] [2024-06-14 15:14:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:15,490 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-14 15:14:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250831682] [2024-06-14 15:14:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250831682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610144928] [2024-06-14 15:14:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:15,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:15,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:15,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1408 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:15,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:15,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:15,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:16,025 INFO L124 PetriNetUnfolderBase]: 406/715 cut-off events. [2024-06-14 15:14:16,025 INFO L125 PetriNetUnfolderBase]: For 46566/46566 co-relation queries the response was YES. [2024-06-14 15:14:16,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 715 events. 406/715 cut-off events. For 46566/46566 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3098 event pairs, 58 based on Foata normal form. 3/716 useless extension candidates. Maximal degree in co-relation 4556. Up to 636 conditions per place. [2024-06-14 15:14:16,030 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 143 selfloop transitions, 24 changer transitions 0/169 dead transitions. [2024-06-14 15:14:16,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 169 transitions, 1778 flow [2024-06-14 15:14:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:14:16,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:14:16,031 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1408 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:14:16,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 169 transitions, 1778 flow [2024-06-14 15:14:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 169 transitions, 1694 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:16,108 INFO L231 Difference]: Finished difference. Result has 183 places, 155 transitions, 1377 flow [2024-06-14 15:14:16,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1377, PETRI_PLACES=183, PETRI_TRANSITIONS=155} [2024-06-14 15:14:16,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-14 15:14:16,108 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 155 transitions, 1377 flow [2024-06-14 15:14:16,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:16,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:16,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:16,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:14:16,109 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:16,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1655897788, now seen corresponding path program 11 times [2024-06-14 15:14:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092811682] [2024-06-14 15:14:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:22,910 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-14 15:14:22,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:22,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092811682] [2024-06-14 15:14:22,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092811682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:22,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:22,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482454269] [2024-06-14 15:14:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:23,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:23,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 155 transitions, 1377 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:23,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:23,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:23,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:23,598 INFO L124 PetriNetUnfolderBase]: 404/712 cut-off events. [2024-06-14 15:14:23,598 INFO L125 PetriNetUnfolderBase]: For 43070/43070 co-relation queries the response was YES. [2024-06-14 15:14:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 712 events. 404/712 cut-off events. For 43070/43070 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3071 event pairs, 60 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 4456. Up to 604 conditions per place. [2024-06-14 15:14:23,604 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 118 selfloop transitions, 47 changer transitions 0/167 dead transitions. [2024-06-14 15:14:23,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 167 transitions, 1737 flow [2024-06-14 15:14:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:14:23,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:14:23,605 INFO L175 Difference]: Start difference. First operand has 183 places, 155 transitions, 1377 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:14:23,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 167 transitions, 1737 flow [2024-06-14 15:14:23,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 167 transitions, 1656 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:14:23,681 INFO L231 Difference]: Finished difference. Result has 183 places, 155 transitions, 1395 flow [2024-06-14 15:14:23,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1395, PETRI_PLACES=183, PETRI_TRANSITIONS=155} [2024-06-14 15:14:23,682 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-14 15:14:23,682 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 155 transitions, 1395 flow [2024-06-14 15:14:23,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:14:23,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:23,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:23,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:14:23,683 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:23,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 438146052, now seen corresponding path program 1 times [2024-06-14 15:14:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531569984] [2024-06-14 15:14:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:30,966 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-14 15:14:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531569984] [2024-06-14 15:14:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531569984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404346647] [2024-06-14 15:14:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:31,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:31,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 155 transitions, 1395 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-14 15:14:31,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:31,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:31,533 INFO L124 PetriNetUnfolderBase]: 401/707 cut-off events. [2024-06-14 15:14:31,533 INFO L125 PetriNetUnfolderBase]: For 42986/42986 co-relation queries the response was YES. [2024-06-14 15:14:31,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 707 events. 401/707 cut-off events. For 42986/42986 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3039 event pairs, 60 based on Foata normal form. 2/707 useless extension candidates. Maximal degree in co-relation 4342. Up to 675 conditions per place. [2024-06-14 15:14:31,538 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 149 selfloop transitions, 14 changer transitions 0/165 dead transitions. [2024-06-14 15:14:31,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 165 transitions, 1743 flow [2024-06-14 15:14:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:14:31,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:14:31,539 INFO L175 Difference]: Start difference. First operand has 183 places, 155 transitions, 1395 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:14:31,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 165 transitions, 1743 flow [2024-06-14 15:14:31,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 165 transitions, 1632 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:31,620 INFO L231 Difference]: Finished difference. Result has 184 places, 155 transitions, 1316 flow [2024-06-14 15:14:31,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1316, PETRI_PLACES=184, PETRI_TRANSITIONS=155} [2024-06-14 15:14:31,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-14 15:14:31,621 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 155 transitions, 1316 flow [2024-06-14 15:14:31,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-14 15:14:31,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:31,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:31,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:14:31,621 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:31,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1478404604, now seen corresponding path program 1 times [2024-06-14 15:14:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096514393] [2024-06-14 15:14:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:39,454 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-14 15:14:39,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096514393] [2024-06-14 15:14:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096514393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639776372] [2024-06-14 15:14:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:39,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:39,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:39,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:39,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 155 transitions, 1316 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:14:39,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:39,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:39,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:40,143 INFO L124 PetriNetUnfolderBase]: 412/728 cut-off events. [2024-06-14 15:14:40,143 INFO L125 PetriNetUnfolderBase]: For 47964/47964 co-relation queries the response was YES. [2024-06-14 15:14:40,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 728 events. 412/728 cut-off events. For 47964/47964 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3178 event pairs, 39 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 4533. Up to 582 conditions per place. [2024-06-14 15:14:40,148 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 142 selfloop transitions, 34 changer transitions 0/178 dead transitions. [2024-06-14 15:14:40,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 178 transitions, 1880 flow [2024-06-14 15:14:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:14:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:14:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:14:40,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 15:14:40,151 INFO L175 Difference]: Start difference. First operand has 184 places, 155 transitions, 1316 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:14:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 178 transitions, 1880 flow [2024-06-14 15:14:40,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 178 transitions, 1846 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:14:40,245 INFO L231 Difference]: Finished difference. Result has 188 places, 157 transitions, 1396 flow [2024-06-14 15:14:40,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1396, PETRI_PLACES=188, PETRI_TRANSITIONS=157} [2024-06-14 15:14:40,246 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-14 15:14:40,246 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 157 transitions, 1396 flow [2024-06-14 15:14:40,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:14:40,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:40,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:40,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:14:40,246 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:40,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1480278554, now seen corresponding path program 2 times [2024-06-14 15:14:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969392593] [2024-06-14 15:14:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:47,893 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-14 15:14:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969392593] [2024-06-14 15:14:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969392593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38928736] [2024-06-14 15:14:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:47,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:47,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:48,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:48,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 157 transitions, 1396 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:14:48,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:48,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:48,554 INFO L124 PetriNetUnfolderBase]: 423/749 cut-off events. [2024-06-14 15:14:48,555 INFO L125 PetriNetUnfolderBase]: For 53634/53634 co-relation queries the response was YES. [2024-06-14 15:14:48,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 749 events. 423/749 cut-off events. For 53634/53634 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3318 event pairs, 57 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 4869. Up to 647 conditions per place. [2024-06-14 15:14:48,561 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 143 selfloop transitions, 34 changer transitions 0/179 dead transitions. [2024-06-14 15:14:48,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 179 transitions, 1966 flow [2024-06-14 15:14:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:14:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:14:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 15:14:48,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 15:14:48,562 INFO L175 Difference]: Start difference. First operand has 188 places, 157 transitions, 1396 flow. Second operand 11 states and 130 transitions. [2024-06-14 15:14:48,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 179 transitions, 1966 flow [2024-06-14 15:14:48,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 179 transitions, 1871 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 15:14:48,674 INFO L231 Difference]: Finished difference. Result has 192 places, 159 transitions, 1419 flow [2024-06-14 15:14:48,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1419, PETRI_PLACES=192, PETRI_TRANSITIONS=159} [2024-06-14 15:14:48,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-14 15:14:48,675 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 159 transitions, 1419 flow [2024-06-14 15:14:48,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:14:48,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:48,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:48,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:14:48,675 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:48,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash 858743654, now seen corresponding path program 3 times [2024-06-14 15:14:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:48,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462436643] [2024-06-14 15:14:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:56,450 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-14 15:14:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:56,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462436643] [2024-06-14 15:14:56,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462436643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:56,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:56,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861737993] [2024-06-14 15:14:56,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:56,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:56,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:56,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:56,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:14:56,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 159 transitions, 1419 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:14:56,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:56,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:14:56,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:57,068 INFO L124 PetriNetUnfolderBase]: 420/744 cut-off events. [2024-06-14 15:14:57,069 INFO L125 PetriNetUnfolderBase]: For 51582/51582 co-relation queries the response was YES. [2024-06-14 15:14:57,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 744 events. 420/744 cut-off events. For 51582/51582 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3288 event pairs, 58 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 4689. Up to 659 conditions per place. [2024-06-14 15:14:57,074 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 142 selfloop transitions, 33 changer transitions 0/177 dead transitions. [2024-06-14 15:14:57,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 177 transitions, 1817 flow [2024-06-14 15:14:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:14:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:14:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:14:57,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 15:14:57,075 INFO L175 Difference]: Start difference. First operand has 192 places, 159 transitions, 1419 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:14:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 177 transitions, 1817 flow [2024-06-14 15:14:57,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 177 transitions, 1754 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:14:57,192 INFO L231 Difference]: Finished difference. Result has 196 places, 159 transitions, 1426 flow [2024-06-14 15:14:57,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1426, PETRI_PLACES=196, PETRI_TRANSITIONS=159} [2024-06-14 15:14:57,193 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 165 predicate places. [2024-06-14 15:14:57,193 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 159 transitions, 1426 flow [2024-06-14 15:14:57,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:14:57,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:57,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:14:57,193 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:57,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1480282429, now seen corresponding path program 1 times [2024-06-14 15:14:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503333569] [2024-06-14 15:14:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:04,417 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-14 15:15:04,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:04,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503333569] [2024-06-14 15:15:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503333569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:04,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:04,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715724140] [2024-06-14 15:15:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:04,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:04,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:04,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:04,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 159 transitions, 1426 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:04,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:04,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:04,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:05,178 INFO L124 PetriNetUnfolderBase]: 429/759 cut-off events. [2024-06-14 15:15:05,179 INFO L125 PetriNetUnfolderBase]: For 55114/55114 co-relation queries the response was YES. [2024-06-14 15:15:05,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 759 events. 429/759 cut-off events. For 55114/55114 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3391 event pairs, 57 based on Foata normal form. 3/760 useless extension candidates. Maximal degree in co-relation 4807. Up to 652 conditions per place. [2024-06-14 15:15:05,185 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 142 selfloop transitions, 40 changer transitions 0/184 dead transitions. [2024-06-14 15:15:05,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 184 transitions, 1880 flow [2024-06-14 15:15:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:15:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:15:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-14 15:15:05,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35096153846153844 [2024-06-14 15:15:05,186 INFO L175 Difference]: Start difference. First operand has 196 places, 159 transitions, 1426 flow. Second operand 13 states and 146 transitions. [2024-06-14 15:15:05,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 184 transitions, 1880 flow [2024-06-14 15:15:05,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 184 transitions, 1812 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:15:05,294 INFO L231 Difference]: Finished difference. Result has 199 places, 162 transitions, 1485 flow [2024-06-14 15:15:05,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1485, PETRI_PLACES=199, PETRI_TRANSITIONS=162} [2024-06-14 15:15:05,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2024-06-14 15:15:05,295 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 162 transitions, 1485 flow [2024-06-14 15:15:05,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:05,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:05,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:05,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:15:05,296 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:05,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1945907058, now seen corresponding path program 4 times [2024-06-14 15:15:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472166473] [2024-06-14 15:15:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:12,299 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-14 15:15:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472166473] [2024-06-14 15:15:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472166473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892064544] [2024-06-14 15:15:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:12,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:12,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 162 transitions, 1485 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:12,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:12,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:12,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:12,973 INFO L124 PetriNetUnfolderBase]: 433/767 cut-off events. [2024-06-14 15:15:12,974 INFO L125 PetriNetUnfolderBase]: For 54780/54780 co-relation queries the response was YES. [2024-06-14 15:15:12,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5058 conditions, 767 events. 433/767 cut-off events. For 54780/54780 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3439 event pairs, 59 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 4964. Up to 700 conditions per place. [2024-06-14 15:15:12,980 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 147 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2024-06-14 15:15:12,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 177 transitions, 1883 flow [2024-06-14 15:15:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:15:12,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:15:12,983 INFO L175 Difference]: Start difference. First operand has 199 places, 162 transitions, 1485 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:15:12,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 177 transitions, 1883 flow [2024-06-14 15:15:13,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 177 transitions, 1784 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-14 15:15:13,098 INFO L231 Difference]: Finished difference. Result has 198 places, 163 transitions, 1462 flow [2024-06-14 15:15:13,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1462, PETRI_PLACES=198, PETRI_TRANSITIONS=163} [2024-06-14 15:15:13,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 167 predicate places. [2024-06-14 15:15:13,099 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 163 transitions, 1462 flow [2024-06-14 15:15:13,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:13,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:13,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:13,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:15:13,100 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:13,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1235691092, now seen corresponding path program 5 times [2024-06-14 15:15:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:13,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305583542] [2024-06-14 15:15:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:20,842 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-14 15:15:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305583542] [2024-06-14 15:15:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305583542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:20,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219504029] [2024-06-14 15:15:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:20,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:20,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:20,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:21,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:21,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 163 transitions, 1462 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:21,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:21,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:21,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:21,516 INFO L124 PetriNetUnfolderBase]: 437/775 cut-off events. [2024-06-14 15:15:21,516 INFO L125 PetriNetUnfolderBase]: For 56417/56417 co-relation queries the response was YES. [2024-06-14 15:15:21,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5063 conditions, 775 events. 437/775 cut-off events. For 56417/56417 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3484 event pairs, 61 based on Foata normal form. 2/775 useless extension candidates. Maximal degree in co-relation 4968. Up to 716 conditions per place. [2024-06-14 15:15:21,523 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 150 selfloop transitions, 26 changer transitions 0/178 dead transitions. [2024-06-14 15:15:21,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 178 transitions, 1864 flow [2024-06-14 15:15:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:15:21,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:15:21,524 INFO L175 Difference]: Start difference. First operand has 198 places, 163 transitions, 1462 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:15:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 178 transitions, 1864 flow [2024-06-14 15:15:21,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 178 transitions, 1800 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:15:21,632 INFO L231 Difference]: Finished difference. Result has 200 places, 164 transitions, 1472 flow [2024-06-14 15:15:21,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1472, PETRI_PLACES=200, PETRI_TRANSITIONS=164} [2024-06-14 15:15:21,633 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-14 15:15:21,633 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 164 transitions, 1472 flow [2024-06-14 15:15:21,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:21,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:21,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:21,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:15:21,634 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:21,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 862314854, now seen corresponding path program 6 times [2024-06-14 15:15:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18670914] [2024-06-14 15:15:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:29,858 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-14 15:15:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18670914] [2024-06-14 15:15:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18670914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82213813] [2024-06-14 15:15:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:29,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:29,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:29,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:30,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:30,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 164 transitions, 1472 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:30,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:30,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:30,472 INFO L124 PetriNetUnfolderBase]: 434/770 cut-off events. [2024-06-14 15:15:30,472 INFO L125 PetriNetUnfolderBase]: For 53865/53865 co-relation queries the response was YES. [2024-06-14 15:15:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 770 events. 434/770 cut-off events. For 53865/53865 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3462 event pairs, 58 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 4825. Up to 683 conditions per place. [2024-06-14 15:15:30,479 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 147 selfloop transitions, 30 changer transitions 0/179 dead transitions. [2024-06-14 15:15:30,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 179 transitions, 1862 flow [2024-06-14 15:15:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:15:30,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:15:30,481 INFO L175 Difference]: Start difference. First operand has 200 places, 164 transitions, 1472 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:15:30,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 179 transitions, 1862 flow [2024-06-14 15:15:30,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 179 transitions, 1792 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:15:30,613 INFO L231 Difference]: Finished difference. Result has 202 places, 164 transitions, 1466 flow [2024-06-14 15:15:30,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1466, PETRI_PLACES=202, PETRI_TRANSITIONS=164} [2024-06-14 15:15:30,613 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-14 15:15:30,613 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 164 transitions, 1466 flow [2024-06-14 15:15:30,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:30,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:30,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:30,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:15:30,614 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:30,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 514605916, now seen corresponding path program 7 times [2024-06-14 15:15:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517918837] [2024-06-14 15:15:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:38,149 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-14 15:15:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:38,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517918837] [2024-06-14 15:15:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517918837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:38,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:38,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601283304] [2024-06-14 15:15:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:38,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:38,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:38,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:38,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 164 transitions, 1466 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:38,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:38,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:38,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:38,666 INFO L124 PetriNetUnfolderBase]: 438/778 cut-off events. [2024-06-14 15:15:38,666 INFO L125 PetriNetUnfolderBase]: For 55541/55541 co-relation queries the response was YES. [2024-06-14 15:15:38,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4981 conditions, 778 events. 438/778 cut-off events. For 55541/55541 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3510 event pairs, 64 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 4884. Up to 648 conditions per place. [2024-06-14 15:15:38,673 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 119 selfloop transitions, 56 changer transitions 0/177 dead transitions. [2024-06-14 15:15:38,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 177 transitions, 1866 flow [2024-06-14 15:15:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:15:38,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:15:38,675 INFO L175 Difference]: Start difference. First operand has 202 places, 164 transitions, 1466 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:15:38,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 177 transitions, 1866 flow [2024-06-14 15:15:38,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 177 transitions, 1775 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:15:38,772 INFO L231 Difference]: Finished difference. Result has 202 places, 165 transitions, 1515 flow [2024-06-14 15:15:38,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1515, PETRI_PLACES=202, PETRI_TRANSITIONS=165} [2024-06-14 15:15:38,773 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-14 15:15:38,773 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 165 transitions, 1515 flow [2024-06-14 15:15:38,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:38,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:38,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:15:38,773 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:38,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 514606071, now seen corresponding path program 2 times [2024-06-14 15:15:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359053736] [2024-06-14 15:15:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:46,042 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-14 15:15:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359053736] [2024-06-14 15:15:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359053736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:46,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:46,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685985498] [2024-06-14 15:15:46,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:46,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:46,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:46,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:46,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 165 transitions, 1515 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:46,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:46,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:46,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:46,626 INFO L124 PetriNetUnfolderBase]: 446/791 cut-off events. [2024-06-14 15:15:46,626 INFO L125 PetriNetUnfolderBase]: For 57486/57486 co-relation queries the response was YES. [2024-06-14 15:15:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 791 events. 446/791 cut-off events. For 57486/57486 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3601 event pairs, 49 based on Foata normal form. 1/790 useless extension candidates. Maximal degree in co-relation 5046. Up to 597 conditions per place. [2024-06-14 15:15:46,632 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 138 selfloop transitions, 58 changer transitions 0/198 dead transitions. [2024-06-14 15:15:46,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 198 transitions, 2215 flow [2024-06-14 15:15:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:15:46,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:15:46,634 INFO L175 Difference]: Start difference. First operand has 202 places, 165 transitions, 1515 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:15:46,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 198 transitions, 2215 flow [2024-06-14 15:15:46,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 198 transitions, 2085 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:15:46,742 INFO L231 Difference]: Finished difference. Result has 207 places, 183 transitions, 1710 flow [2024-06-14 15:15:46,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1710, PETRI_PLACES=207, PETRI_TRANSITIONS=183} [2024-06-14 15:15:46,742 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-14 15:15:46,743 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 183 transitions, 1710 flow [2024-06-14 15:15:46,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:46,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:46,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:46,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:15:46,743 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:46,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 851545323, now seen corresponding path program 3 times [2024-06-14 15:15:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699735250] [2024-06-14 15:15:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:53,556 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-14 15:15:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699735250] [2024-06-14 15:15:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699735250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182472047] [2024-06-14 15:15:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:53,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:53,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:15:53,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 183 transitions, 1710 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:53,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:53,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:15:53,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:54,062 INFO L124 PetriNetUnfolderBase]: 449/796 cut-off events. [2024-06-14 15:15:54,062 INFO L125 PetriNetUnfolderBase]: For 59320/59320 co-relation queries the response was YES. [2024-06-14 15:15:54,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5367 conditions, 796 events. 449/796 cut-off events. For 59320/59320 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3647 event pairs, 49 based on Foata normal form. 1/795 useless extension candidates. Maximal degree in co-relation 5266. Up to 635 conditions per place. [2024-06-14 15:15:54,069 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 142 selfloop transitions, 57 changer transitions 0/201 dead transitions. [2024-06-14 15:15:54,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 201 transitions, 2201 flow [2024-06-14 15:15:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:15:54,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:15:54,070 INFO L175 Difference]: Start difference. First operand has 207 places, 183 transitions, 1710 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:15:54,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 201 transitions, 2201 flow [2024-06-14 15:15:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 201 transitions, 2128 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-14 15:15:54,195 INFO L231 Difference]: Finished difference. Result has 213 places, 187 transitions, 1806 flow [2024-06-14 15:15:54,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1806, PETRI_PLACES=213, PETRI_TRANSITIONS=187} [2024-06-14 15:15:54,196 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 15:15:54,196 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 187 transitions, 1806 flow [2024-06-14 15:15:54,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:15:54,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:54,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:54,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:15:54,197 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:54,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash 846182943, now seen corresponding path program 4 times [2024-06-14 15:15:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:54,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254693911] [2024-06-14 15:15:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:00,665 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-14 15:16:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254693911] [2024-06-14 15:16:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254693911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993677248] [2024-06-14 15:16:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:00,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:00,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:00,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:00,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 187 transitions, 1806 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:00,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:00,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:00,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:01,176 INFO L124 PetriNetUnfolderBase]: 452/801 cut-off events. [2024-06-14 15:16:01,176 INFO L125 PetriNetUnfolderBase]: For 61048/61048 co-relation queries the response was YES. [2024-06-14 15:16:01,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 801 events. 452/801 cut-off events. For 61048/61048 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3682 event pairs, 47 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 5348. Up to 640 conditions per place. [2024-06-14 15:16:01,183 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 146 selfloop transitions, 55 changer transitions 0/203 dead transitions. [2024-06-14 15:16:01,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 203 transitions, 2281 flow [2024-06-14 15:16:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:16:01,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:16:01,185 INFO L175 Difference]: Start difference. First operand has 213 places, 187 transitions, 1806 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:16:01,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 203 transitions, 2281 flow [2024-06-14 15:16:01,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 203 transitions, 2186 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:16:01,303 INFO L231 Difference]: Finished difference. Result has 218 places, 189 transitions, 1856 flow [2024-06-14 15:16:01,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1856, PETRI_PLACES=218, PETRI_TRANSITIONS=189} [2024-06-14 15:16:01,303 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2024-06-14 15:16:01,303 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 189 transitions, 1856 flow [2024-06-14 15:16:01,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:01,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:01,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:16:01,304 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:01,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 851747133, now seen corresponding path program 5 times [2024-06-14 15:16:01,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:01,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984725488] [2024-06-14 15:16:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:01,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:07,240 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-14 15:16:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984725488] [2024-06-14 15:16:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984725488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013471437] [2024-06-14 15:16:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:07,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:07,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:07,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 189 transitions, 1856 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:07,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:07,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:07,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:07,762 INFO L124 PetriNetUnfolderBase]: 455/806 cut-off events. [2024-06-14 15:16:07,762 INFO L125 PetriNetUnfolderBase]: For 62907/62907 co-relation queries the response was YES. [2024-06-14 15:16:07,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5527 conditions, 806 events. 455/806 cut-off events. For 62907/62907 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3693 event pairs, 47 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 5424. Up to 645 conditions per place. [2024-06-14 15:16:07,768 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 142 selfloop transitions, 61 changer transitions 0/205 dead transitions. [2024-06-14 15:16:07,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 205 transitions, 2339 flow [2024-06-14 15:16:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:16:07,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:16:07,769 INFO L175 Difference]: Start difference. First operand has 218 places, 189 transitions, 1856 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:16:07,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 205 transitions, 2339 flow [2024-06-14 15:16:07,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 205 transitions, 2201 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:16:07,882 INFO L231 Difference]: Finished difference. Result has 220 places, 191 transitions, 1879 flow [2024-06-14 15:16:07,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1879, PETRI_PLACES=220, PETRI_TRANSITIONS=191} [2024-06-14 15:16:07,883 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 189 predicate places. [2024-06-14 15:16:07,883 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 191 transitions, 1879 flow [2024-06-14 15:16:07,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:07,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:07,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:07,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:16:07,883 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:07,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 851539588, now seen corresponding path program 8 times [2024-06-14 15:16:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273093057] [2024-06-14 15:16:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:14,938 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-14 15:16:14,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:14,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273093057] [2024-06-14 15:16:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273093057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031720222] [2024-06-14 15:16:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:14,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:14,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:15,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:15,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 191 transitions, 1879 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:15,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:15,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:15,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:15,540 INFO L124 PetriNetUnfolderBase]: 459/814 cut-off events. [2024-06-14 15:16:15,540 INFO L125 PetriNetUnfolderBase]: For 67262/67262 co-relation queries the response was YES. [2024-06-14 15:16:15,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 814 events. 459/814 cut-off events. For 67262/67262 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3722 event pairs, 60 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 5508. Up to 695 conditions per place. [2024-06-14 15:16:15,546 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 54 changer transitions 0/204 dead transitions. [2024-06-14 15:16:15,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 204 transitions, 2335 flow [2024-06-14 15:16:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 15:16:15,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 15:16:15,548 INFO L175 Difference]: Start difference. First operand has 220 places, 191 transitions, 1879 flow. Second operand 10 states and 116 transitions. [2024-06-14 15:16:15,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 204 transitions, 2335 flow [2024-06-14 15:16:15,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 204 transitions, 2203 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:16:15,664 INFO L231 Difference]: Finished difference. Result has 223 places, 192 transitions, 1886 flow [2024-06-14 15:16:15,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1886, PETRI_PLACES=223, PETRI_TRANSITIONS=192} [2024-06-14 15:16:15,664 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-14 15:16:15,665 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 192 transitions, 1886 flow [2024-06-14 15:16:15,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:15,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:15,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:15,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:16:15,665 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:15,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash 851539743, now seen corresponding path program 6 times [2024-06-14 15:16:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235248513] [2024-06-14 15:16:15,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:22,439 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-14 15:16:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235248513] [2024-06-14 15:16:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235248513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:22,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299355690] [2024-06-14 15:16:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:22,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:22,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:22,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:22,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 192 transitions, 1886 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:22,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:22,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:22,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:23,039 INFO L124 PetriNetUnfolderBase]: 472/835 cut-off events. [2024-06-14 15:16:23,039 INFO L125 PetriNetUnfolderBase]: For 71883/71883 co-relation queries the response was YES. [2024-06-14 15:16:23,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5897 conditions, 835 events. 472/835 cut-off events. For 71883/71883 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3847 event pairs, 59 based on Foata normal form. 1/834 useless extension candidates. Maximal degree in co-relation 5792. Up to 545 conditions per place. [2024-06-14 15:16:23,047 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 125 selfloop transitions, 85 changer transitions 0/212 dead transitions. [2024-06-14 15:16:23,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 212 transitions, 2554 flow [2024-06-14 15:16:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:16:23,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:16:23,048 INFO L175 Difference]: Start difference. First operand has 223 places, 192 transitions, 1886 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:16:23,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 212 transitions, 2554 flow [2024-06-14 15:16:23,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 212 transitions, 2427 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:16:23,186 INFO L231 Difference]: Finished difference. Result has 226 places, 196 transitions, 2027 flow [2024-06-14 15:16:23,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2027, PETRI_PLACES=226, PETRI_TRANSITIONS=196} [2024-06-14 15:16:23,187 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 195 predicate places. [2024-06-14 15:16:23,187 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 196 transitions, 2027 flow [2024-06-14 15:16:23,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:23,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:23,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:23,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:16:23,187 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:23,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash 846029338, now seen corresponding path program 9 times [2024-06-14 15:16:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:23,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253779899] [2024-06-14 15:16:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:30,778 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-14 15:16:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:30,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253779899] [2024-06-14 15:16:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253779899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:30,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:30,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273819279] [2024-06-14 15:16:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:30,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:30,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:30,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:30,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 196 transitions, 2027 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:30,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:30,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:30,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:31,306 INFO L124 PetriNetUnfolderBase]: 483/856 cut-off events. [2024-06-14 15:16:31,307 INFO L125 PetriNetUnfolderBase]: For 82554/82554 co-relation queries the response was YES. [2024-06-14 15:16:31,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6342 conditions, 856 events. 483/856 cut-off events. For 82554/82554 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3992 event pairs, 64 based on Foata normal form. 2/856 useless extension candidates. Maximal degree in co-relation 6235. Up to 695 conditions per place. [2024-06-14 15:16:31,314 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 151 selfloop transitions, 59 changer transitions 0/212 dead transitions. [2024-06-14 15:16:31,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 212 transitions, 2677 flow [2024-06-14 15:16:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:16:31,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:16:31,317 INFO L175 Difference]: Start difference. First operand has 226 places, 196 transitions, 2027 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:16:31,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 212 transitions, 2677 flow [2024-06-14 15:16:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 212 transitions, 2493 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:16:31,511 INFO L231 Difference]: Finished difference. Result has 229 places, 198 transitions, 2019 flow [2024-06-14 15:16:31,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=229, PETRI_TRANSITIONS=198} [2024-06-14 15:16:31,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 15:16:31,512 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 198 transitions, 2019 flow [2024-06-14 15:16:31,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:31,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:31,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:31,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:16:31,513 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:31,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:31,515 INFO L85 PathProgramCache]: Analyzing trace with hash 846177208, now seen corresponding path program 10 times [2024-06-14 15:16:31,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:31,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768413531] [2024-06-14 15:16:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:38,933 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-14 15:16:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768413531] [2024-06-14 15:16:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768413531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233309330] [2024-06-14 15:16:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:38,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:38,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:38,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:39,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:39,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 198 transitions, 2019 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:39,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:39,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:39,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:39,439 INFO L124 PetriNetUnfolderBase]: 480/851 cut-off events. [2024-06-14 15:16:39,439 INFO L125 PetriNetUnfolderBase]: For 79144/79144 co-relation queries the response was YES. [2024-06-14 15:16:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6106 conditions, 851 events. 480/851 cut-off events. For 79144/79144 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3971 event pairs, 63 based on Foata normal form. 2/851 useless extension candidates. Maximal degree in co-relation 5998. Up to 735 conditions per place. [2024-06-14 15:16:39,447 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 158 selfloop transitions, 50 changer transitions 0/210 dead transitions. [2024-06-14 15:16:39,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 210 transitions, 2463 flow [2024-06-14 15:16:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:16:39,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:16:39,449 INFO L175 Difference]: Start difference. First operand has 229 places, 198 transitions, 2019 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:16:39,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 210 transitions, 2463 flow [2024-06-14 15:16:39,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 210 transitions, 2346 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 15:16:39,600 INFO L231 Difference]: Finished difference. Result has 233 places, 198 transitions, 2006 flow [2024-06-14 15:16:39,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2006, PETRI_PLACES=233, PETRI_TRANSITIONS=198} [2024-06-14 15:16:39,601 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 202 predicate places. [2024-06-14 15:16:39,601 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 198 transitions, 2006 flow [2024-06-14 15:16:39,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:39,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:39,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:39,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:16:39,602 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:39,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 846177363, now seen corresponding path program 7 times [2024-06-14 15:16:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426602997] [2024-06-14 15:16:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:46,492 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-14 15:16:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426602997] [2024-06-14 15:16:46,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426602997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:46,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:46,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912732301] [2024-06-14 15:16:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:46,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:46,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:46,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:46,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:46,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 198 transitions, 2006 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:46,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:46,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:46,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:47,058 INFO L124 PetriNetUnfolderBase]: 488/864 cut-off events. [2024-06-14 15:16:47,058 INFO L125 PetriNetUnfolderBase]: For 80947/80947 co-relation queries the response was YES. [2024-06-14 15:16:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6279 conditions, 864 events. 488/864 cut-off events. For 80947/80947 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4038 event pairs, 60 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 6169. Up to 584 conditions per place. [2024-06-14 15:16:47,066 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 136 selfloop transitions, 79 changer transitions 0/217 dead transitions. [2024-06-14 15:16:47,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 217 transitions, 2662 flow [2024-06-14 15:16:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:16:47,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 15:16:47,068 INFO L175 Difference]: Start difference. First operand has 233 places, 198 transitions, 2006 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:16:47,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 217 transitions, 2662 flow [2024-06-14 15:16:47,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 217 transitions, 2541 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:47,239 INFO L231 Difference]: Finished difference. Result has 235 places, 200 transitions, 2100 flow [2024-06-14 15:16:47,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2100, PETRI_PLACES=235, PETRI_TRANSITIONS=200} [2024-06-14 15:16:47,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2024-06-14 15:16:47,240 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 200 transitions, 2100 flow [2024-06-14 15:16:47,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:47,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:47,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:47,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:16:47,240 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:47,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1129921079, now seen corresponding path program 8 times [2024-06-14 15:16:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755529973] [2024-06-14 15:16:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:54,429 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-14 15:16:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755529973] [2024-06-14 15:16:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755529973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:16:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771070235] [2024-06-14 15:16:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:16:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:16:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:16:54,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:16:54,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 200 transitions, 2100 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:54,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:54,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:16:54,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:55,008 INFO L124 PetriNetUnfolderBase]: 497/879 cut-off events. [2024-06-14 15:16:55,008 INFO L125 PetriNetUnfolderBase]: For 89258/89258 co-relation queries the response was YES. [2024-06-14 15:16:55,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6529 conditions, 879 events. 497/879 cut-off events. For 89258/89258 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4112 event pairs, 70 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 6417. Up to 789 conditions per place. [2024-06-14 15:16:55,018 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 189 selfloop transitions, 28 changer transitions 0/219 dead transitions. [2024-06-14 15:16:55,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 219 transitions, 2625 flow [2024-06-14 15:16:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:16:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:16:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:16:55,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:16:55,019 INFO L175 Difference]: Start difference. First operand has 235 places, 200 transitions, 2100 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:16:55,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 219 transitions, 2625 flow [2024-06-14 15:16:55,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 219 transitions, 2424 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 15:16:55,210 INFO L231 Difference]: Finished difference. Result has 237 places, 203 transitions, 2016 flow [2024-06-14 15:16:55,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2016, PETRI_PLACES=237, PETRI_TRANSITIONS=203} [2024-06-14 15:16:55,211 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2024-06-14 15:16:55,211 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 203 transitions, 2016 flow [2024-06-14 15:16:55,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:16:55,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:55,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:55,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:16:55,212 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:55,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -737947331, now seen corresponding path program 9 times [2024-06-14 15:16:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988169963] [2024-06-14 15:16:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:01,040 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-14 15:17:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:01,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988169963] [2024-06-14 15:17:01,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988169963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:01,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:01,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605235581] [2024-06-14 15:17:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:01,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:01,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:01,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 203 transitions, 2016 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:01,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:01,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:01,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:01,588 INFO L124 PetriNetUnfolderBase]: 500/884 cut-off events. [2024-06-14 15:17:01,588 INFO L125 PetriNetUnfolderBase]: For 85142/85142 co-relation queries the response was YES. [2024-06-14 15:17:01,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 884 events. 500/884 cut-off events. For 85142/85142 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4180 event pairs, 64 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 6360. Up to 813 conditions per place. [2024-06-14 15:17:01,598 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 187 selfloop transitions, 30 changer transitions 0/219 dead transitions. [2024-06-14 15:17:01,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 219 transitions, 2537 flow [2024-06-14 15:17:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:17:01,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:17:01,600 INFO L175 Difference]: Start difference. First operand has 237 places, 203 transitions, 2016 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:17:01,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 219 transitions, 2537 flow [2024-06-14 15:17:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 219 transitions, 2442 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:17:01,776 INFO L231 Difference]: Finished difference. Result has 240 places, 208 transitions, 2052 flow [2024-06-14 15:17:01,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2052, PETRI_PLACES=240, PETRI_TRANSITIONS=208} [2024-06-14 15:17:01,777 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-14 15:17:01,777 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 208 transitions, 2052 flow [2024-06-14 15:17:01,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:01,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:01,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:01,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:17:01,778 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:01,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1997241336, now seen corresponding path program 1 times [2024-06-14 15:17:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:01,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006484641] [2024-06-14 15:17:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:07,642 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-14 15:17:07,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:07,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006484641] [2024-06-14 15:17:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006484641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:07,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641843233] [2024-06-14 15:17:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:07,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:07,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:07,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:07,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 208 transitions, 2052 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:07,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:07,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:07,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:08,220 INFO L124 PetriNetUnfolderBase]: 496/878 cut-off events. [2024-06-14 15:17:08,220 INFO L125 PetriNetUnfolderBase]: For 83932/83932 co-relation queries the response was YES. [2024-06-14 15:17:08,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6279 conditions, 878 events. 496/878 cut-off events. For 83932/83932 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4112 event pairs, 67 based on Foata normal form. 2/878 useless extension candidates. Maximal degree in co-relation 6164. Up to 836 conditions per place. [2024-06-14 15:17:08,228 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 203 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-06-14 15:17:08,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 222 transitions, 2552 flow [2024-06-14 15:17:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:17:08,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:17:08,229 INFO L175 Difference]: Start difference. First operand has 240 places, 208 transitions, 2052 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:17:08,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 222 transitions, 2552 flow [2024-06-14 15:17:08,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 222 transitions, 2461 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 15:17:08,403 INFO L231 Difference]: Finished difference. Result has 244 places, 210 transitions, 2038 flow [2024-06-14 15:17:08,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2038, PETRI_PLACES=244, PETRI_TRANSITIONS=210} [2024-06-14 15:17:08,403 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-14 15:17:08,403 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 210 transitions, 2038 flow [2024-06-14 15:17:08,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:08,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:08,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:17:08,404 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:08,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash -922857279, now seen corresponding path program 10 times [2024-06-14 15:17:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035392766] [2024-06-14 15:17:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:14,010 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-14 15:17:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:14,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035392766] [2024-06-14 15:17:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035392766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:14,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:14,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:14,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064949541] [2024-06-14 15:17:14,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:14,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:14,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:14,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 210 transitions, 2038 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:14,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:14,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:14,625 INFO L124 PetriNetUnfolderBase]: 499/883 cut-off events. [2024-06-14 15:17:14,626 INFO L125 PetriNetUnfolderBase]: For 82734/82734 co-relation queries the response was YES. [2024-06-14 15:17:14,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 883 events. 499/883 cut-off events. For 82734/82734 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4162 event pairs, 67 based on Foata normal form. 1/882 useless extension candidates. Maximal degree in co-relation 6197. Up to 854 conditions per place. [2024-06-14 15:17:14,634 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 205 selfloop transitions, 17 changer transitions 0/224 dead transitions. [2024-06-14 15:17:14,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 224 transitions, 2557 flow [2024-06-14 15:17:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:17:14,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 15:17:14,635 INFO L175 Difference]: Start difference. First operand has 244 places, 210 transitions, 2038 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:17:14,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 224 transitions, 2557 flow [2024-06-14 15:17:14,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 224 transitions, 2496 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:17:14,835 INFO L231 Difference]: Finished difference. Result has 247 places, 215 transitions, 2082 flow [2024-06-14 15:17:14,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2082, PETRI_PLACES=247, PETRI_TRANSITIONS=215} [2024-06-14 15:17:14,836 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-14 15:17:14,836 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 215 transitions, 2082 flow [2024-06-14 15:17:14,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:14,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:14,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:14,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:17:14,836 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:14,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -738154876, now seen corresponding path program 11 times [2024-06-14 15:17:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023426412] [2024-06-14 15:17:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:21,940 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-14 15:17:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023426412] [2024-06-14 15:17:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023426412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911846491] [2024-06-14 15:17:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:22,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:22,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 215 transitions, 2082 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:22,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:22,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:22,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:22,514 INFO L124 PetriNetUnfolderBase]: 503/891 cut-off events. [2024-06-14 15:17:22,514 INFO L125 PetriNetUnfolderBase]: For 88250/88250 co-relation queries the response was YES. [2024-06-14 15:17:22,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 891 events. 503/891 cut-off events. For 88250/88250 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4231 event pairs, 67 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 6288. Up to 844 conditions per place. [2024-06-14 15:17:22,523 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 201 selfloop transitions, 23 changer transitions 0/226 dead transitions. [2024-06-14 15:17:22,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 226 transitions, 2580 flow [2024-06-14 15:17:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 15:17:22,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:17:22,524 INFO L175 Difference]: Start difference. First operand has 247 places, 215 transitions, 2082 flow. Second operand 10 states and 110 transitions. [2024-06-14 15:17:22,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 226 transitions, 2580 flow [2024-06-14 15:17:22,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 226 transitions, 2531 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 15:17:22,708 INFO L231 Difference]: Finished difference. Result has 252 places, 216 transitions, 2113 flow [2024-06-14 15:17:22,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2113, PETRI_PLACES=252, PETRI_TRANSITIONS=216} [2024-06-14 15:17:22,709 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-14 15:17:22,709 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 216 transitions, 2113 flow [2024-06-14 15:17:22,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:22,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:22,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:22,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:17:22,710 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:22,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2031813633, now seen corresponding path program 11 times [2024-06-14 15:17:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:22,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934431044] [2024-06-14 15:17:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:28,710 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-14 15:17:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:28,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934431044] [2024-06-14 15:17:28,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934431044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:28,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:28,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:28,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064858128] [2024-06-14 15:17:28,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:28,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:28,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:28,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:28,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:28,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 216 transitions, 2113 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:28,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:28,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:29,321 INFO L124 PetriNetUnfolderBase]: 511/904 cut-off events. [2024-06-14 15:17:29,322 INFO L125 PetriNetUnfolderBase]: For 90591/90591 co-relation queries the response was YES. [2024-06-14 15:17:29,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 904 events. 511/904 cut-off events. For 90591/90591 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4292 event pairs, 65 based on Foata normal form. 1/903 useless extension candidates. Maximal degree in co-relation 6530. Up to 847 conditions per place. [2024-06-14 15:17:29,330 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 200 selfloop transitions, 31 changer transitions 0/233 dead transitions. [2024-06-14 15:17:29,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 233 transitions, 2861 flow [2024-06-14 15:17:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:17:29,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:17:29,331 INFO L175 Difference]: Start difference. First operand has 252 places, 216 transitions, 2113 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:17:29,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 233 transitions, 2861 flow [2024-06-14 15:17:29,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 233 transitions, 2791 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:17:29,532 INFO L231 Difference]: Finished difference. Result has 256 places, 223 transitions, 2239 flow [2024-06-14 15:17:29,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2239, PETRI_PLACES=256, PETRI_TRANSITIONS=223} [2024-06-14 15:17:29,533 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-14 15:17:29,533 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 223 transitions, 2239 flow [2024-06-14 15:17:29,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:29,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:29,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:29,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:17:29,533 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:29,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash 345433763, now seen corresponding path program 12 times [2024-06-14 15:17:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006247645] [2024-06-14 15:17:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:36,154 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-14 15:17:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006247645] [2024-06-14 15:17:36,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006247645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:36,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:36,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:36,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791932813] [2024-06-14 15:17:36,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:36,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:36,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:36,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:36,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:36,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 223 transitions, 2239 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:36,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:36,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:36,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:36,768 INFO L124 PetriNetUnfolderBase]: 529/933 cut-off events. [2024-06-14 15:17:36,768 INFO L125 PetriNetUnfolderBase]: For 103803/103803 co-relation queries the response was YES. [2024-06-14 15:17:36,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7240 conditions, 933 events. 529/933 cut-off events. For 103803/103803 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4461 event pairs, 59 based on Foata normal form. 1/932 useless extension candidates. Maximal degree in co-relation 7117. Up to 771 conditions per place. [2024-06-14 15:17:36,778 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 193 selfloop transitions, 48 changer transitions 0/243 dead transitions. [2024-06-14 15:17:36,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 243 transitions, 3035 flow [2024-06-14 15:17:36,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:17:36,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:17:36,779 INFO L175 Difference]: Start difference. First operand has 256 places, 223 transitions, 2239 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:17:36,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 243 transitions, 3035 flow [2024-06-14 15:17:36,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 243 transitions, 2958 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 15:17:36,977 INFO L231 Difference]: Finished difference. Result has 262 places, 228 transitions, 2395 flow [2024-06-14 15:17:36,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2395, PETRI_PLACES=262, PETRI_TRANSITIONS=228} [2024-06-14 15:17:36,978 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-14 15:17:36,978 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 228 transitions, 2395 flow [2024-06-14 15:17:36,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:36,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:36,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:36,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:17:36,978 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:36,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2031813478, now seen corresponding path program 12 times [2024-06-14 15:17:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:36,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16318270] [2024-06-14 15:17:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:36,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:43,753 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-14 15:17:43,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:43,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16318270] [2024-06-14 15:17:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16318270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:43,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159042177] [2024-06-14 15:17:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:43,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:43,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 228 transitions, 2395 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:43,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:43,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:43,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:44,401 INFO L124 PetriNetUnfolderBase]: 533/941 cut-off events. [2024-06-14 15:17:44,401 INFO L125 PetriNetUnfolderBase]: For 110177/110177 co-relation queries the response was YES. [2024-06-14 15:17:44,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 941 events. 533/941 cut-off events. For 110177/110177 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4518 event pairs, 68 based on Foata normal form. 2/941 useless extension candidates. Maximal degree in co-relation 7328. Up to 909 conditions per place. [2024-06-14 15:17:44,410 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 221 selfloop transitions, 16 changer transitions 0/239 dead transitions. [2024-06-14 15:17:44,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 239 transitions, 2921 flow [2024-06-14 15:17:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:17:44,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 15:17:44,411 INFO L175 Difference]: Start difference. First operand has 262 places, 228 transitions, 2395 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:17:44,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 239 transitions, 2921 flow [2024-06-14 15:17:44,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 239 transitions, 2806 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-14 15:17:44,634 INFO L231 Difference]: Finished difference. Result has 266 places, 229 transitions, 2348 flow [2024-06-14 15:17:44,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2348, PETRI_PLACES=266, PETRI_TRANSITIONS=229} [2024-06-14 15:17:44,634 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2024-06-14 15:17:44,634 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 229 transitions, 2348 flow [2024-06-14 15:17:44,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:44,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:44,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:44,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:17:44,635 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:44,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2031819213, now seen corresponding path program 13 times [2024-06-14 15:17:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273791216] [2024-06-14 15:17:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:50,512 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-14 15:17:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273791216] [2024-06-14 15:17:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273791216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:50,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866506742] [2024-06-14 15:17:50,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:50,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:50,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:50,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 229 transitions, 2348 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:50,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:50,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:50,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:51,060 INFO L124 PetriNetUnfolderBase]: 531/938 cut-off events. [2024-06-14 15:17:51,060 INFO L125 PetriNetUnfolderBase]: For 104808/104808 co-relation queries the response was YES. [2024-06-14 15:17:51,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 938 events. 531/938 cut-off events. For 104808/104808 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4501 event pairs, 68 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 7157. Up to 894 conditions per place. [2024-06-14 15:17:51,071 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 212 selfloop transitions, 25 changer transitions 0/239 dead transitions. [2024-06-14 15:17:51,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 239 transitions, 2850 flow [2024-06-14 15:17:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:17:51,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:17:51,073 INFO L175 Difference]: Start difference. First operand has 266 places, 229 transitions, 2348 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:17:51,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 239 transitions, 2850 flow [2024-06-14 15:17:51,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 239 transitions, 2776 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 15:17:51,324 INFO L231 Difference]: Finished difference. Result has 268 places, 230 transitions, 2337 flow [2024-06-14 15:17:51,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2337, PETRI_PLACES=268, PETRI_TRANSITIONS=230} [2024-06-14 15:17:51,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-14 15:17:51,324 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 230 transitions, 2337 flow [2024-06-14 15:17:51,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:51,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:51,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:51,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:17:51,325 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:51,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -738149141, now seen corresponding path program 14 times [2024-06-14 15:17:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804527928] [2024-06-14 15:17:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:57,943 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-14 15:17:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804527928] [2024-06-14 15:17:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804527928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137169463] [2024-06-14 15:17:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:57,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:58,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:17:58,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 230 transitions, 2337 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:58,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:58,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:17:58,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:58,490 INFO L124 PetriNetUnfolderBase]: 529/935 cut-off events. [2024-06-14 15:17:58,490 INFO L125 PetriNetUnfolderBase]: For 103175/103175 co-relation queries the response was YES. [2024-06-14 15:17:58,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7156 conditions, 935 events. 529/935 cut-off events. For 103175/103175 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4483 event pairs, 70 based on Foata normal form. 1/934 useless extension candidates. Maximal degree in co-relation 7027. Up to 864 conditions per place. [2024-06-14 15:17:58,533 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 205 selfloop transitions, 34 changer transitions 0/241 dead transitions. [2024-06-14 15:17:58,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 241 transitions, 2864 flow [2024-06-14 15:17:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:17:58,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:17:58,535 INFO L175 Difference]: Start difference. First operand has 268 places, 230 transitions, 2337 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:17:58,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 241 transitions, 2864 flow [2024-06-14 15:17:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 241 transitions, 2807 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:17:58,763 INFO L231 Difference]: Finished difference. Result has 271 places, 232 transitions, 2384 flow [2024-06-14 15:17:58,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2384, PETRI_PLACES=271, PETRI_TRANSITIONS=232} [2024-06-14 15:17:58,764 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-14 15:17:58,764 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 232 transitions, 2384 flow [2024-06-14 15:17:58,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:17:58,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:58,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:58,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:17:58,764 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:58,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 339923358, now seen corresponding path program 13 times [2024-06-14 15:17:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:58,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839900984] [2024-06-14 15:17:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:06,406 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-14 15:18:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839900984] [2024-06-14 15:18:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839900984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142278771] [2024-06-14 15:18:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:06,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:06,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:06,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 232 transitions, 2384 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:06,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:06,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:06,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:07,020 INFO L124 PetriNetUnfolderBase]: 533/943 cut-off events. [2024-06-14 15:18:07,020 INFO L125 PetriNetUnfolderBase]: For 109755/109755 co-relation queries the response was YES. [2024-06-14 15:18:07,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7282 conditions, 943 events. 533/943 cut-off events. For 109755/109755 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4547 event pairs, 66 based on Foata normal form. 2/943 useless extension candidates. Maximal degree in co-relation 7152. Up to 853 conditions per place. [2024-06-14 15:18:07,031 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 209 selfloop transitions, 34 changer transitions 0/245 dead transitions. [2024-06-14 15:18:07,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 245 transitions, 3100 flow [2024-06-14 15:18:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:18:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:18:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:18:07,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:18:07,033 INFO L175 Difference]: Start difference. First operand has 271 places, 232 transitions, 2384 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:18:07,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 245 transitions, 3100 flow [2024-06-14 15:18:07,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 245 transitions, 3019 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:18:07,274 INFO L231 Difference]: Finished difference. Result has 275 places, 233 transitions, 2407 flow [2024-06-14 15:18:07,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2407, PETRI_PLACES=275, PETRI_TRANSITIONS=233} [2024-06-14 15:18:07,275 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2024-06-14 15:18:07,275 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 233 transitions, 2407 flow [2024-06-14 15:18:07,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:07,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:07,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:07,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:18:07,275 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:07,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash -743517256, now seen corresponding path program 14 times [2024-06-14 15:18:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:07,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124394628] [2024-06-14 15:18:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:14,178 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-14 15:18:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124394628] [2024-06-14 15:18:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124394628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:14,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901231823] [2024-06-14 15:18:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:14,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:14,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:14,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 233 transitions, 2407 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:14,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:14,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:14,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:14,769 INFO L124 PetriNetUnfolderBase]: 537/951 cut-off events. [2024-06-14 15:18:14,770 INFO L125 PetriNetUnfolderBase]: For 112810/112810 co-relation queries the response was YES. [2024-06-14 15:18:14,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 951 events. 537/951 cut-off events. For 112810/112810 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4602 event pairs, 66 based on Foata normal form. 2/951 useless extension candidates. Maximal degree in co-relation 7255. Up to 904 conditions per place. [2024-06-14 15:18:14,779 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 218 selfloop transitions, 24 changer transitions 0/244 dead transitions. [2024-06-14 15:18:14,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 244 transitions, 2947 flow [2024-06-14 15:18:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:18:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:18:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:18:14,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:18:14,780 INFO L175 Difference]: Start difference. First operand has 275 places, 233 transitions, 2407 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:18:14,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 244 transitions, 2947 flow [2024-06-14 15:18:15,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 244 transitions, 2782 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-14 15:18:15,041 INFO L231 Difference]: Finished difference. Result has 276 places, 234 transitions, 2330 flow [2024-06-14 15:18:15,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2330, PETRI_PLACES=276, PETRI_TRANSITIONS=234} [2024-06-14 15:18:15,041 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:18:15,041 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 234 transitions, 2330 flow [2024-06-14 15:18:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:15,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:15,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:15,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:18:15,042 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:15,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash -743661406, now seen corresponding path program 15 times [2024-06-14 15:18:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:15,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806639864] [2024-06-14 15:18:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:22,357 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-14 15:18:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806639864] [2024-06-14 15:18:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806639864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007838735] [2024-06-14 15:18:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:22,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:22,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:22,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 234 transitions, 2330 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:22,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:22,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:22,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:22,992 INFO L124 PetriNetUnfolderBase]: 534/946 cut-off events. [2024-06-14 15:18:22,992 INFO L125 PetriNetUnfolderBase]: For 106428/106428 co-relation queries the response was YES. [2024-06-14 15:18:22,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 946 events. 534/946 cut-off events. For 106428/106428 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4589 event pairs, 65 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 6822. Up to 887 conditions per place. [2024-06-14 15:18:23,002 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 211 selfloop transitions, 31 changer transitions 0/244 dead transitions. [2024-06-14 15:18:23,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 244 transitions, 2836 flow [2024-06-14 15:18:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:18:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:18:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 15:18:23,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:18:23,003 INFO L175 Difference]: Start difference. First operand has 276 places, 234 transitions, 2330 flow. Second operand 10 states and 110 transitions. [2024-06-14 15:18:23,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 244 transitions, 2836 flow [2024-06-14 15:18:23,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 244 transitions, 2673 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-06-14 15:18:23,268 INFO L231 Difference]: Finished difference. Result has 275 places, 234 transitions, 2233 flow [2024-06-14 15:18:23,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2233, PETRI_PLACES=275, PETRI_TRANSITIONS=234} [2024-06-14 15:18:23,268 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2024-06-14 15:18:23,268 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 234 transitions, 2233 flow [2024-06-14 15:18:23,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:23,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:23,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:23,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:18:23,269 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:23,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1354601659, now seen corresponding path program 15 times [2024-06-14 15:18:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862135074] [2024-06-14 15:18:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:30,396 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-14 15:18:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:30,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862135074] [2024-06-14 15:18:30,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862135074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:30,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:30,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004456890] [2024-06-14 15:18:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:30,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:30,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:30,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 234 transitions, 2233 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:30,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:30,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:30,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:30,956 INFO L124 PetriNetUnfolderBase]: 543/961 cut-off events. [2024-06-14 15:18:30,957 INFO L125 PetriNetUnfolderBase]: For 112852/112852 co-relation queries the response was YES. [2024-06-14 15:18:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6899 conditions, 961 events. 543/961 cut-off events. For 112852/112852 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4676 event pairs, 61 based on Foata normal form. 3/962 useless extension candidates. Maximal degree in co-relation 6771. Up to 816 conditions per place. [2024-06-14 15:18:30,966 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 201 selfloop transitions, 48 changer transitions 0/251 dead transitions. [2024-06-14 15:18:30,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 251 transitions, 2838 flow [2024-06-14 15:18:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:18:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:18:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:18:30,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:18:30,967 INFO L175 Difference]: Start difference. First operand has 275 places, 234 transitions, 2233 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:18:30,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 251 transitions, 2838 flow [2024-06-14 15:18:31,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 251 transitions, 2704 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:18:31,200 INFO L231 Difference]: Finished difference. Result has 275 places, 237 transitions, 2280 flow [2024-06-14 15:18:31,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2280, PETRI_PLACES=275, PETRI_TRANSITIONS=237} [2024-06-14 15:18:31,201 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2024-06-14 15:18:31,201 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 237 transitions, 2280 flow [2024-06-14 15:18:31,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:31,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:31,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:31,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:18:31,201 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:31,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash -743517101, now seen corresponding path program 16 times [2024-06-14 15:18:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:31,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012125420] [2024-06-14 15:18:31,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:37,790 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-14 15:18:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012125420] [2024-06-14 15:18:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012125420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440318700] [2024-06-14 15:18:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:37,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:37,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 237 transitions, 2280 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:37,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:37,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:37,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:38,472 INFO L124 PetriNetUnfolderBase]: 546/966 cut-off events. [2024-06-14 15:18:38,472 INFO L125 PetriNetUnfolderBase]: For 107454/107454 co-relation queries the response was YES. [2024-06-14 15:18:38,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7014 conditions, 966 events. 546/966 cut-off events. For 107454/107454 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4703 event pairs, 61 based on Foata normal form. 1/965 useless extension candidates. Maximal degree in co-relation 6885. Up to 815 conditions per place. [2024-06-14 15:18:38,479 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 200 selfloop transitions, 51 changer transitions 0/253 dead transitions. [2024-06-14 15:18:38,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 253 transitions, 2869 flow [2024-06-14 15:18:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:18:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:18:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:18:38,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:18:38,480 INFO L175 Difference]: Start difference. First operand has 275 places, 237 transitions, 2280 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:18:38,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 253 transitions, 2869 flow [2024-06-14 15:18:38,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 253 transitions, 2712 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-14 15:18:38,722 INFO L231 Difference]: Finished difference. Result has 277 places, 239 transitions, 2286 flow [2024-06-14 15:18:38,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2286, PETRI_PLACES=277, PETRI_TRANSITIONS=239} [2024-06-14 15:18:38,722 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 246 predicate places. [2024-06-14 15:18:38,723 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 239 transitions, 2286 flow [2024-06-14 15:18:38,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:38,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:38,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:38,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:18:38,723 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:38,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -743661251, now seen corresponding path program 17 times [2024-06-14 15:18:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971812872] [2024-06-14 15:18:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:45,580 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-14 15:18:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971812872] [2024-06-14 15:18:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971812872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:45,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549183185] [2024-06-14 15:18:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:45,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:45,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:45,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 239 transitions, 2286 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:45,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:45,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:45,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:46,129 INFO L124 PetriNetUnfolderBase]: 544/963 cut-off events. [2024-06-14 15:18:46,129 INFO L125 PetriNetUnfolderBase]: For 104916/104916 co-relation queries the response was YES. [2024-06-14 15:18:46,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6831 conditions, 963 events. 544/963 cut-off events. For 104916/104916 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4668 event pairs, 69 based on Foata normal form. 1/962 useless extension candidates. Maximal degree in co-relation 6701. Up to 850 conditions per place. [2024-06-14 15:18:46,138 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 189 selfloop transitions, 61 changer transitions 0/252 dead transitions. [2024-06-14 15:18:46,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 252 transitions, 2875 flow [2024-06-14 15:18:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:18:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:18:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:18:46,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:18:46,139 INFO L175 Difference]: Start difference. First operand has 277 places, 239 transitions, 2286 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:18:46,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 252 transitions, 2875 flow [2024-06-14 15:18:46,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 252 transitions, 2726 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 15:18:46,372 INFO L231 Difference]: Finished difference. Result has 280 places, 243 transitions, 2372 flow [2024-06-14 15:18:46,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2139, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2372, PETRI_PLACES=280, PETRI_TRANSITIONS=243} [2024-06-14 15:18:46,373 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 15:18:46,373 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 243 transitions, 2372 flow [2024-06-14 15:18:46,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-14 15:18:46,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:46,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:18:46,373 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:46,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1196563825, now seen corresponding path program 1 times [2024-06-14 15:18:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379923727] [2024-06-14 15:18:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:54,196 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-14 15:18:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379923727] [2024-06-14 15:18:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379923727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895303042] [2024-06-14 15:18:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:54,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:54,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:18:54,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 243 transitions, 2372 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:18:54,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:54,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:18:54,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:54,986 INFO L124 PetriNetUnfolderBase]: 555/984 cut-off events. [2024-06-14 15:18:54,986 INFO L125 PetriNetUnfolderBase]: For 119778/119778 co-relation queries the response was YES. [2024-06-14 15:18:54,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7207 conditions, 984 events. 555/984 cut-off events. For 119778/119778 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4805 event pairs, 50 based on Foata normal form. 2/984 useless extension candidates. Maximal degree in co-relation 7075. Up to 774 conditions per place. [2024-06-14 15:18:54,996 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 234 selfloop transitions, 34 changer transitions 0/270 dead transitions. [2024-06-14 15:18:54,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 270 transitions, 3205 flow [2024-06-14 15:18:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:18:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:18:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:18:54,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:18:54,997 INFO L175 Difference]: Start difference. First operand has 280 places, 243 transitions, 2372 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:18:54,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 270 transitions, 3205 flow [2024-06-14 15:18:55,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 270 transitions, 3101 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-14 15:18:55,290 INFO L231 Difference]: Finished difference. Result has 289 places, 247 transitions, 2425 flow [2024-06-14 15:18:55,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2425, PETRI_PLACES=289, PETRI_TRANSITIONS=247} [2024-06-14 15:18:55,290 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 258 predicate places. [2024-06-14 15:18:55,291 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 247 transitions, 2425 flow [2024-06-14 15:18:55,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:18:55,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:55,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:55,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:18:55,291 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:55,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1254656275, now seen corresponding path program 2 times [2024-06-14 15:18:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:55,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387394388] [2024-06-14 15:18:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:03,291 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-14 15:19:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387394388] [2024-06-14 15:19:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387394388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309772004] [2024-06-14 15:19:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:03,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:03,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:03,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:03,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 247 transitions, 2425 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:03,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:03,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:03,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:04,116 INFO L124 PetriNetUnfolderBase]: 569/1010 cut-off events. [2024-06-14 15:19:04,116 INFO L125 PetriNetUnfolderBase]: For 131171/131171 co-relation queries the response was YES. [2024-06-14 15:19:04,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 1010 events. 569/1010 cut-off events. For 131171/131171 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 4984 event pairs, 69 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 7461. Up to 875 conditions per place. [2024-06-14 15:19:04,127 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 235 selfloop transitions, 36 changer transitions 0/273 dead transitions. [2024-06-14 15:19:04,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 273 transitions, 3271 flow [2024-06-14 15:19:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:19:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:19:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 15:19:04,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-14 15:19:04,129 INFO L175 Difference]: Start difference. First operand has 289 places, 247 transitions, 2425 flow. Second operand 12 states and 143 transitions. [2024-06-14 15:19:04,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 273 transitions, 3271 flow [2024-06-14 15:19:04,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 273 transitions, 3208 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 15:19:04,431 INFO L231 Difference]: Finished difference. Result has 295 places, 251 transitions, 2502 flow [2024-06-14 15:19:04,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2502, PETRI_PLACES=295, PETRI_TRANSITIONS=251} [2024-06-14 15:19:04,431 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 264 predicate places. [2024-06-14 15:19:04,431 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 251 transitions, 2502 flow [2024-06-14 15:19:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:04,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:04,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:04,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:19:04,432 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:04,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1254776431, now seen corresponding path program 1 times [2024-06-14 15:19:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:04,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370091540] [2024-06-14 15:19:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:13,120 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-14 15:19:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370091540] [2024-06-14 15:19:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370091540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513195787] [2024-06-14 15:19:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:13,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:13,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:13,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 251 transitions, 2502 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:13,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:13,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:14,026 INFO L124 PetriNetUnfolderBase]: 575/1020 cut-off events. [2024-06-14 15:19:14,026 INFO L125 PetriNetUnfolderBase]: For 135448/135448 co-relation queries the response was YES. [2024-06-14 15:19:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 1020 events. 575/1020 cut-off events. For 135448/135448 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5059 event pairs, 70 based on Foata normal form. 2/1020 useless extension candidates. Maximal degree in co-relation 7592. Up to 904 conditions per place. [2024-06-14 15:19:14,038 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 228 selfloop transitions, 47 changer transitions 0/277 dead transitions. [2024-06-14 15:19:14,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 277 transitions, 3176 flow [2024-06-14 15:19:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-14 15:19:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-14 15:19:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 164 transitions. [2024-06-14 15:19:14,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-14 15:19:14,039 INFO L175 Difference]: Start difference. First operand has 295 places, 251 transitions, 2502 flow. Second operand 15 states and 164 transitions. [2024-06-14 15:19:14,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 277 transitions, 3176 flow [2024-06-14 15:19:14,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 277 transitions, 3113 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:19:14,425 INFO L231 Difference]: Finished difference. Result has 303 places, 253 transitions, 2607 flow [2024-06-14 15:19:14,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2439, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2607, PETRI_PLACES=303, PETRI_TRANSITIONS=253} [2024-06-14 15:19:14,426 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-14 15:19:14,426 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 253 transitions, 2607 flow [2024-06-14 15:19:14,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:14,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:14,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:14,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:19:14,426 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:14,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1355888891, now seen corresponding path program 3 times [2024-06-14 15:19:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:14,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980071369] [2024-06-14 15:19:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:14,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:22,700 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-14 15:19:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980071369] [2024-06-14 15:19:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980071369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923162541] [2024-06-14 15:19:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:22,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:22,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:22,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 253 transitions, 2607 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:22,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:22,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:22,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:23,569 INFO L124 PetriNetUnfolderBase]: 579/1028 cut-off events. [2024-06-14 15:19:23,569 INFO L125 PetriNetUnfolderBase]: For 138129/138129 co-relation queries the response was YES. [2024-06-14 15:19:23,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7875 conditions, 1028 events. 579/1028 cut-off events. For 138129/138129 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5095 event pairs, 70 based on Foata normal form. 2/1028 useless extension candidates. Maximal degree in co-relation 7736. Up to 897 conditions per place. [2024-06-14 15:19:23,583 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 236 selfloop transitions, 39 changer transitions 0/277 dead transitions. [2024-06-14 15:19:23,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 277 transitions, 3425 flow [2024-06-14 15:19:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:19:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:19:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-14 15:19:23,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2024-06-14 15:19:23,584 INFO L175 Difference]: Start difference. First operand has 303 places, 253 transitions, 2607 flow. Second operand 12 states and 145 transitions. [2024-06-14 15:19:23,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 277 transitions, 3425 flow [2024-06-14 15:19:23,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 277 transitions, 3267 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-06-14 15:19:23,997 INFO L231 Difference]: Finished difference. Result has 302 places, 254 transitions, 2551 flow [2024-06-14 15:19:23,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2551, PETRI_PLACES=302, PETRI_TRANSITIONS=254} [2024-06-14 15:19:23,997 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 271 predicate places. [2024-06-14 15:19:23,997 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 254 transitions, 2551 flow [2024-06-14 15:19:23,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:23,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:23,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:23,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:19:23,998 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:23,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 82759655, now seen corresponding path program 4 times [2024-06-14 15:19:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702681982] [2024-06-14 15:19:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:31,656 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-14 15:19:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702681982] [2024-06-14 15:19:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702681982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121757073] [2024-06-14 15:19:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:31,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:31,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:31,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 254 transitions, 2551 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:31,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:31,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:31,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:32,368 INFO L124 PetriNetUnfolderBase]: 576/1023 cut-off events. [2024-06-14 15:19:32,368 INFO L125 PetriNetUnfolderBase]: For 131841/131841 co-relation queries the response was YES. [2024-06-14 15:19:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7578 conditions, 1023 events. 576/1023 cut-off events. For 131841/131841 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5092 event pairs, 73 based on Foata normal form. 2/1023 useless extension candidates. Maximal degree in co-relation 7438. Up to 923 conditions per place. [2024-06-14 15:19:32,380 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 236 selfloop transitions, 35 changer transitions 0/273 dead transitions. [2024-06-14 15:19:32,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 273 transitions, 3143 flow [2024-06-14 15:19:32,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:19:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:19:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2024-06-14 15:19:32,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:19:32,381 INFO L175 Difference]: Start difference. First operand has 302 places, 254 transitions, 2551 flow. Second operand 12 states and 138 transitions. [2024-06-14 15:19:32,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 273 transitions, 3143 flow [2024-06-14 15:19:32,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 273 transitions, 3054 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 15:19:32,798 INFO L231 Difference]: Finished difference. Result has 305 places, 254 transitions, 2536 flow [2024-06-14 15:19:32,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2536, PETRI_PLACES=305, PETRI_TRANSITIONS=254} [2024-06-14 15:19:32,799 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-14 15:19:32,799 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 254 transitions, 2536 flow [2024-06-14 15:19:32,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:32,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:32,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:32,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:19:32,800 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:32,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1331441899, now seen corresponding path program 5 times [2024-06-14 15:19:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045491756] [2024-06-14 15:19:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:40,826 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-14 15:19:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045491756] [2024-06-14 15:19:40,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045491756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:40,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:40,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:40,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71198163] [2024-06-14 15:19:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:40,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:40,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:41,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:41,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 254 transitions, 2536 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:41,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:41,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:41,631 INFO L124 PetriNetUnfolderBase]: 580/1031 cut-off events. [2024-06-14 15:19:41,631 INFO L125 PetriNetUnfolderBase]: For 134350/134350 co-relation queries the response was YES. [2024-06-14 15:19:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7613 conditions, 1031 events. 580/1031 cut-off events. For 134350/134350 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5136 event pairs, 69 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 7472. Up to 907 conditions per place. [2024-06-14 15:19:41,643 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 241 selfloop transitions, 30 changer transitions 0/273 dead transitions. [2024-06-14 15:19:41,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 273 transitions, 3334 flow [2024-06-14 15:19:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:19:41,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:19:41,645 INFO L175 Difference]: Start difference. First operand has 305 places, 254 transitions, 2536 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:19:41,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 273 transitions, 3334 flow [2024-06-14 15:19:42,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 273 transitions, 3261 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-14 15:19:42,112 INFO L231 Difference]: Finished difference. Result has 305 places, 255 transitions, 2547 flow [2024-06-14 15:19:42,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2463, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2547, PETRI_PLACES=305, PETRI_TRANSITIONS=255} [2024-06-14 15:19:42,112 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-14 15:19:42,113 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 255 transitions, 2547 flow [2024-06-14 15:19:42,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:42,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:42,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:42,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:19:42,113 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:42,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 462462819, now seen corresponding path program 6 times [2024-06-14 15:19:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467189573] [2024-06-14 15:19:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:50,181 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-14 15:19:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467189573] [2024-06-14 15:19:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467189573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451051943] [2024-06-14 15:19:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:50,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:50,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:50,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 255 transitions, 2547 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:50,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:50,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:50,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:50,893 INFO L124 PetriNetUnfolderBase]: 587/1044 cut-off events. [2024-06-14 15:19:50,893 INFO L125 PetriNetUnfolderBase]: For 137279/137279 co-relation queries the response was YES. [2024-06-14 15:19:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7725 conditions, 1044 events. 587/1044 cut-off events. For 137279/137279 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5239 event pairs, 75 based on Foata normal form. 2/1044 useless extension candidates. Maximal degree in co-relation 7583. Up to 982 conditions per place. [2024-06-14 15:19:50,905 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 243 selfloop transitions, 28 changer transitions 0/273 dead transitions. [2024-06-14 15:19:50,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 273 transitions, 3171 flow [2024-06-14 15:19:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:19:50,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:19:50,907 INFO L175 Difference]: Start difference. First operand has 305 places, 255 transitions, 2547 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:19:50,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 273 transitions, 3171 flow [2024-06-14 15:19:51,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 273 transitions, 3057 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-14 15:19:51,377 INFO L231 Difference]: Finished difference. Result has 307 places, 258 transitions, 2548 flow [2024-06-14 15:19:51,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2548, PETRI_PLACES=307, PETRI_TRANSITIONS=258} [2024-06-14 15:19:51,378 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 276 predicate places. [2024-06-14 15:19:51,378 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 258 transitions, 2548 flow [2024-06-14 15:19:51,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:51,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:51,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:51,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:19:51,379 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:51,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1222021621, now seen corresponding path program 7 times [2024-06-14 15:19:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370308703] [2024-06-14 15:19:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:59,491 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-14 15:19:59,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370308703] [2024-06-14 15:19:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370308703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:59,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649633817] [2024-06-14 15:19:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:59,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:59,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:59,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:59,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:59,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 258 transitions, 2548 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:19:59,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:59,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:59,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:00,421 INFO L124 PetriNetUnfolderBase]: 630/1129 cut-off events. [2024-06-14 15:20:00,421 INFO L125 PetriNetUnfolderBase]: For 198765/198765 co-relation queries the response was YES. [2024-06-14 15:20:00,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9310 conditions, 1129 events. 630/1129 cut-off events. For 198765/198765 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5733 event pairs, 87 based on Foata normal form. 2/1129 useless extension candidates. Maximal degree in co-relation 9167. Up to 957 conditions per place. [2024-06-14 15:20:00,435 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 248 selfloop transitions, 35 changer transitions 0/285 dead transitions. [2024-06-14 15:20:00,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 285 transitions, 3490 flow [2024-06-14 15:20:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 15:20:00,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 15:20:00,436 INFO L175 Difference]: Start difference. First operand has 307 places, 258 transitions, 2548 flow. Second operand 11 states and 133 transitions. [2024-06-14 15:20:00,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 285 transitions, 3490 flow [2024-06-14 15:20:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 285 transitions, 3425 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:20:01,075 INFO L231 Difference]: Finished difference. Result has 311 places, 262 transitions, 2636 flow [2024-06-14 15:20:01,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2483, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2636, PETRI_PLACES=311, PETRI_TRANSITIONS=262} [2024-06-14 15:20:01,076 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 280 predicate places. [2024-06-14 15:20:01,076 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 262 transitions, 2636 flow [2024-06-14 15:20:01,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:01,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:01,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:01,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:20:01,076 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:01,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -348276291, now seen corresponding path program 8 times [2024-06-14 15:20:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:01,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305163866] [2024-06-14 15:20:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:09,226 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-14 15:20:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305163866] [2024-06-14 15:20:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305163866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929136865] [2024-06-14 15:20:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:09,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:09,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:09,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 262 transitions, 2636 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:09,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:09,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:09,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:10,092 INFO L124 PetriNetUnfolderBase]: 627/1124 cut-off events. [2024-06-14 15:20:10,093 INFO L125 PetriNetUnfolderBase]: For 192773/192773 co-relation queries the response was YES. [2024-06-14 15:20:10,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9152 conditions, 1124 events. 627/1124 cut-off events. For 192773/192773 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5713 event pairs, 92 based on Foata normal form. 2/1124 useless extension candidates. Maximal degree in co-relation 9007. Up to 1040 conditions per place. [2024-06-14 15:20:10,106 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 244 selfloop transitions, 33 changer transitions 0/279 dead transitions. [2024-06-14 15:20:10,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 279 transitions, 3230 flow [2024-06-14 15:20:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:20:10,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 15:20:10,107 INFO L175 Difference]: Start difference. First operand has 311 places, 262 transitions, 2636 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:20:10,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 279 transitions, 3230 flow [2024-06-14 15:20:10,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 279 transitions, 3154 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:20:10,672 INFO L231 Difference]: Finished difference. Result has 315 places, 262 transitions, 2630 flow [2024-06-14 15:20:10,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2560, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2630, PETRI_PLACES=315, PETRI_TRANSITIONS=262} [2024-06-14 15:20:10,672 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 284 predicate places. [2024-06-14 15:20:10,672 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 262 transitions, 2630 flow [2024-06-14 15:20:10,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:10,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:10,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:10,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:20:10,673 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:10,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash -352749591, now seen corresponding path program 9 times [2024-06-14 15:20:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:10,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382519517] [2024-06-14 15:20:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:18,969 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-14 15:20:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382519517] [2024-06-14 15:20:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382519517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562104375] [2024-06-14 15:20:18,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:18,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:19,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:19,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 262 transitions, 2630 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:19,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:19,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:19,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:19,907 INFO L124 PetriNetUnfolderBase]: 653/1178 cut-off events. [2024-06-14 15:20:19,907 INFO L125 PetriNetUnfolderBase]: For 235610/235610 co-relation queries the response was YES. [2024-06-14 15:20:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10294 conditions, 1178 events. 653/1178 cut-off events. For 235610/235610 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6043 event pairs, 100 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 10147. Up to 927 conditions per place. [2024-06-14 15:20:19,922 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 243 selfloop transitions, 43 changer transitions 0/288 dead transitions. [2024-06-14 15:20:19,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 288 transitions, 3558 flow [2024-06-14 15:20:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 15:20:19,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-14 15:20:19,926 INFO L175 Difference]: Start difference. First operand has 315 places, 262 transitions, 2630 flow. Second operand 12 states and 143 transitions. [2024-06-14 15:20:19,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 288 transitions, 3558 flow [2024-06-14 15:20:20,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 288 transitions, 3465 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-14 15:20:20,737 INFO L231 Difference]: Finished difference. Result has 317 places, 263 transitions, 2651 flow [2024-06-14 15:20:20,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2651, PETRI_PLACES=317, PETRI_TRANSITIONS=263} [2024-06-14 15:20:20,738 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 286 predicate places. [2024-06-14 15:20:20,738 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 263 transitions, 2651 flow [2024-06-14 15:20:20,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:20,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:20,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:20,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:20:20,738 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:20,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash -352744941, now seen corresponding path program 10 times [2024-06-14 15:20:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716587034] [2024-06-14 15:20:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:28,808 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-14 15:20:28,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716587034] [2024-06-14 15:20:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716587034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:28,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:28,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:28,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227040884] [2024-06-14 15:20:28,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:28,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:28,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:28,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:28,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:28,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:28,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 263 transitions, 2651 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:28,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:28,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:28,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:29,645 INFO L124 PetriNetUnfolderBase]: 650/1173 cut-off events. [2024-06-14 15:20:29,645 INFO L125 PetriNetUnfolderBase]: For 229645/229645 co-relation queries the response was YES. [2024-06-14 15:20:29,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10096 conditions, 1173 events. 650/1173 cut-off events. For 229645/229645 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6043 event pairs, 107 based on Foata normal form. 2/1173 useless extension candidates. Maximal degree in co-relation 9949. Up to 1078 conditions per place. [2024-06-14 15:20:29,656 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 242 selfloop transitions, 36 changer transitions 0/280 dead transitions. [2024-06-14 15:20:29,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 280 transitions, 3247 flow [2024-06-14 15:20:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:20:29,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 15:20:29,657 INFO L175 Difference]: Start difference. First operand has 317 places, 263 transitions, 2651 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:20:29,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 280 transitions, 3247 flow [2024-06-14 15:20:30,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 280 transitions, 3159 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 15:20:30,361 INFO L231 Difference]: Finished difference. Result has 319 places, 263 transitions, 2639 flow [2024-06-14 15:20:30,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2563, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2639, PETRI_PLACES=319, PETRI_TRANSITIONS=263} [2024-06-14 15:20:30,361 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 288 predicate places. [2024-06-14 15:20:30,362 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 263 transitions, 2639 flow [2024-06-14 15:20:30,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:30,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:30,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:30,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:20:30,362 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:30,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1227084917, now seen corresponding path program 11 times [2024-06-14 15:20:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292864336] [2024-06-14 15:20:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:38,794 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-14 15:20:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292864336] [2024-06-14 15:20:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292864336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625079694] [2024-06-14 15:20:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:38,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:39,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:39,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 263 transitions, 2639 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:39,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:39,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:39,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:39,884 INFO L124 PetriNetUnfolderBase]: 697/1266 cut-off events. [2024-06-14 15:20:39,884 INFO L125 PetriNetUnfolderBase]: For 301563/301563 co-relation queries the response was YES. [2024-06-14 15:20:39,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12000 conditions, 1266 events. 697/1266 cut-off events. For 301563/301563 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6678 event pairs, 113 based on Foata normal form. 2/1266 useless extension candidates. Maximal degree in co-relation 11853. Up to 823 conditions per place. [2024-06-14 15:20:39,899 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 195 selfloop transitions, 97 changer transitions 0/294 dead transitions. [2024-06-14 15:20:39,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 294 transitions, 4021 flow [2024-06-14 15:20:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-14 15:20:39,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-14 15:20:39,901 INFO L175 Difference]: Start difference. First operand has 319 places, 263 transitions, 2639 flow. Second operand 12 states and 164 transitions. [2024-06-14 15:20:39,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 294 transitions, 4021 flow [2024-06-14 15:20:41,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 294 transitions, 3881 flow, removed 4 selfloop flow, removed 13 redundant places. [2024-06-14 15:20:41,028 INFO L231 Difference]: Finished difference. Result has 318 places, 265 transitions, 2748 flow [2024-06-14 15:20:41,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2499, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2748, PETRI_PLACES=318, PETRI_TRANSITIONS=265} [2024-06-14 15:20:41,029 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 287 predicate places. [2024-06-14 15:20:41,029 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 265 transitions, 2748 flow [2024-06-14 15:20:41,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:41,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:41,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:41,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:20:41,030 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:41,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1227080267, now seen corresponding path program 12 times [2024-06-14 15:20:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535323506] [2024-06-14 15:20:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:49,487 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-14 15:20:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535323506] [2024-06-14 15:20:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535323506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727007484] [2024-06-14 15:20:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:49,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:49,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:49,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:49,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 265 transitions, 2748 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:49,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:49,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:49,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:50,403 INFO L124 PetriNetUnfolderBase]: 656/1189 cut-off events. [2024-06-14 15:20:50,404 INFO L125 PetriNetUnfolderBase]: For 257127/257127 co-relation queries the response was YES. [2024-06-14 15:20:50,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9660 conditions, 1189 events. 656/1189 cut-off events. For 257127/257127 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6206 event pairs, 90 based on Foata normal form. 12/1199 useless extension candidates. Maximal degree in co-relation 9513. Up to 827 conditions per place. [2024-06-14 15:20:50,417 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 190 selfloop transitions, 100 changer transitions 0/292 dead transitions. [2024-06-14 15:20:50,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 292 transitions, 3668 flow [2024-06-14 15:20:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:20:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:20:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2024-06-14 15:20:50,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:20:50,418 INFO L175 Difference]: Start difference. First operand has 318 places, 265 transitions, 2748 flow. Second operand 13 states and 169 transitions. [2024-06-14 15:20:50,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 292 transitions, 3668 flow [2024-06-14 15:20:51,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 292 transitions, 3502 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:20:51,111 INFO L231 Difference]: Finished difference. Result has 324 places, 267 transitions, 2879 flow [2024-06-14 15:20:51,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2879, PETRI_PLACES=324, PETRI_TRANSITIONS=267} [2024-06-14 15:20:51,111 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 293 predicate places. [2024-06-14 15:20:51,111 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 267 transitions, 2879 flow [2024-06-14 15:20:51,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:51,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:51,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:51,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:20:51,112 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:51,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1222611431, now seen corresponding path program 2 times [2024-06-14 15:20:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086226378] [2024-06-14 15:20:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086226378] [2024-06-14 15:20:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086226378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:58,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:58,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627130004] [2024-06-14 15:20:58,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:58,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:58,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:58,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 267 transitions, 2879 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:20:58,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:58,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:58,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:59,189 INFO L124 PetriNetUnfolderBase]: 672/1215 cut-off events. [2024-06-14 15:20:59,189 INFO L125 PetriNetUnfolderBase]: For 224678/224678 co-relation queries the response was YES. [2024-06-14 15:20:59,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10419 conditions, 1215 events. 672/1215 cut-off events. For 224678/224678 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6346 event pairs, 82 based on Foata normal form. 2/1215 useless extension candidates. Maximal degree in co-relation 10269. Up to 901 conditions per place. [2024-06-14 15:20:59,203 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 203 selfloop transitions, 86 changer transitions 0/291 dead transitions. [2024-06-14 15:20:59,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 291 transitions, 3855 flow [2024-06-14 15:20:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:20:59,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-14 15:20:59,204 INFO L175 Difference]: Start difference. First operand has 324 places, 267 transitions, 2879 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:20:59,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 291 transitions, 3855 flow [2024-06-14 15:21:00,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 291 transitions, 3566 flow, removed 45 selfloop flow, removed 14 redundant places. [2024-06-14 15:21:00,026 INFO L231 Difference]: Finished difference. Result has 321 places, 271 transitions, 2921 flow [2024-06-14 15:21:00,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2596, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2921, PETRI_PLACES=321, PETRI_TRANSITIONS=271} [2024-06-14 15:21:00,027 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 290 predicate places. [2024-06-14 15:21:00,027 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 271 transitions, 2921 flow [2024-06-14 15:21:00,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:21:00,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:00,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:00,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:21:00,028 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:00,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1056377651, now seen corresponding path program 3 times [2024-06-14 15:21:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001613166] [2024-06-14 15:21:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:07,363 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-14 15:21:07,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:07,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001613166] [2024-06-14 15:21:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001613166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:07,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:07,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:21:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065667264] [2024-06-14 15:21:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:07,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:21:07,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:21:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:21:07,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:21:07,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 271 transitions, 2921 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:21:07,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:07,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:21:07,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:08,159 INFO L124 PetriNetUnfolderBase]: 688/1241 cut-off events. [2024-06-14 15:21:08,159 INFO L125 PetriNetUnfolderBase]: For 230004/230004 co-relation queries the response was YES. [2024-06-14 15:21:08,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10733 conditions, 1241 events. 688/1241 cut-off events. For 230004/230004 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6503 event pairs, 83 based on Foata normal form. 2/1241 useless extension candidates. Maximal degree in co-relation 10585. Up to 912 conditions per place. [2024-06-14 15:21:08,174 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 201 selfloop transitions, 91 changer transitions 0/294 dead transitions. [2024-06-14 15:21:08,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 294 transitions, 3905 flow [2024-06-14 15:21:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:21:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:21:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:21:08,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-14 15:21:08,175 INFO L175 Difference]: Start difference. First operand has 321 places, 271 transitions, 2921 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:21:08,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 294 transitions, 3905 flow [2024-06-14 15:21:08,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 294 transitions, 3710 flow, removed 49 selfloop flow, removed 7 redundant places. [2024-06-14 15:21:08,930 INFO L231 Difference]: Finished difference. Result has 325 places, 275 transitions, 3069 flow [2024-06-14 15:21:08,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3069, PETRI_PLACES=325, PETRI_TRANSITIONS=275} [2024-06-14 15:21:08,931 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 294 predicate places. [2024-06-14 15:21:08,931 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 275 transitions, 3069 flow [2024-06-14 15:21:08,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:21:08,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:08,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:08,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:21:08,931 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:08,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1056377837, now seen corresponding path program 13 times [2024-06-14 15:21:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468369868] [2024-06-14 15:21:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15