./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 76401ed0 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-76401ed-m [2024-06-20 19:01:40,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:01:40,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:01:40,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:01:40,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:01:40,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:01:40,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:01:40,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:01:40,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:01:40,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:01:40,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:01:40,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:01:40,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:01:40,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:01:40,666 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:01:40,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:01:40,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:01:40,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:01:40,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:01:40,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:01:40,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:01:40,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:01:40,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:01:40,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:01:40,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:01:40,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:01:40,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:01:40,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:01:40,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:01:40,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:01:40,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:01:40,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:01:40,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:01:40,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:01:40,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:01:40,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:01:40,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:01:40,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:01:40,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:01:40,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:01:40,674 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:01:40,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:01:40,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:01:40,674 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-20 19:01:40,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:01:40,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:01:40,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:01:40,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:01:40,980 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:01:40,981 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-20 19:01:42,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:01:42,258 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:01:42,259 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-20 19:01:42,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd8a533/fa909c81cef1460eaac1fa7df2bdf53e/FLAG6d2be40df [2024-06-20 19:01:42,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd8a533/fa909c81cef1460eaac1fa7df2bdf53e [2024-06-20 19:01:42,289 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:01:42,289 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:01:42,290 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-20 19:01:42,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:01:42,407 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:01:42,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:01:42,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:01:42,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:01:42,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:01:42" (1/2) ... [2024-06-20 19:01:42,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6224d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:01:42, skipping insertion in model container [2024-06-20 19:01:42,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:01:42" (1/2) ... [2024-06-20 19:01:42,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@63ef5a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:01:42, skipping insertion in model container [2024-06-20 19:01:42,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:01:42" (2/2) ... [2024-06-20 19:01:42,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6224d82d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:42, skipping insertion in model container [2024-06-20 19:01:42,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:01:42" (2/2) ... [2024-06-20 19:01:42,417 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:01:42,469 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:01:42,470 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-20 19:01:42,470 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-20 19:01:42,470 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:01:42,471 INFO L106 edCorrectnessWitness]: ghost_update [L818-L818] multithreaded = 1; [2024-06-20 19:01:42,497 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:01:42,818 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:01:42,830 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:01:43,093 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:01:43,122 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:01:43,123 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43 WrapperNode [2024-06-20 19:01:43,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:01:43,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:01:43,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:01:43,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:01:43,129 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 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,161 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 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,234 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 115 [2024-06-20 19:01:43,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:01:43,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:01:43,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:01:43,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:01:43,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,292 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-20 19:01:43,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:01:43,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:01:43,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:01:43,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:01:43,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (1/1) ... [2024-06-20 19:01:43,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:01:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:01:43,402 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-20 19:01:43,424 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-20 19:01:43,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:01:43,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:01:43,432 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:01:43,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:01:43,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:01:43,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:01:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:01:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:01:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:01:43,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:01:43,434 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:01:43,565 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:01:43,567 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:01:44,312 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:01:44,313 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:01:44,499 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:01:44,500 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:01:44,501 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:01:44 BoogieIcfgContainer [2024-06-20 19:01:44,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:01:44,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:01:44,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:01:44,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:01:44,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:01:42" (1/4) ... [2024-06-20 19:01:44,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5b613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:01:44, skipping insertion in model container [2024-06-20 19:01:44,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:01:42" (2/4) ... [2024-06-20 19:01:44,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5b613 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:01:44, skipping insertion in model container [2024-06-20 19:01:44,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:01:43" (3/4) ... [2024-06-20 19:01:44,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5b613 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:01:44, skipping insertion in model container [2024-06-20 19:01:44,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:01:44" (4/4) ... [2024-06-20 19:01:44,514 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-20 19:01:44,526 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:01:44,527 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:01:44,527 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:01:44,596 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:01:44,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:01:44,673 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-20 19:01:44,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:01:44,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 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/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:01:44,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:01:44,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-20 19:01:44,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:01:44,695 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;@4a8bbcd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:01:44,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:01:44,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:01:44,701 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:01:44,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:01:44,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:44,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:01:44,702 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-20 19:01:44,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash 332681745, now seen corresponding path program 1 times [2024-06-20 19:01:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313002186] [2024-06-20 19:01:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:48,795 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-20 19:01:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313002186] [2024-06-20 19:01:48,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313002186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:01:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366351900] [2024-06-20 19:01:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:48,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:01:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:01:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:01:48,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 19:01:48,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:48,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:48,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 19:01:48,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:49,065 INFO L124 PetriNetUnfolderBase]: 153/293 cut-off events. [2024-06-20 19:01:49,066 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-20 19:01:49,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 293 events. 153/293 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1091 event pairs, 89 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 575. Up to 272 conditions per place. [2024-06-20 19:01:49,070 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-20 19:01:49,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 115 flow [2024-06-20 19:01:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:01:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:01:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-06-20 19:01:49,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2024-06-20 19:01:49,081 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 56 transitions. [2024-06-20 19:01:49,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 115 flow [2024-06-20 19:01:49,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:01:49,084 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-20 19:01:49,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-20 19:01:49,088 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-20 19:01:49,088 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-20 19:01:49,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:49,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:49,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:49,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:01:49,089 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-20 19:01:49,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1879593136, now seen corresponding path program 1 times [2024-06-20 19:01:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:49,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773795687] [2024-06-20 19:01:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:52,341 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-20 19:01:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773795687] [2024-06-20 19:01:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773795687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:01:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184102411] [2024-06-20 19:01:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:52,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:01:52,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:52,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:01:52,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:01:52,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 19:01:52,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:52,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:52,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 19:01:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:52,598 INFO L124 PetriNetUnfolderBase]: 150/293 cut-off events. [2024-06-20 19:01:52,598 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-06-20 19:01:52,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 293 events. 150/293 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/291 useless extension candidates. Maximal degree in co-relation 649. Up to 258 conditions per place. [2024-06-20 19:01:52,603 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 25 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-20 19:01:52,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 157 flow [2024-06-20 19:01:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:01:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:01:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2024-06-20 19:01:52,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-20 19:01:52,607 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 72 transitions. [2024-06-20 19:01:52,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 157 flow [2024-06-20 19:01:52,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:01:52,611 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-20 19:01:52,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-20 19:01:52,612 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-20 19:01:52,612 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-20 19:01:52,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:52,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:52,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:52,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:01:52,614 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-20 19:01:52,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1892209841, now seen corresponding path program 1 times [2024-06-20 19:01:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:52,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218946814] [2024-06-20 19:01:52,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:56,339 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-20 19:01:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218946814] [2024-06-20 19:01:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218946814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:56,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:56,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:01:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88678046] [2024-06-20 19:01:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:01:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:01:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:01:56,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:01:56,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:56,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:56,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:01:56,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:56,694 INFO L124 PetriNetUnfolderBase]: 180/340 cut-off events. [2024-06-20 19:01:56,694 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-06-20 19:01:56,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 340 events. 180/340 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1248 event pairs, 52 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 838. Up to 291 conditions per place. [2024-06-20 19:01:56,696 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 34 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2024-06-20 19:01:56,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 238 flow [2024-06-20 19:01:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:01:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:01:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-20 19:01:56,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-20 19:01:56,698 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 6 states and 99 transitions. [2024-06-20 19:01:56,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 238 flow [2024-06-20 19:01:56,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 226 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 19:01:56,700 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 134 flow [2024-06-20 19:01:56,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-20 19:01:56,700 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-20 19:01:56,701 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 134 flow [2024-06-20 19:01:56,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:01:56,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:56,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:56,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:01:56,701 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-20 19:01:56,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1968028297, now seen corresponding path program 1 times [2024-06-20 19:01:56,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:56,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342381312] [2024-06-20 19:01:56,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:56,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:00,209 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-20 19:02:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342381312] [2024-06-20 19:02:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342381312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:00,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63470443] [2024-06-20 19:02:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:00,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:00,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:02:00,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:00,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:00,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:02:00,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:00,714 INFO L124 PetriNetUnfolderBase]: 176/330 cut-off events. [2024-06-20 19:02:00,715 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-06-20 19:02:00,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 330 events. 176/330 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1165 event pairs, 30 based on Foata normal form. 4/326 useless extension candidates. Maximal degree in co-relation 911. Up to 265 conditions per place. [2024-06-20 19:02:00,717 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 34 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2024-06-20 19:02:00,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 258 flow [2024-06-20 19:02:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-20 19:02:00,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023041474654378 [2024-06-20 19:02:00,719 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 134 flow. Second operand 7 states and 109 transitions. [2024-06-20 19:02:00,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 258 flow [2024-06-20 19:02:00,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 241 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 19:02:00,722 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 133 flow [2024-06-20 19:02:00,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-06-20 19:02:00,723 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-20 19:02:00,723 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 133 flow [2024-06-20 19:02:00,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:00,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:00,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:02:00,724 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-20 19:02:00,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1341926479, now seen corresponding path program 1 times [2024-06-20 19:02:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422889560] [2024-06-20 19:02:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:07,466 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-20 19:02:07,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:07,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422889560] [2024-06-20 19:02:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422889560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:02:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396286217] [2024-06-20 19:02:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:07,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:02:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:02:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:02:07,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:02:07,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:07,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:07,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:02:07,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:07,884 INFO L124 PetriNetUnfolderBase]: 174/327 cut-off events. [2024-06-20 19:02:07,885 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2024-06-20 19:02:07,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 327 events. 174/327 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1153 event pairs, 47 based on Foata normal form. 1/326 useless extension candidates. Maximal degree in co-relation 950. Up to 304 conditions per place. [2024-06-20 19:02:07,887 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 28 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-20 19:02:07,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 219 flow [2024-06-20 19:02:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:02:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:02:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-06-20 19:02:07,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-20 19:02:07,888 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 133 flow. Second operand 5 states and 64 transitions. [2024-06-20 19:02:07,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 219 flow [2024-06-20 19:02:07,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 195 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:02:07,890 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 136 flow [2024-06-20 19:02:07,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-20 19:02:07,891 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-20 19:02:07,891 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 136 flow [2024-06-20 19:02:07,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:07,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:07,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:07,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:02:07,892 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-20 19:02:07,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1349951301, now seen corresponding path program 1 times [2024-06-20 19:02:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:07,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075013643] [2024-06-20 19:02:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:15,464 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-20 19:02:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075013643] [2024-06-20 19:02:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075013643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:15,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:15,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009961321] [2024-06-20 19:02:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:15,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:15,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:02:15,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-20 19:02:15,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:15,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:02:15,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:15,868 INFO L124 PetriNetUnfolderBase]: 199/357 cut-off events. [2024-06-20 19:02:15,868 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2024-06-20 19:02:15,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 357 events. 199/357 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1219 event pairs, 55 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 1101. Up to 343 conditions per place. [2024-06-20 19:02:15,870 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-20 19:02:15,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 234 flow [2024-06-20 19:02:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:02:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:02:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-20 19:02:15,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:02:15,871 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 136 flow. Second operand 6 states and 69 transitions. [2024-06-20 19:02:15,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 234 flow [2024-06-20 19:02:15,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 223 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 19:02:15,873 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 158 flow [2024-06-20 19:02:15,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-20 19:02:15,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-20 19:02:15,874 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 158 flow [2024-06-20 19:02:15,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-20 19:02:15,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:15,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:15,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:02:15,875 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-20 19:02:15,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2114279576, now seen corresponding path program 1 times [2024-06-20 19:02:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990582385] [2024-06-20 19:02:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:21,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-20 19:02:21,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:21,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990582385] [2024-06-20 19:02:21,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990582385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:21,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:21,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:21,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617943727] [2024-06-20 19:02:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:21,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:21,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:21,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:02:21,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:21,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:21,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:02:21,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:21,484 INFO L124 PetriNetUnfolderBase]: 197/364 cut-off events. [2024-06-20 19:02:21,484 INFO L125 PetriNetUnfolderBase]: For 1014/1014 co-relation queries the response was YES. [2024-06-20 19:02:21,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 364 events. 197/364 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1280 event pairs, 54 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1197. Up to 323 conditions per place. [2024-06-20 19:02:21,486 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 32 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2024-06-20 19:02:21,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 315 flow [2024-06-20 19:02:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-20 19:02:21,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39631336405529954 [2024-06-20 19:02:21,488 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 158 flow. Second operand 7 states and 86 transitions. [2024-06-20 19:02:21,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 315 flow [2024-06-20 19:02:21,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 296 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:21,490 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 226 flow [2024-06-20 19:02:21,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-06-20 19:02:21,491 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-20 19:02:21,491 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 226 flow [2024-06-20 19:02:21,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:21,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:21,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:21,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:02:21,492 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-20 19:02:21,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1931450704, now seen corresponding path program 2 times [2024-06-20 19:02:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:21,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472403778] [2024-06-20 19:02:21,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:21,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:26,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-20 19:02:26,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:26,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472403778] [2024-06-20 19:02:26,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472403778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:26,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:26,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78750546] [2024-06-20 19:02:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:26,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:02:26,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:26,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:26,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:02:26,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:27,317 INFO L124 PetriNetUnfolderBase]: 195/361 cut-off events. [2024-06-20 19:02:27,332 INFO L125 PetriNetUnfolderBase]: For 1334/1334 co-relation queries the response was YES. [2024-06-20 19:02:27,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 361 events. 195/361 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1262 event pairs, 53 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1291. Up to 329 conditions per place. [2024-06-20 19:02:27,336 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 34 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2024-06-20 19:02:27,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 324 flow [2024-06-20 19:02:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:02:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:02:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2024-06-20 19:02:27,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:02:27,342 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 226 flow. Second operand 6 states and 74 transitions. [2024-06-20 19:02:27,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 324 flow [2024-06-20 19:02:27,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 316 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-20 19:02:27,344 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 241 flow [2024-06-20 19:02:27,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-20 19:02:27,347 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-20 19:02:27,347 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 241 flow [2024-06-20 19:02:27,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:27,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:27,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:27,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:02:27,348 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-20 19:02:27,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:27,349 INFO L85 PathProgramCache]: Analyzing trace with hash 435595250, now seen corresponding path program 3 times [2024-06-20 19:02:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829173520] [2024-06-20 19:02:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:33,860 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-20 19:02:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829173520] [2024-06-20 19:02:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829173520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:02:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445323699] [2024-06-20 19:02:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:33,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:02:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:33,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:02:33,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:02:33,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:02:33,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:33,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:33,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:02:33,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:34,265 INFO L124 PetriNetUnfolderBase]: 193/358 cut-off events. [2024-06-20 19:02:34,265 INFO L125 PetriNetUnfolderBase]: For 1678/1678 co-relation queries the response was YES. [2024-06-20 19:02:34,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 358 events. 193/358 cut-off events. For 1678/1678 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1252 event pairs, 53 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1326. Up to 309 conditions per place. [2024-06-20 19:02:34,267 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 34 selfloop transitions, 17 changer transitions 0/55 dead transitions. [2024-06-20 19:02:34,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 390 flow [2024-06-20 19:02:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-20 19:02:34,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-20 19:02:34,269 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 241 flow. Second operand 7 states and 90 transitions. [2024-06-20 19:02:34,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 390 flow [2024-06-20 19:02:34,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 373 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-20 19:02:34,271 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 302 flow [2024-06-20 19:02:34,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-06-20 19:02:34,272 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2024-06-20 19:02:34,272 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 302 flow [2024-06-20 19:02:34,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:34,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:34,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:34,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:02:34,273 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-20 19:02:34,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1931458640, now seen corresponding path program 1 times [2024-06-20 19:02:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859621770] [2024-06-20 19:02:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:42,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-20 19:02:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859621770] [2024-06-20 19:02:42,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859621770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:42,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:42,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:02:42,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622021234] [2024-06-20 19:02:42,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:42,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:02:42,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:42,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:02:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:02:42,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:02:42,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 302 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:42,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:42,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:02:42,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:42,637 INFO L124 PetriNetUnfolderBase]: 201/363 cut-off events. [2024-06-20 19:02:42,637 INFO L125 PetriNetUnfolderBase]: For 2030/2030 co-relation queries the response was YES. [2024-06-20 19:02:42,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 363 events. 201/363 cut-off events. For 2030/2030 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1217 event pairs, 52 based on Foata normal form. 3/364 useless extension candidates. Maximal degree in co-relation 1433. Up to 339 conditions per place. [2024-06-20 19:02:42,640 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2024-06-20 19:02:42,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 438 flow [2024-06-20 19:02:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-20 19:02:42,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686635944700461 [2024-06-20 19:02:42,642 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 302 flow. Second operand 7 states and 80 transitions. [2024-06-20 19:02:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 438 flow [2024-06-20 19:02:42,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 406 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-20 19:02:42,647 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 311 flow [2024-06-20 19:02:42,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2024-06-20 19:02:42,649 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-20 19:02:42,651 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 311 flow [2024-06-20 19:02:42,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:42,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:42,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:42,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:02:42,652 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-20 19:02:42,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1092172336, now seen corresponding path program 1 times [2024-06-20 19:02:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:42,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274209081] [2024-06-20 19:02:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:48,776 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-20 19:02:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274209081] [2024-06-20 19:02:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274209081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:02:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706756461] [2024-06-20 19:02:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:48,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:02:48,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:02:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:02:48,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:02:48,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-20 19:02:48,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:48,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:02:48,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:49,242 INFO L124 PetriNetUnfolderBase]: 190/354 cut-off events. [2024-06-20 19:02:49,243 INFO L125 PetriNetUnfolderBase]: For 2257/2257 co-relation queries the response was YES. [2024-06-20 19:02:49,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 354 events. 190/354 cut-off events. For 2257/2257 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1220 event pairs, 48 based on Foata normal form. 1/353 useless extension candidates. Maximal degree in co-relation 1448. Up to 302 conditions per place. [2024-06-20 19:02:49,245 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2024-06-20 19:02:49,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 469 flow [2024-06-20 19:02:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-20 19:02:49,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-20 19:02:49,246 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 311 flow. Second operand 7 states and 90 transitions. [2024-06-20 19:02:49,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 469 flow [2024-06-20 19:02:49,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 444 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:02:49,251 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 335 flow [2024-06-20 19:02:49,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2024-06-20 19:02:49,251 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-20 19:02:49,252 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 335 flow [2024-06-20 19:02:49,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-20 19:02:49,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:49,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:49,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:02:49,252 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-20 19:02:49,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1118156606, now seen corresponding path program 1 times [2024-06-20 19:02:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537581307] [2024-06-20 19:02:49,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:54,738 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-20 19:02:54,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:54,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537581307] [2024-06-20 19:02:54,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537581307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:54,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:54,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:02:54,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742920967] [2024-06-20 19:02:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:54,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:02:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:02:54,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:02:54,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:02:54,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 335 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:54,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:54,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:02:54,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:55,075 INFO L124 PetriNetUnfolderBase]: 207/373 cut-off events. [2024-06-20 19:02:55,075 INFO L125 PetriNetUnfolderBase]: For 2617/2617 co-relation queries the response was YES. [2024-06-20 19:02:55,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 373 events. 207/373 cut-off events. For 2617/2617 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1277 event pairs, 51 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1585. Up to 327 conditions per place. [2024-06-20 19:02:55,077 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 21 changer transitions 0/63 dead transitions. [2024-06-20 19:02:55,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 525 flow [2024-06-20 19:02:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-20 19:02:55,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39631336405529954 [2024-06-20 19:02:55,079 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 335 flow. Second operand 7 states and 86 transitions. [2024-06-20 19:02:55,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 525 flow [2024-06-20 19:02:55,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 492 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:02:55,083 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 378 flow [2024-06-20 19:02:55,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=378, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-06-20 19:02:55,084 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-20 19:02:55,084 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 378 flow [2024-06-20 19:02:55,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:55,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:55,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:55,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:02:55,085 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-20 19:02:55,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1118156792, now seen corresponding path program 2 times [2024-06-20 19:02:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577421401] [2024-06-20 19:02:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:00,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-20 19:03:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577421401] [2024-06-20 19:03:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577421401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:00,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:00,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:00,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77188761] [2024-06-20 19:03:00,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:00,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:00,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:00,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:00,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:00,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-20 19:03:00,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:00,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:00,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:01,168 INFO L124 PetriNetUnfolderBase]: 198/366 cut-off events. [2024-06-20 19:03:01,168 INFO L125 PetriNetUnfolderBase]: For 3183/3183 co-relation queries the response was YES. [2024-06-20 19:03:01,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 366 events. 198/366 cut-off events. For 3183/3183 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1272 event pairs, 48 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1632. Up to 291 conditions per place. [2024-06-20 19:03:01,172 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 21 changer transitions 0/68 dead transitions. [2024-06-20 19:03:01,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 586 flow [2024-06-20 19:03:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-20 19:03:01,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423963133640553 [2024-06-20 19:03:01,173 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 378 flow. Second operand 7 states and 92 transitions. [2024-06-20 19:03:01,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 586 flow [2024-06-20 19:03:01,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 562 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-20 19:03:01,178 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 438 flow [2024-06-20 19:03:01,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=438, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-06-20 19:03:01,178 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-20 19:03:01,178 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 438 flow [2024-06-20 19:03:01,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-20 19:03:01,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:01,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:03:01,179 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-20 19:03:01,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash -254569510, now seen corresponding path program 2 times [2024-06-20 19:03:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915945518] [2024-06-20 19:03:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:01,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:06,599 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-20 19:03:06,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915945518] [2024-06-20 19:03:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915945518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:06,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:06,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:06,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131013313] [2024-06-20 19:03:06,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:06,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:06,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:06,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:03:06,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 438 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:06,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:06,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:03:06,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:06,937 INFO L124 PetriNetUnfolderBase]: 213/383 cut-off events. [2024-06-20 19:03:06,937 INFO L125 PetriNetUnfolderBase]: For 3642/3642 co-relation queries the response was YES. [2024-06-20 19:03:06,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 383 events. 213/383 cut-off events. For 3642/3642 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1305 event pairs, 50 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1787. Up to 358 conditions per place. [2024-06-20 19:03:06,939 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 51 selfloop transitions, 14 changer transitions 0/67 dead transitions. [2024-06-20 19:03:06,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 626 flow [2024-06-20 19:03:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-20 19:03:06,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37327188940092165 [2024-06-20 19:03:06,941 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 438 flow. Second operand 7 states and 81 transitions. [2024-06-20 19:03:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 626 flow [2024-06-20 19:03:06,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 598 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-20 19:03:06,945 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 459 flow [2024-06-20 19:03:06,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=459, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-06-20 19:03:06,946 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-06-20 19:03:06,946 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 459 flow [2024-06-20 19:03:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:06,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:06,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:06,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:03:06,947 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-20 19:03:06,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash -310045196, now seen corresponding path program 3 times [2024-06-20 19:03:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211282430] [2024-06-20 19:03:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:12,326 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-20 19:03:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211282430] [2024-06-20 19:03:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211282430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059704415] [2024-06-20 19:03:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:12,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:12,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:12,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:12,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:03:12,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 459 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:12,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:12,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:03:12,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:12,681 INFO L124 PetriNetUnfolderBase]: 211/380 cut-off events. [2024-06-20 19:03:12,681 INFO L125 PetriNetUnfolderBase]: For 4013/4013 co-relation queries the response was YES. [2024-06-20 19:03:12,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 380 events. 211/380 cut-off events. For 4013/4013 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1300 event pairs, 50 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 1808. Up to 362 conditions per place. [2024-06-20 19:03:12,683 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 53 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-06-20 19:03:12,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 66 transitions, 601 flow [2024-06-20 19:03:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-20 19:03:12,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35944700460829493 [2024-06-20 19:03:12,685 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 459 flow. Second operand 7 states and 78 transitions. [2024-06-20 19:03:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 66 transitions, 601 flow [2024-06-20 19:03:12,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 66 transitions, 547 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:12,689 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 432 flow [2024-06-20 19:03:12,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-06-20 19:03:12,689 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-20 19:03:12,690 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 432 flow [2024-06-20 19:03:12,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:12,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:12,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:12,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:03:12,690 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-20 19:03:12,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash -395786080, now seen corresponding path program 3 times [2024-06-20 19:03:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:12,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468720203] [2024-06-20 19:03:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:18,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-20 19:03:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468720203] [2024-06-20 19:03:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468720203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:18,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:18,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911182597] [2024-06-20 19:03:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:18,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:18,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:18,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:18,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:18,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 432 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-20 19:03:18,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:18,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:18,478 INFO L124 PetriNetUnfolderBase]: 197/365 cut-off events. [2024-06-20 19:03:18,479 INFO L125 PetriNetUnfolderBase]: For 4415/4415 co-relation queries the response was YES. [2024-06-20 19:03:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 365 events. 197/365 cut-off events. For 4415/4415 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1276 event pairs, 48 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1731. Up to 327 conditions per place. [2024-06-20 19:03:18,481 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-06-20 19:03:18,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 66 transitions, 564 flow [2024-06-20 19:03:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-20 19:03:18,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:03:18,483 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 432 flow. Second operand 7 states and 84 transitions. [2024-06-20 19:03:18,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 66 transitions, 564 flow [2024-06-20 19:03:18,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 529 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:18,487 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 424 flow [2024-06-20 19:03:18,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=424, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-06-20 19:03:18,488 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-20 19:03:18,488 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 424 flow [2024-06-20 19:03:18,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-20 19:03:18,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:18,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:18,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:03:18,488 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-20 19:03:18,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 467834253, now seen corresponding path program 1 times [2024-06-20 19:03:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:18,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113516399] [2024-06-20 19:03:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:18,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:24,721 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-20 19:03:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113516399] [2024-06-20 19:03:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113516399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669139934] [2024-06-20 19:03:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:24,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:24,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 424 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:03:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:24,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:25,328 INFO L124 PetriNetUnfolderBase]: 205/378 cut-off events. [2024-06-20 19:03:25,328 INFO L125 PetriNetUnfolderBase]: For 5083/5083 co-relation queries the response was YES. [2024-06-20 19:03:25,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1866 conditions, 378 events. 205/378 cut-off events. For 5083/5083 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1322 event pairs, 46 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1829. Up to 307 conditions per place. [2024-06-20 19:03:25,331 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 54 selfloop transitions, 20 changer transitions 0/81 dead transitions. [2024-06-20 19:03:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 81 transitions, 686 flow [2024-06-20 19:03:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 19:03:25,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-20 19:03:25,334 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 424 flow. Second operand 9 states and 115 transitions. [2024-06-20 19:03:25,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 81 transitions, 686 flow [2024-06-20 19:03:25,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 653 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:25,339 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 472 flow [2024-06-20 19:03:25,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2024-06-20 19:03:25,340 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-20 19:03:25,340 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 472 flow [2024-06-20 19:03:25,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:03:25,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:25,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:03:25,341 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-20 19:03:25,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -306840444, now seen corresponding path program 1 times [2024-06-20 19:03:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030947247] [2024-06-20 19:03:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:30,829 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-20 19:03:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030947247] [2024-06-20 19:03:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030947247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:30,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863456721] [2024-06-20 19:03:30,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:30,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:30,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:30,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:30,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 472 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:03:30,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:30,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:30,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:31,237 INFO L124 PetriNetUnfolderBase]: 220/395 cut-off events. [2024-06-20 19:03:31,237 INFO L125 PetriNetUnfolderBase]: For 5660/5660 co-relation queries the response was YES. [2024-06-20 19:03:31,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 395 events. 220/395 cut-off events. For 5660/5660 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1365 event pairs, 47 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1989. Up to 357 conditions per place. [2024-06-20 19:03:31,240 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 60 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-20 19:03:31,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 78 transitions, 672 flow [2024-06-20 19:03:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 19:03:31,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-20 19:03:31,241 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 472 flow. Second operand 8 states and 101 transitions. [2024-06-20 19:03:31,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 78 transitions, 672 flow [2024-06-20 19:03:31,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 635 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:31,246 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 490 flow [2024-06-20 19:03:31,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2024-06-20 19:03:31,247 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-20 19:03:31,247 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 490 flow [2024-06-20 19:03:31,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:03:31,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:31,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:31,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:03:31,247 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-20 19:03:31,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash -306840599, now seen corresponding path program 2 times [2024-06-20 19:03:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:31,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366994414] [2024-06-20 19:03:31,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:31,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:37,599 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-20 19:03:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366994414] [2024-06-20 19:03:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366994414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:37,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157636398] [2024-06-20 19:03:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:37,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:03:37,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 490 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:03:37,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:37,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:03:37,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:38,169 INFO L124 PetriNetUnfolderBase]: 208/382 cut-off events. [2024-06-20 19:03:38,169 INFO L125 PetriNetUnfolderBase]: For 6233/6233 co-relation queries the response was YES. [2024-06-20 19:03:38,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 382 events. 208/382 cut-off events. For 6233/6233 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1335 event pairs, 45 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 1983. Up to 322 conditions per place. [2024-06-20 19:03:38,172 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 54 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-20 19:03:38,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 78 transitions, 664 flow [2024-06-20 19:03:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-20 19:03:38,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:03:38,174 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 490 flow. Second operand 8 states and 100 transitions. [2024-06-20 19:03:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 78 transitions, 664 flow [2024-06-20 19:03:38,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 78 transitions, 619 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:38,180 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 482 flow [2024-06-20 19:03:38,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=482, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2024-06-20 19:03:38,181 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-20 19:03:38,181 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 482 flow [2024-06-20 19:03:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:03:38,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:38,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:03:38,182 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-20 19:03:38,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash -303115577, now seen corresponding path program 1 times [2024-06-20 19:03:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633338531] [2024-06-20 19:03:38,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:43,028 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-20 19:03:43,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:43,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633338531] [2024-06-20 19:03:43,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633338531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:43,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:03:43,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389181553] [2024-06-20 19:03:43,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:43,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:03:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:43,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:03:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:03:43,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:03:43,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-20 19:03:43,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:43,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:03:43,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:43,370 INFO L124 PetriNetUnfolderBase]: 237/423 cut-off events. [2024-06-20 19:03:43,370 INFO L125 PetriNetUnfolderBase]: For 7612/7612 co-relation queries the response was YES. [2024-06-20 19:03:43,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 423 events. 237/423 cut-off events. For 7612/7612 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1504 event pairs, 52 based on Foata normal form. 3/424 useless extension candidates. Maximal degree in co-relation 2194. Up to 347 conditions per place. [2024-06-20 19:03:43,373 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 25 changer transitions 0/86 dead transitions. [2024-06-20 19:03:43,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 748 flow [2024-06-20 19:03:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-20 19:03:43,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976958525345622 [2024-06-20 19:03:43,375 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 482 flow. Second operand 7 states and 108 transitions. [2024-06-20 19:03:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 748 flow [2024-06-20 19:03:43,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 86 transitions, 711 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 19:03:43,386 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 545 flow [2024-06-20 19:03:43,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2024-06-20 19:03:43,387 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2024-06-20 19:03:43,387 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 545 flow [2024-06-20 19:03:43,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-20 19:03:43,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:43,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:03:43,388 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-20 19:03:43,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash 471649268, now seen corresponding path program 2 times [2024-06-20 19:03:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777808558] [2024-06-20 19:03:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:49,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-20 19:03:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777808558] [2024-06-20 19:03:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777808558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:49,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653435993] [2024-06-20 19:03:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:49,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:03:49,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 545 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:03:49,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:49,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:03:49,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:49,463 INFO L124 PetriNetUnfolderBase]: 245/436 cut-off events. [2024-06-20 19:03:49,463 INFO L125 PetriNetUnfolderBase]: For 8228/8228 co-relation queries the response was YES. [2024-06-20 19:03:49,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 436 events. 245/436 cut-off events. For 8228/8228 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1560 event pairs, 51 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 2402. Up to 349 conditions per place. [2024-06-20 19:03:49,468 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-20 19:03:49,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 887 flow [2024-06-20 19:03:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-20 19:03:49,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-20 19:03:49,469 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 545 flow. Second operand 8 states and 99 transitions. [2024-06-20 19:03:49,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 887 flow [2024-06-20 19:03:49,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 869 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-20 19:03:49,475 INFO L231 Difference]: Finished difference. Result has 92 places, 78 transitions, 650 flow [2024-06-20 19:03:49,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=92, PETRI_TRANSITIONS=78} [2024-06-20 19:03:49,476 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-20 19:03:49,476 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 650 flow [2024-06-20 19:03:49,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:03:49,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:49,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:49,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:03:49,477 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-20 19:03:49,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 471643688, now seen corresponding path program 3 times [2024-06-20 19:03:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47040872] [2024-06-20 19:03:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:54,968 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-20 19:03:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47040872] [2024-06-20 19:03:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47040872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:54,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:54,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290918031] [2024-06-20 19:03:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:54,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:54,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:55,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:03:55,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 650 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:03:55,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:55,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:03:55,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:55,387 INFO L124 PetriNetUnfolderBase]: 243/433 cut-off events. [2024-06-20 19:03:55,387 INFO L125 PetriNetUnfolderBase]: For 8934/8934 co-relation queries the response was YES. [2024-06-20 19:03:55,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 433 events. 243/433 cut-off events. For 8934/8934 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1549 event pairs, 50 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 2467. Up to 347 conditions per place. [2024-06-20 19:03:55,390 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-20 19:03:55,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 90 transitions, 900 flow [2024-06-20 19:03:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 19:03:55,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-20 19:03:55,391 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 650 flow. Second operand 9 states and 107 transitions. [2024-06-20 19:03:55,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 90 transitions, 900 flow [2024-06-20 19:03:55,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 90 transitions, 861 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-20 19:03:55,399 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 676 flow [2024-06-20 19:03:55,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=676, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-20 19:03:55,400 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-20 19:03:55,400 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 676 flow [2024-06-20 19:03:55,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:03:55,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:55,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:55,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:03:55,401 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-20 19:03:55,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -303121529, now seen corresponding path program 3 times [2024-06-20 19:03:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207905994] [2024-06-20 19:03:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:01,639 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-20 19:04:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207905994] [2024-06-20 19:04:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207905994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:01,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:01,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:01,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145280862] [2024-06-20 19:04:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:01,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:01,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:01,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:01,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 676 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:04:01,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:01,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:01,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:02,023 INFO L124 PetriNetUnfolderBase]: 235/427 cut-off events. [2024-06-20 19:04:02,024 INFO L125 PetriNetUnfolderBase]: For 9916/9916 co-relation queries the response was YES. [2024-06-20 19:04:02,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 427 events. 235/427 cut-off events. For 9916/9916 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1554 event pairs, 48 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 2515. Up to 343 conditions per place. [2024-06-20 19:04:02,027 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 56 selfloop transitions, 23 changer transitions 0/90 dead transitions. [2024-06-20 19:04:02,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 90 transitions, 882 flow [2024-06-20 19:04:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 19:04:02,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-20 19:04:02,029 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 676 flow. Second operand 8 states and 101 transitions. [2024-06-20 19:04:02,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 90 transitions, 882 flow [2024-06-20 19:04:02,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 90 transitions, 809 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:04:02,038 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 678 flow [2024-06-20 19:04:02,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=678, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-06-20 19:04:02,039 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-20 19:04:02,039 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 678 flow [2024-06-20 19:04:02,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:04:02,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:02,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:02,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:04:02,040 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-20 19:04:02,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -190498553, now seen corresponding path program 2 times [2024-06-20 19:04:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:02,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142622696] [2024-06-20 19:04:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:07,676 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-20 19:04:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142622696] [2024-06-20 19:04:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142622696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:07,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:04:07,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283386084] [2024-06-20 19:04:07,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:07,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:04:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:07,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:04:07,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:04:07,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:04:07,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 678 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-20 19:04:07,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:07,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:04:07,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:07,984 INFO L124 PetriNetUnfolderBase]: 255/453 cut-off events. [2024-06-20 19:04:07,984 INFO L125 PetriNetUnfolderBase]: For 11207/11207 co-relation queries the response was YES. [2024-06-20 19:04:07,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 453 events. 255/453 cut-off events. For 11207/11207 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1631 event pairs, 50 based on Foata normal form. 3/454 useless extension candidates. Maximal degree in co-relation 2669. Up to 401 conditions per place. [2024-06-20 19:04:07,988 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 74 selfloop transitions, 17 changer transitions 0/94 dead transitions. [2024-06-20 19:04:07,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 952 flow [2024-06-20 19:04:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:04:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:04:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2024-06-20 19:04:07,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2024-06-20 19:04:07,993 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 678 flow. Second operand 7 states and 103 transitions. [2024-06-20 19:04:07,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 952 flow [2024-06-20 19:04:08,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 893 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:08,004 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 674 flow [2024-06-20 19:04:08,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=674, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2024-06-20 19:04:08,005 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2024-06-20 19:04:08,005 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 674 flow [2024-06-20 19:04:08,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-20 19:04:08,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:08,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:08,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:04:08,005 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-20 19:04:08,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1675118399, now seen corresponding path program 3 times [2024-06-20 19:04:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618890861] [2024-06-20 19:04:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:13,467 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-20 19:04:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618890861] [2024-06-20 19:04:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618890861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866872717] [2024-06-20 19:04:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:13,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:13,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:13,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:04:13,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 674 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:13,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:13,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:04:13,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:13,900 INFO L124 PetriNetUnfolderBase]: 264/468 cut-off events. [2024-06-20 19:04:13,901 INFO L125 PetriNetUnfolderBase]: For 12191/12191 co-relation queries the response was YES. [2024-06-20 19:04:13,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 468 events. 264/468 cut-off events. For 12191/12191 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1697 event pairs, 50 based on Foata normal form. 3/469 useless extension candidates. Maximal degree in co-relation 2766. Up to 441 conditions per place. [2024-06-20 19:04:13,904 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 78 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2024-06-20 19:04:13,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 93 transitions, 898 flow [2024-06-20 19:04:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-20 19:04:13,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-20 19:04:13,906 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 674 flow. Second operand 8 states and 89 transitions. [2024-06-20 19:04:13,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 93 transitions, 898 flow [2024-06-20 19:04:13,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 93 transitions, 844 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:04:13,917 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 675 flow [2024-06-20 19:04:13,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2024-06-20 19:04:13,917 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-20 19:04:13,917 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 675 flow [2024-06-20 19:04:13,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:13,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:13,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:13,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:04:13,918 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-20 19:04:13,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -159225264, now seen corresponding path program 4 times [2024-06-20 19:04:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:13,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838991339] [2024-06-20 19:04:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:18,747 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-20 19:04:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838991339] [2024-06-20 19:04:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838991339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190280365] [2024-06-20 19:04:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:18,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:18,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:18,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:04:18,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 675 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:18,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:18,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:04:18,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:19,099 INFO L124 PetriNetUnfolderBase]: 272/481 cut-off events. [2024-06-20 19:04:19,099 INFO L125 PetriNetUnfolderBase]: For 12698/12698 co-relation queries the response was YES. [2024-06-20 19:04:19,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 481 events. 272/481 cut-off events. For 12698/12698 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1768 event pairs, 50 based on Foata normal form. 1/480 useless extension candidates. Maximal degree in co-relation 2871. Up to 443 conditions per place. [2024-06-20 19:04:19,103 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 75 selfloop transitions, 20 changer transitions 0/97 dead transitions. [2024-06-20 19:04:19,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 97 transitions, 1029 flow [2024-06-20 19:04:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-20 19:04:19,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:04:19,104 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 675 flow. Second operand 8 states and 93 transitions. [2024-06-20 19:04:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 97 transitions, 1029 flow [2024-06-20 19:04:19,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 97 transitions, 996 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:19,116 INFO L231 Difference]: Finished difference. Result has 104 places, 88 transitions, 731 flow [2024-06-20 19:04:19,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=104, PETRI_TRANSITIONS=88} [2024-06-20 19:04:19,116 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2024-06-20 19:04:19,117 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 731 flow [2024-06-20 19:04:19,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:19,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:19,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:19,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:04:19,117 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-20 19:04:19,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash 701842702, now seen corresponding path program 5 times [2024-06-20 19:04:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142074793] [2024-06-20 19:04:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:24,769 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-20 19:04:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142074793] [2024-06-20 19:04:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142074793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966515323] [2024-06-20 19:04:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:24,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:24,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:24,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:24,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:04:24,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 731 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:24,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:24,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:04:24,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:25,121 INFO L124 PetriNetUnfolderBase]: 270/478 cut-off events. [2024-06-20 19:04:25,121 INFO L125 PetriNetUnfolderBase]: For 13294/13294 co-relation queries the response was YES. [2024-06-20 19:04:25,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 478 events. 270/478 cut-off events. For 13294/13294 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1745 event pairs, 50 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2865. Up to 441 conditions per place. [2024-06-20 19:04:25,124 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 73 selfloop transitions, 21 changer transitions 0/96 dead transitions. [2024-06-20 19:04:25,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 96 transitions, 989 flow [2024-06-20 19:04:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-20 19:04:25,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-20 19:04:25,127 INFO L175 Difference]: Start difference. First operand has 104 places, 88 transitions, 731 flow. Second operand 8 states and 91 transitions. [2024-06-20 19:04:25,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 96 transitions, 989 flow [2024-06-20 19:04:25,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 96 transitions, 923 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:04:25,140 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 712 flow [2024-06-20 19:04:25,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=712, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2024-06-20 19:04:25,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-20 19:04:25,141 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 712 flow [2024-06-20 19:04:25,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:25,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:25,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:25,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:04:25,141 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-20 19:04:25,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1667753357, now seen corresponding path program 4 times [2024-06-20 19:04:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883098465] [2024-06-20 19:04:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:30,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-20 19:04:30,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:30,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883098465] [2024-06-20 19:04:30,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883098465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:30,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:30,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660817727] [2024-06-20 19:04:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:30,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:30,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:30,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:30,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 712 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:04:30,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:30,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:30,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:31,085 INFO L124 PetriNetUnfolderBase]: 256/463 cut-off events. [2024-06-20 19:04:31,085 INFO L125 PetriNetUnfolderBase]: For 13972/13972 co-relation queries the response was YES. [2024-06-20 19:04:31,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 463 events. 256/463 cut-off events. For 13972/13972 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1715 event pairs, 48 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 2779. Up to 412 conditions per place. [2024-06-20 19:04:31,088 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 71 selfloop transitions, 13 changer transitions 0/97 dead transitions. [2024-06-20 19:04:31,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 97 transitions, 920 flow [2024-06-20 19:04:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-20 19:04:31,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-20 19:04:31,091 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 712 flow. Second operand 8 states and 94 transitions. [2024-06-20 19:04:31,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 97 transitions, 920 flow [2024-06-20 19:04:31,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 97 transitions, 880 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:31,103 INFO L231 Difference]: Finished difference. Result has 109 places, 90 transitions, 731 flow [2024-06-20 19:04:31,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=109, PETRI_TRANSITIONS=90} [2024-06-20 19:04:31,103 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-20 19:04:31,104 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 90 transitions, 731 flow [2024-06-20 19:04:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:04:31,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:31,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:31,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:04:31,104 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-20 19:04:31,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1675110742, now seen corresponding path program 6 times [2024-06-20 19:04:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865556291] [2024-06-20 19:04:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:36,322 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-20 19:04:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865556291] [2024-06-20 19:04:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865556291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364693015] [2024-06-20 19:04:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:36,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:36,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:36,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:36,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:04:36,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 90 transitions, 731 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:36,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:36,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:04:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:36,800 INFO L124 PetriNetUnfolderBase]: 266/472 cut-off events. [2024-06-20 19:04:36,801 INFO L125 PetriNetUnfolderBase]: For 14425/14425 co-relation queries the response was YES. [2024-06-20 19:04:36,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 472 events. 266/472 cut-off events. For 14425/14425 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1723 event pairs, 50 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2841. Up to 451 conditions per place. [2024-06-20 19:04:36,806 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 82 selfloop transitions, 13 changer transitions 0/97 dead transitions. [2024-06-20 19:04:36,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 97 transitions, 937 flow [2024-06-20 19:04:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-20 19:04:36,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-20 19:04:36,807 INFO L175 Difference]: Start difference. First operand has 109 places, 90 transitions, 731 flow. Second operand 8 states and 87 transitions. [2024-06-20 19:04:36,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 97 transitions, 937 flow [2024-06-20 19:04:36,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 97 transitions, 884 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:36,822 INFO L231 Difference]: Finished difference. Result has 111 places, 90 transitions, 709 flow [2024-06-20 19:04:36,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=709, PETRI_PLACES=111, PETRI_TRANSITIONS=90} [2024-06-20 19:04:36,823 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-20 19:04:36,823 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 90 transitions, 709 flow [2024-06-20 19:04:36,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:36,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:36,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:04:36,824 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-20 19:04:36,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 709200149, now seen corresponding path program 4 times [2024-06-20 19:04:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683596376] [2024-06-20 19:04:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:42,497 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-20 19:04:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683596376] [2024-06-20 19:04:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683596376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798593095] [2024-06-20 19:04:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:42,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:42,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:04:42,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 90 transitions, 709 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:42,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:42,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:04:42,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:42,907 INFO L124 PetriNetUnfolderBase]: 260/463 cut-off events. [2024-06-20 19:04:42,907 INFO L125 PetriNetUnfolderBase]: For 14894/14894 co-relation queries the response was YES. [2024-06-20 19:04:42,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 463 events. 260/463 cut-off events. For 14894/14894 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1684 event pairs, 48 based on Foata normal form. 3/464 useless extension candidates. Maximal degree in co-relation 2727. Up to 424 conditions per place. [2024-06-20 19:04:42,911 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 83 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2024-06-20 19:04:42,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 935 flow [2024-06-20 19:04:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-20 19:04:42,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:04:42,912 INFO L175 Difference]: Start difference. First operand has 111 places, 90 transitions, 709 flow. Second operand 8 states and 93 transitions. [2024-06-20 19:04:42,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 935 flow [2024-06-20 19:04:42,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 101 transitions, 889 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:04:42,929 INFO L231 Difference]: Finished difference. Result has 111 places, 90 transitions, 700 flow [2024-06-20 19:04:42,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=700, PETRI_PLACES=111, PETRI_TRANSITIONS=90} [2024-06-20 19:04:42,930 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-20 19:04:42,930 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 90 transitions, 700 flow [2024-06-20 19:04:42,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-20 19:04:42,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:42,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:04:42,931 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-20 19:04:42,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1605691791, now seen corresponding path program 1 times [2024-06-20 19:04:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330639736] [2024-06-20 19:04:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:50,420 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-20 19:04:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330639736] [2024-06-20 19:04:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330639736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704081703] [2024-06-20 19:04:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:50,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:50,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:04:50,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 90 transitions, 700 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:50,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:50,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:04:50,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:51,049 INFO L124 PetriNetUnfolderBase]: 259/472 cut-off events. [2024-06-20 19:04:51,050 INFO L125 PetriNetUnfolderBase]: For 16726/16726 co-relation queries the response was YES. [2024-06-20 19:04:51,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2938 conditions, 472 events. 259/472 cut-off events. For 16726/16726 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1795 event pairs, 26 based on Foata normal form. 2/472 useless extension candidates. Maximal degree in co-relation 2883. Up to 356 conditions per place. [2024-06-20 19:04:51,053 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 77 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-06-20 19:04:51,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 1050 flow [2024-06-20 19:04:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:04:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:04:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:04:51,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 19:04:51,056 INFO L175 Difference]: Start difference. First operand has 111 places, 90 transitions, 700 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:04:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 1050 flow [2024-06-20 19:04:51,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 112 transitions, 1003 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:04:51,072 INFO L231 Difference]: Finished difference. Result has 114 places, 92 transitions, 739 flow [2024-06-20 19:04:51,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=739, PETRI_PLACES=114, PETRI_TRANSITIONS=92} [2024-06-20 19:04:51,073 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-20 19:04:51,073 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 92 transitions, 739 flow [2024-06-20 19:04:51,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:51,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:51,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:51,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:04:51,073 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-20 19:04:51,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1605688877, now seen corresponding path program 1 times [2024-06-20 19:04:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462523043] [2024-06-20 19:04:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:57,971 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-20 19:04:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462523043] [2024-06-20 19:04:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462523043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309865564] [2024-06-20 19:04:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:57,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:57,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:58,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:04:58,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 92 transitions, 739 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:58,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:58,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:04:58,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:58,555 INFO L124 PetriNetUnfolderBase]: 279/497 cut-off events. [2024-06-20 19:04:58,555 INFO L125 PetriNetUnfolderBase]: For 17636/17636 co-relation queries the response was YES. [2024-06-20 19:04:58,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 497 events. 279/497 cut-off events. For 17636/17636 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1873 event pairs, 45 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 3080. Up to 435 conditions per place. [2024-06-20 19:04:58,559 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 88 selfloop transitions, 24 changer transitions 0/114 dead transitions. [2024-06-20 19:04:58,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 1117 flow [2024-06-20 19:04:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:04:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:04:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:04:58,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-20 19:04:58,563 INFO L175 Difference]: Start difference. First operand has 114 places, 92 transitions, 739 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:04:58,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 1117 flow [2024-06-20 19:04:58,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 1067 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:58,586 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 786 flow [2024-06-20 19:04:58,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=786, PETRI_PLACES=118, PETRI_TRANSITIONS=96} [2024-06-20 19:04:58,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-20 19:04:58,587 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 786 flow [2024-06-20 19:04:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:58,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:58,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:58,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:04:58,588 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-20 19:04:58,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1617960641, now seen corresponding path program 2 times [2024-06-20 19:04:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406715666] [2024-06-20 19:04:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:06,052 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-20 19:05:06,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406715666] [2024-06-20 19:05:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406715666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:06,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71477104] [2024-06-20 19:05:06,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:06,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:06,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:06,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 96 transitions, 786 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:06,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:06,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:06,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:06,578 INFO L124 PetriNetUnfolderBase]: 273/495 cut-off events. [2024-06-20 19:05:06,579 INFO L125 PetriNetUnfolderBase]: For 19644/19644 co-relation queries the response was YES. [2024-06-20 19:05:06,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 495 events. 273/495 cut-off events. For 19644/19644 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1916 event pairs, 43 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 3114. Up to 405 conditions per place. [2024-06-20 19:05:06,582 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 79 selfloop transitions, 21 changer transitions 0/115 dead transitions. [2024-06-20 19:05:06,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 115 transitions, 1052 flow [2024-06-20 19:05:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 19:05:06,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:05:06,583 INFO L175 Difference]: Start difference. First operand has 118 places, 96 transitions, 786 flow. Second operand 10 states and 124 transitions. [2024-06-20 19:05:06,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 115 transitions, 1052 flow [2024-06-20 19:05:06,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 115 transitions, 1007 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:05:06,605 INFO L231 Difference]: Finished difference. Result has 122 places, 97 transitions, 803 flow [2024-06-20 19:05:06,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=803, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2024-06-20 19:05:06,605 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-20 19:05:06,606 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 803 flow [2024-06-20 19:05:06,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:06,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:06,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:06,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:05:06,606 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-20 19:05:06,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1620762111, now seen corresponding path program 1 times [2024-06-20 19:05:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315552464] [2024-06-20 19:05:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:12,043 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-20 19:05:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315552464] [2024-06-20 19:05:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315552464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491215693] [2024-06-20 19:05:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:12,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:12,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:12,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 803 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:12,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:12,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:12,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:12,525 INFO L124 PetriNetUnfolderBase]: 292/520 cut-off events. [2024-06-20 19:05:12,526 INFO L125 PetriNetUnfolderBase]: For 21260/21260 co-relation queries the response was YES. [2024-06-20 19:05:12,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 520 events. 292/520 cut-off events. For 21260/21260 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2001 event pairs, 48 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 3288. Up to 473 conditions per place. [2024-06-20 19:05:12,530 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 18 changer transitions 0/114 dead transitions. [2024-06-20 19:05:12,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 114 transitions, 1087 flow [2024-06-20 19:05:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:05:12,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:05:12,541 INFO L175 Difference]: Start difference. First operand has 122 places, 97 transitions, 803 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:05:12,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 114 transitions, 1087 flow [2024-06-20 19:05:12,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 1037 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:12,563 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 816 flow [2024-06-20 19:05:12,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=816, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2024-06-20 19:05:12,563 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2024-06-20 19:05:12,563 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 816 flow [2024-06-20 19:05:12,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:12,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:12,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:12,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:05:12,564 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-20 19:05:12,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1620757275, now seen corresponding path program 2 times [2024-06-20 19:05:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048222601] [2024-06-20 19:05:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:19,244 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-20 19:05:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048222601] [2024-06-20 19:05:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048222601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:19,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:19,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183835716] [2024-06-20 19:05:19,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:19,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:19,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 99 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:19,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:19,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:19,735 INFO L124 PetriNetUnfolderBase]: 295/525 cut-off events. [2024-06-20 19:05:19,735 INFO L125 PetriNetUnfolderBase]: For 21197/21197 co-relation queries the response was YES. [2024-06-20 19:05:19,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 525 events. 295/525 cut-off events. For 21197/21197 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2029 event pairs, 48 based on Foata normal form. 1/524 useless extension candidates. Maximal degree in co-relation 3361. Up to 477 conditions per place. [2024-06-20 19:05:19,739 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 92 selfloop transitions, 21 changer transitions 0/115 dead transitions. [2024-06-20 19:05:19,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 115 transitions, 1168 flow [2024-06-20 19:05:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-20 19:05:19,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:05:19,746 INFO L175 Difference]: Start difference. First operand has 123 places, 99 transitions, 816 flow. Second operand 9 states and 105 transitions. [2024-06-20 19:05:19,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 115 transitions, 1168 flow [2024-06-20 19:05:19,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 115 transitions, 1121 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:19,771 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 836 flow [2024-06-20 19:05:19,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=836, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2024-06-20 19:05:19,771 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2024-06-20 19:05:19,771 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 836 flow [2024-06-20 19:05:19,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:19,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:19,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:19,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:05:19,772 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-20 19:05:19,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1620757151, now seen corresponding path program 3 times [2024-06-20 19:05:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994779417] [2024-06-20 19:05:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:27,277 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-20 19:05:27,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:27,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994779417] [2024-06-20 19:05:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994779417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51203228] [2024-06-20 19:05:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:27,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:05:27,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 836 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:27,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:27,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:05:27,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:27,756 INFO L124 PetriNetUnfolderBase]: 282/510 cut-off events. [2024-06-20 19:05:27,756 INFO L125 PetriNetUnfolderBase]: For 21884/21884 co-relation queries the response was YES. [2024-06-20 19:05:27,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3283 conditions, 510 events. 282/510 cut-off events. For 21884/21884 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1994 event pairs, 45 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 3221. Up to 430 conditions per place. [2024-06-20 19:05:27,759 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 82 selfloop transitions, 17 changer transitions 0/115 dead transitions. [2024-06-20 19:05:27,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 115 transitions, 1072 flow [2024-06-20 19:05:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:05:27,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 19:05:27,761 INFO L175 Difference]: Start difference. First operand has 125 places, 101 transitions, 836 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:05:27,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 115 transitions, 1072 flow [2024-06-20 19:05:27,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 115 transitions, 1007 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:27,788 INFO L231 Difference]: Finished difference. Result has 127 places, 101 transitions, 809 flow [2024-06-20 19:05:27,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=809, PETRI_PLACES=127, PETRI_TRANSITIONS=101} [2024-06-20 19:05:27,788 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-20 19:05:27,788 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 101 transitions, 809 flow [2024-06-20 19:05:27,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:27,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:27,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:27,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:05:27,789 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-20 19:05:27,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -922118517, now seen corresponding path program 3 times [2024-06-20 19:05:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133450042] [2024-06-20 19:05:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:34,433 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-20 19:05:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133450042] [2024-06-20 19:05:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133450042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:34,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:34,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715427601] [2024-06-20 19:05:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:34,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:34,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 101 transitions, 809 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:34,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:34,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:34,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:34,881 INFO L124 PetriNetUnfolderBase]: 290/517 cut-off events. [2024-06-20 19:05:34,881 INFO L125 PetriNetUnfolderBase]: For 21525/21525 co-relation queries the response was YES. [2024-06-20 19:05:34,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3283 conditions, 517 events. 290/517 cut-off events. For 21525/21525 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1992 event pairs, 47 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 3220. Up to 476 conditions per place. [2024-06-20 19:05:34,884 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 18 changer transitions 0/114 dead transitions. [2024-06-20 19:05:34,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 114 transitions, 1069 flow [2024-06-20 19:05:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 19:05:34,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:05:34,886 INFO L175 Difference]: Start difference. First operand has 127 places, 101 transitions, 809 flow. Second operand 9 states and 102 transitions. [2024-06-20 19:05:34,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 114 transitions, 1069 flow [2024-06-20 19:05:34,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 114 transitions, 1019 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:34,914 INFO L231 Difference]: Finished difference. Result has 128 places, 101 transitions, 800 flow [2024-06-20 19:05:34,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=800, PETRI_PLACES=128, PETRI_TRANSITIONS=101} [2024-06-20 19:05:34,915 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2024-06-20 19:05:34,915 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 101 transitions, 800 flow [2024-06-20 19:05:34,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:34,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:34,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:05:34,916 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-20 19:05:34,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash -806647671, now seen corresponding path program 2 times [2024-06-20 19:05:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824317049] [2024-06-20 19:05:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:39,855 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-20 19:05:39,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:39,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824317049] [2024-06-20 19:05:39,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824317049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:39,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:39,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011141260] [2024-06-20 19:05:39,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:39,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:39,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:39,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 101 transitions, 800 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:39,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:39,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:39,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:40,269 INFO L124 PetriNetUnfolderBase]: 324/572 cut-off events. [2024-06-20 19:05:40,269 INFO L125 PetriNetUnfolderBase]: For 27827/27827 co-relation queries the response was YES. [2024-06-20 19:05:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 572 events. 324/572 cut-off events. For 27827/27827 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2279 event pairs, 57 based on Foata normal form. 3/573 useless extension candidates. Maximal degree in co-relation 3684. Up to 372 conditions per place. [2024-06-20 19:05:40,273 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 82 selfloop transitions, 42 changer transitions 0/126 dead transitions. [2024-06-20 19:05:40,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 1314 flow [2024-06-20 19:05:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:05:40,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:05:40,319 INFO L175 Difference]: Start difference. First operand has 128 places, 101 transitions, 800 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:05:40,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 1314 flow [2024-06-20 19:05:40,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 1273 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:40,365 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 918 flow [2024-06-20 19:05:40,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=918, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2024-06-20 19:05:40,365 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2024-06-20 19:05:40,365 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 918 flow [2024-06-20 19:05:40,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:40,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:40,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:40,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:05:40,366 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-20 19:05:40,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -806654367, now seen corresponding path program 4 times [2024-06-20 19:05:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824743823] [2024-06-20 19:05:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:46,484 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-20 19:05:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:46,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824743823] [2024-06-20 19:05:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824743823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:46,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023920353] [2024-06-20 19:05:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:46,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:46,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:46,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 918 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:46,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:46,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:46,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:46,936 INFO L124 PetriNetUnfolderBase]: 327/577 cut-off events. [2024-06-20 19:05:46,936 INFO L125 PetriNetUnfolderBase]: For 28098/28098 co-relation queries the response was YES. [2024-06-20 19:05:46,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 577 events. 327/577 cut-off events. For 28098/28098 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2293 event pairs, 60 based on Foata normal form. 1/576 useless extension candidates. Maximal degree in co-relation 3855. Up to 487 conditions per place. [2024-06-20 19:05:46,941 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 82 selfloop transitions, 36 changer transitions 0/120 dead transitions. [2024-06-20 19:05:46,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 120 transitions, 1208 flow [2024-06-20 19:05:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 19:05:46,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-20 19:05:46,943 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 918 flow. Second operand 9 states and 106 transitions. [2024-06-20 19:05:46,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 120 transitions, 1208 flow [2024-06-20 19:05:46,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 120 transitions, 1157 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 19:05:46,979 INFO L231 Difference]: Finished difference. Result has 134 places, 109 transitions, 972 flow [2024-06-20 19:05:46,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=972, PETRI_PLACES=134, PETRI_TRANSITIONS=109} [2024-06-20 19:05:46,980 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2024-06-20 19:05:46,980 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 109 transitions, 972 flow [2024-06-20 19:05:46,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:46,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:46,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:46,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:05:46,981 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-20 19:05:46,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash -806827347, now seen corresponding path program 5 times [2024-06-20 19:05:46,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913608297] [2024-06-20 19:05:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:53,426 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-20 19:05:53,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:53,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913608297] [2024-06-20 19:05:53,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913608297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:53,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395250754] [2024-06-20 19:05:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:53,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:53,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:53,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:53,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:53,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 109 transitions, 972 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:53,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:53,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:53,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:53,887 INFO L124 PetriNetUnfolderBase]: 330/582 cut-off events. [2024-06-20 19:05:53,887 INFO L125 PetriNetUnfolderBase]: For 29423/29423 co-relation queries the response was YES. [2024-06-20 19:05:53,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 582 events. 330/582 cut-off events. For 29423/29423 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2331 event pairs, 60 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 3954. Up to 492 conditions per place. [2024-06-20 19:05:53,891 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 85 selfloop transitions, 35 changer transitions 0/122 dead transitions. [2024-06-20 19:05:53,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 122 transitions, 1270 flow [2024-06-20 19:05:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 19:05:53,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-20 19:05:53,910 INFO L175 Difference]: Start difference. First operand has 134 places, 109 transitions, 972 flow. Second operand 9 states and 107 transitions. [2024-06-20 19:05:53,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 122 transitions, 1270 flow [2024-06-20 19:05:53,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 122 transitions, 1181 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:53,947 INFO L231 Difference]: Finished difference. Result has 136 places, 111 transitions, 990 flow [2024-06-20 19:05:53,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=990, PETRI_PLACES=136, PETRI_TRANSITIONS=111} [2024-06-20 19:05:53,948 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-20 19:05:53,948 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 111 transitions, 990 flow [2024-06-20 19:05:53,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:53,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:53,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:53,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:05:53,949 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-20 19:05:53,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1736226261, now seen corresponding path program 3 times [2024-06-20 19:05:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017210002] [2024-06-20 19:05:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:59,136 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-20 19:05:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017210002] [2024-06-20 19:05:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017210002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587414905] [2024-06-20 19:05:59,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:59,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:59,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:59,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:59,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:05:59,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 111 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:59,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:59,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:05:59,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:59,597 INFO L124 PetriNetUnfolderBase]: 339/597 cut-off events. [2024-06-20 19:05:59,598 INFO L125 PetriNetUnfolderBase]: For 32793/32793 co-relation queries the response was YES. [2024-06-20 19:05:59,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 597 events. 339/597 cut-off events. For 32793/32793 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2416 event pairs, 57 based on Foata normal form. 3/598 useless extension candidates. Maximal degree in co-relation 4071. Up to 390 conditions per place. [2024-06-20 19:05:59,603 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 90 selfloop transitions, 42 changer transitions 0/134 dead transitions. [2024-06-20 19:05:59,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 134 transitions, 1494 flow [2024-06-20 19:05:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:05:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:05:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-20 19:05:59,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-20 19:05:59,605 INFO L175 Difference]: Start difference. First operand has 136 places, 111 transitions, 990 flow. Second operand 9 states and 120 transitions. [2024-06-20 19:05:59,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 134 transitions, 1494 flow [2024-06-20 19:05:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 1403 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:59,638 INFO L231 Difference]: Finished difference. Result has 138 places, 113 transitions, 1010 flow [2024-06-20 19:05:59,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1010, PETRI_PLACES=138, PETRI_TRANSITIONS=113} [2024-06-20 19:05:59,639 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-20 19:05:59,639 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 113 transitions, 1010 flow [2024-06-20 19:05:59,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:59,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:59,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:59,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:05:59,639 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-20 19:05:59,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1736048445, now seen corresponding path program 6 times [2024-06-20 19:05:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:59,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987653325] [2024-06-20 19:05:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:07,191 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-20 19:06:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987653325] [2024-06-20 19:06:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987653325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312661269] [2024-06-20 19:06:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:07,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:07,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:07,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:07,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 113 transitions, 1010 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:07,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:07,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:07,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:07,656 INFO L124 PetriNetUnfolderBase]: 342/602 cut-off events. [2024-06-20 19:06:07,656 INFO L125 PetriNetUnfolderBase]: For 32704/32704 co-relation queries the response was YES. [2024-06-20 19:06:07,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 602 events. 342/602 cut-off events. For 32704/32704 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2437 event pairs, 60 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 4177. Up to 503 conditions per place. [2024-06-20 19:06:07,661 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 84 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2024-06-20 19:06:07,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 126 transitions, 1320 flow [2024-06-20 19:06:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-20 19:06:07,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:06:07,662 INFO L175 Difference]: Start difference. First operand has 138 places, 113 transitions, 1010 flow. Second operand 9 states and 108 transitions. [2024-06-20 19:06:07,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 126 transitions, 1320 flow [2024-06-20 19:06:07,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 126 transitions, 1238 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:06:07,702 INFO L231 Difference]: Finished difference. Result has 141 places, 115 transitions, 1049 flow [2024-06-20 19:06:07,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1049, PETRI_PLACES=141, PETRI_TRANSITIONS=115} [2024-06-20 19:06:07,703 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2024-06-20 19:06:07,703 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 115 transitions, 1049 flow [2024-06-20 19:06:07,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:07,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:07,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:07,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:06:07,704 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-20 19:06:07,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1736048321, now seen corresponding path program 4 times [2024-06-20 19:06:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680953302] [2024-06-20 19:06:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:14,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-20 19:06:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680953302] [2024-06-20 19:06:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680953302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212468626] [2024-06-20 19:06:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:15,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:15,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 115 transitions, 1049 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:15,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:15,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:15,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:15,414 INFO L124 PetriNetUnfolderBase]: 334/598 cut-off events. [2024-06-20 19:06:15,414 INFO L125 PetriNetUnfolderBase]: For 35411/35411 co-relation queries the response was YES. [2024-06-20 19:06:15,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4245 conditions, 598 events. 334/598 cut-off events. For 35411/35411 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2481 event pairs, 57 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 4175. Up to 493 conditions per place. [2024-06-20 19:06:15,418 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 85 selfloop transitions, 24 changer transitions 0/128 dead transitions. [2024-06-20 19:06:15,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 128 transitions, 1319 flow [2024-06-20 19:06:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:06:15,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 19:06:15,421 INFO L175 Difference]: Start difference. First operand has 141 places, 115 transitions, 1049 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:06:15,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 128 transitions, 1319 flow [2024-06-20 19:06:15,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 128 transitions, 1214 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:15,458 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 1018 flow [2024-06-20 19:06:15,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1018, PETRI_PLACES=143, PETRI_TRANSITIONS=116} [2024-06-20 19:06:15,458 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-20 19:06:15,459 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 1018 flow [2024-06-20 19:06:15,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:15,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:15,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:15,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:06:15,459 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-20 19:06:15,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1736053281, now seen corresponding path program 4 times [2024-06-20 19:06:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468787750] [2024-06-20 19:06:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:20,548 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-20 19:06:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468787750] [2024-06-20 19:06:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468787750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234529381] [2024-06-20 19:06:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:20,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:20,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:20,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 116 transitions, 1018 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:20,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:20,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:21,000 INFO L124 PetriNetUnfolderBase]: 340/601 cut-off events. [2024-06-20 19:06:21,001 INFO L125 PetriNetUnfolderBase]: For 34979/34979 co-relation queries the response was YES. [2024-06-20 19:06:21,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4134 conditions, 601 events. 340/601 cut-off events. For 34979/34979 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2455 event pairs, 55 based on Foata normal form. 3/602 useless extension candidates. Maximal degree in co-relation 4063. Up to 399 conditions per place. [2024-06-20 19:06:21,005 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 93 selfloop transitions, 41 changer transitions 0/136 dead transitions. [2024-06-20 19:06:21,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 136 transitions, 1428 flow [2024-06-20 19:06:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-20 19:06:21,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-20 19:06:21,006 INFO L175 Difference]: Start difference. First operand has 143 places, 116 transitions, 1018 flow. Second operand 9 states and 120 transitions. [2024-06-20 19:06:21,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 136 transitions, 1428 flow [2024-06-20 19:06:21,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 136 transitions, 1356 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:21,047 INFO L231 Difference]: Finished difference. Result has 145 places, 116 transitions, 1033 flow [2024-06-20 19:06:21,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1033, PETRI_PLACES=145, PETRI_TRANSITIONS=116} [2024-06-20 19:06:21,048 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-20 19:06:21,048 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 116 transitions, 1033 flow [2024-06-20 19:06:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:21,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:21,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:06:21,049 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-20 19:06:21,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 408038817, now seen corresponding path program 5 times [2024-06-20 19:06:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627058003] [2024-06-20 19:06:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:26,031 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-20 19:06:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:26,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627058003] [2024-06-20 19:06:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627058003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:26,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026469004] [2024-06-20 19:06:26,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:26,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:26,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 116 transitions, 1033 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:26,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:26,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:26,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:26,492 INFO L124 PetriNetUnfolderBase]: 349/616 cut-off events. [2024-06-20 19:06:26,492 INFO L125 PetriNetUnfolderBase]: For 36553/36553 co-relation queries the response was YES. [2024-06-20 19:06:26,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 616 events. 349/616 cut-off events. For 36553/36553 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2528 event pairs, 53 based on Foata normal form. 3/617 useless extension candidates. Maximal degree in co-relation 4200. Up to 576 conditions per place. [2024-06-20 19:06:26,497 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 112 selfloop transitions, 16 changer transitions 0/130 dead transitions. [2024-06-20 19:06:26,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 130 transitions, 1349 flow [2024-06-20 19:06:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:06:26,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:06:26,499 INFO L175 Difference]: Start difference. First operand has 145 places, 116 transitions, 1033 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:06:26,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 130 transitions, 1349 flow [2024-06-20 19:06:26,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 130 transitions, 1235 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 19:06:26,543 INFO L231 Difference]: Finished difference. Result has 146 places, 118 transitions, 990 flow [2024-06-20 19:06:26,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=990, PETRI_PLACES=146, PETRI_TRANSITIONS=118} [2024-06-20 19:06:26,544 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2024-06-20 19:06:26,544 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 118 transitions, 990 flow [2024-06-20 19:06:26,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:26,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:26,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:26,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:06:26,545 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-20 19:06:26,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 397403929, now seen corresponding path program 1 times [2024-06-20 19:06:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501051433] [2024-06-20 19:06:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:32,515 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-20 19:06:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501051433] [2024-06-20 19:06:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501051433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348193008] [2024-06-20 19:06:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:32,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:32,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:32,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 118 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:32,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:32,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:32,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:33,006 INFO L124 PetriNetUnfolderBase]: 345/610 cut-off events. [2024-06-20 19:06:33,007 INFO L125 PetriNetUnfolderBase]: For 34866/34866 co-relation queries the response was YES. [2024-06-20 19:06:33,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 610 events. 345/610 cut-off events. For 34866/34866 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2501 event pairs, 49 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 4033. Up to 578 conditions per place. [2024-06-20 19:06:33,011 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 15 changer transitions 0/130 dead transitions. [2024-06-20 19:06:33,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 130 transitions, 1288 flow [2024-06-20 19:06:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:06:33,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:06:33,012 INFO L175 Difference]: Start difference. First operand has 146 places, 118 transitions, 990 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:06:33,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 130 transitions, 1288 flow [2024-06-20 19:06:33,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 130 transitions, 1236 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:06:33,055 INFO L231 Difference]: Finished difference. Result has 146 places, 120 transitions, 997 flow [2024-06-20 19:06:33,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=997, PETRI_PLACES=146, PETRI_TRANSITIONS=120} [2024-06-20 19:06:33,056 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2024-06-20 19:06:33,056 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 120 transitions, 997 flow [2024-06-20 19:06:33,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:33,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:33,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:33,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:06:33,056 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-20 19:06:33,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 388826105, now seen corresponding path program 7 times [2024-06-20 19:06:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595125262] [2024-06-20 19:06:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:40,202 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-20 19:06:40,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:40,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595125262] [2024-06-20 19:06:40,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595125262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:40,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:40,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143449985] [2024-06-20 19:06:40,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:40,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:40,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:40,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 120 transitions, 997 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:40,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:40,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:40,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:40,632 INFO L124 PetriNetUnfolderBase]: 348/615 cut-off events. [2024-06-20 19:06:40,633 INFO L125 PetriNetUnfolderBase]: For 35049/35049 co-relation queries the response was YES. [2024-06-20 19:06:40,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4162 conditions, 615 events. 348/615 cut-off events. For 35049/35049 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2536 event pairs, 54 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 4089. Up to 591 conditions per place. [2024-06-20 19:06:40,637 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 15 changer transitions 0/130 dead transitions. [2024-06-20 19:06:40,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 130 transitions, 1307 flow [2024-06-20 19:06:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:06:40,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:06:40,640 INFO L175 Difference]: Start difference. First operand has 146 places, 120 transitions, 997 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:06:40,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 130 transitions, 1307 flow [2024-06-20 19:06:40,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 130 transitions, 1261 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:40,685 INFO L231 Difference]: Finished difference. Result has 148 places, 122 transitions, 1026 flow [2024-06-20 19:06:40,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1026, PETRI_PLACES=148, PETRI_TRANSITIONS=122} [2024-06-20 19:06:40,686 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-20 19:06:40,686 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 122 transitions, 1026 flow [2024-06-20 19:06:40,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:40,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:40,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:06:40,687 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-20 19:06:40,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 388826291, now seen corresponding path program 6 times [2024-06-20 19:06:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242615574] [2024-06-20 19:06:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:45,868 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-20 19:06:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242615574] [2024-06-20 19:06:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242615574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:45,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:45,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532174600] [2024-06-20 19:06:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:45,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:45,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:45,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 122 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:45,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:45,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:45,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:46,330 INFO L124 PetriNetUnfolderBase]: 372/654 cut-off events. [2024-06-20 19:06:46,330 INFO L125 PetriNetUnfolderBase]: For 42459/42459 co-relation queries the response was YES. [2024-06-20 19:06:46,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 654 events. 372/654 cut-off events. For 42459/42459 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2757 event pairs, 54 based on Foata normal form. 3/655 useless extension candidates. Maximal degree in co-relation 4492. Up to 572 conditions per place. [2024-06-20 19:06:46,335 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 116 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2024-06-20 19:06:46,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 141 transitions, 1496 flow [2024-06-20 19:06:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 19:06:46,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-20 19:06:46,336 INFO L175 Difference]: Start difference. First operand has 148 places, 122 transitions, 1026 flow. Second operand 9 states and 106 transitions. [2024-06-20 19:06:46,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 141 transitions, 1496 flow [2024-06-20 19:06:46,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 141 transitions, 1437 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:46,392 INFO L231 Difference]: Finished difference. Result has 150 places, 126 transitions, 1082 flow [2024-06-20 19:06:46,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1082, PETRI_PLACES=150, PETRI_TRANSITIONS=126} [2024-06-20 19:06:46,393 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 120 predicate places. [2024-06-20 19:06:46,393 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 126 transitions, 1082 flow [2024-06-20 19:06:46,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:46,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:46,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:46,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:06:46,393 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-20 19:06:46,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 388832801, now seen corresponding path program 7 times [2024-06-20 19:06:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372209035] [2024-06-20 19:06:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:52,102 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-20 19:06:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372209035] [2024-06-20 19:06:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372209035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:52,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347835908] [2024-06-20 19:06:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:52,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:52,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:06:52,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 126 transitions, 1082 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:52,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:52,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:06:52,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:52,602 INFO L124 PetriNetUnfolderBase]: 366/645 cut-off events. [2024-06-20 19:06:52,603 INFO L125 PetriNetUnfolderBase]: For 40766/40766 co-relation queries the response was YES. [2024-06-20 19:06:52,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 645 events. 366/645 cut-off events. For 40766/40766 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2709 event pairs, 58 based on Foata normal form. 3/646 useless extension candidates. Maximal degree in co-relation 4360. Up to 568 conditions per place. [2024-06-20 19:06:52,608 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 116 selfloop transitions, 22 changer transitions 0/140 dead transitions. [2024-06-20 19:06:52,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 140 transitions, 1394 flow [2024-06-20 19:06:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 19:06:52,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-20 19:06:52,610 INFO L175 Difference]: Start difference. First operand has 150 places, 126 transitions, 1082 flow. Second operand 9 states and 106 transitions. [2024-06-20 19:06:52,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 140 transitions, 1394 flow [2024-06-20 19:06:52,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 140 transitions, 1336 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-20 19:06:52,671 INFO L231 Difference]: Finished difference. Result has 154 places, 126 transitions, 1073 flow [2024-06-20 19:06:52,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1073, PETRI_PLACES=154, PETRI_TRANSITIONS=126} [2024-06-20 19:06:52,672 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-06-20 19:06:52,672 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 126 transitions, 1073 flow [2024-06-20 19:06:52,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:52,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:52,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:52,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:06:52,673 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-20 19:06:52,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash 160931651, now seen corresponding path program 8 times [2024-06-20 19:06:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347749333] [2024-06-20 19:06:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:58,075 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-20 19:06:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347749333] [2024-06-20 19:06:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347749333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988452576] [2024-06-20 19:06:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:58,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:58,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:06:58,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 126 transitions, 1073 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:58,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:58,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:06:58,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:58,484 INFO L124 PetriNetUnfolderBase]: 375/660 cut-off events. [2024-06-20 19:06:58,484 INFO L125 PetriNetUnfolderBase]: For 42439/42439 co-relation queries the response was YES. [2024-06-20 19:06:58,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 660 events. 375/660 cut-off events. For 42439/42439 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2786 event pairs, 58 based on Foata normal form. 3/661 useless extension candidates. Maximal degree in co-relation 4460. Up to 530 conditions per place. [2024-06-20 19:06:58,489 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 32 changer transitions 0/143 dead transitions. [2024-06-20 19:06:58,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 143 transitions, 1525 flow [2024-06-20 19:06:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 19:06:58,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-20 19:06:58,490 INFO L175 Difference]: Start difference. First operand has 154 places, 126 transitions, 1073 flow. Second operand 9 states and 119 transitions. [2024-06-20 19:06:58,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 143 transitions, 1525 flow [2024-06-20 19:06:58,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 143 transitions, 1469 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:58,550 INFO L231 Difference]: Finished difference. Result has 155 places, 128 transitions, 1120 flow [2024-06-20 19:06:58,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1120, PETRI_PLACES=155, PETRI_TRANSITIONS=128} [2024-06-20 19:06:58,551 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-20 19:06:58,551 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 128 transitions, 1120 flow [2024-06-20 19:06:58,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:58,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:58,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:58,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:06:58,552 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-20 19:06:58,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash 160924955, now seen corresponding path program 8 times [2024-06-20 19:06:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:58,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795874943] [2024-06-20 19:06:58,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:05,336 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-20 19:07:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795874943] [2024-06-20 19:07:05,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795874943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:05,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:05,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:05,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792699057] [2024-06-20 19:07:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:05,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:05,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:05,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:05,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:07:05,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 128 transitions, 1120 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:05,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:05,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:07:05,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:05,747 INFO L124 PetriNetUnfolderBase]: 378/665 cut-off events. [2024-06-20 19:07:05,748 INFO L125 PetriNetUnfolderBase]: For 41815/41815 co-relation queries the response was YES. [2024-06-20 19:07:05,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4633 conditions, 665 events. 378/665 cut-off events. For 41815/41815 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2812 event pairs, 62 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 4555. Up to 626 conditions per place. [2024-06-20 19:07:05,753 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 22 changer transitions 0/138 dead transitions. [2024-06-20 19:07:05,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 138 transitions, 1450 flow [2024-06-20 19:07:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-20 19:07:05,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-20 19:07:05,760 INFO L175 Difference]: Start difference. First operand has 155 places, 128 transitions, 1120 flow. Second operand 9 states and 100 transitions. [2024-06-20 19:07:05,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 138 transitions, 1450 flow [2024-06-20 19:07:05,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 138 transitions, 1322 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-20 19:07:05,829 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 1085 flow [2024-06-20 19:07:05,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1085, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-20 19:07:05,829 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-20 19:07:05,830 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 1085 flow [2024-06-20 19:07:05,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:05,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:05,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:05,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:07:05,830 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-20 19:07:05,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1901865395, now seen corresponding path program 9 times [2024-06-20 19:07:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140178153] [2024-06-20 19:07:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:11,348 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-20 19:07:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140178153] [2024-06-20 19:07:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140178153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932616261] [2024-06-20 19:07:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:11,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:11,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:11,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 1085 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:11,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:11,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:11,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:11,790 INFO L124 PetriNetUnfolderBase]: 387/680 cut-off events. [2024-06-20 19:07:11,790 INFO L125 PetriNetUnfolderBase]: For 45710/45710 co-relation queries the response was YES. [2024-06-20 19:07:11,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4599 conditions, 680 events. 387/680 cut-off events. For 45710/45710 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2898 event pairs, 58 based on Foata normal form. 3/681 useless extension candidates. Maximal degree in co-relation 4521. Up to 543 conditions per place. [2024-06-20 19:07:11,796 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 114 selfloop transitions, 33 changer transitions 0/149 dead transitions. [2024-06-20 19:07:11,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 149 transitions, 1551 flow [2024-06-20 19:07:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-20 19:07:11,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43727598566308246 [2024-06-20 19:07:11,799 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 1085 flow. Second operand 9 states and 122 transitions. [2024-06-20 19:07:11,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 149 transitions, 1551 flow [2024-06-20 19:07:11,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 149 transitions, 1474 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 19:07:11,859 INFO L231 Difference]: Finished difference. Result has 158 places, 132 transitions, 1105 flow [2024-06-20 19:07:11,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1105, PETRI_PLACES=158, PETRI_TRANSITIONS=132} [2024-06-20 19:07:11,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-06-20 19:07:11,859 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 132 transitions, 1105 flow [2024-06-20 19:07:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:11,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:11,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:07:11,860 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-20 19:07:11,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 160747325, now seen corresponding path program 9 times [2024-06-20 19:07:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351665610] [2024-06-20 19:07:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:18,489 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-20 19:07:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351665610] [2024-06-20 19:07:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351665610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704177410] [2024-06-20 19:07:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:18,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:18,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:07:18,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 132 transitions, 1105 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:18,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:18,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:07:18,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:18,915 INFO L124 PetriNetUnfolderBase]: 390/685 cut-off events. [2024-06-20 19:07:18,915 INFO L125 PetriNetUnfolderBase]: For 44858/44858 co-relation queries the response was YES. [2024-06-20 19:07:18,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 685 events. 390/685 cut-off events. For 44858/44858 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2923 event pairs, 62 based on Foata normal form. 1/684 useless extension candidates. Maximal degree in co-relation 4630. Up to 633 conditions per place. [2024-06-20 19:07:18,921 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 30 changer transitions 0/145 dead transitions. [2024-06-20 19:07:18,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 145 transitions, 1603 flow [2024-06-20 19:07:18,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-20 19:07:18,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-20 19:07:18,922 INFO L175 Difference]: Start difference. First operand has 158 places, 132 transitions, 1105 flow. Second operand 9 states and 101 transitions. [2024-06-20 19:07:18,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 145 transitions, 1603 flow [2024-06-20 19:07:18,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 145 transitions, 1530 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:07:19,001 INFO L231 Difference]: Finished difference. Result has 161 places, 136 transitions, 1189 flow [2024-06-20 19:07:19,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1189, PETRI_PLACES=161, PETRI_TRANSITIONS=136} [2024-06-20 19:07:19,002 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-20 19:07:19,002 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 136 transitions, 1189 flow [2024-06-20 19:07:19,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:19,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:19,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:07:19,008 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-20 19:07:19,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1901687455, now seen corresponding path program 5 times [2024-06-20 19:07:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:19,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887951294] [2024-06-20 19:07:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:26,116 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-20 19:07:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887951294] [2024-06-20 19:07:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887951294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994010174] [2024-06-20 19:07:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:26,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:26,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:26,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 136 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:26,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:26,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:26,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:26,606 INFO L124 PetriNetUnfolderBase]: 372/665 cut-off events. [2024-06-20 19:07:26,606 INFO L125 PetriNetUnfolderBase]: For 45425/45425 co-relation queries the response was YES. [2024-06-20 19:07:26,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 665 events. 372/665 cut-off events. For 45425/45425 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2876 event pairs, 59 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 4405. Up to 591 conditions per place. [2024-06-20 19:07:26,611 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 108 selfloop transitions, 14 changer transitions 0/145 dead transitions. [2024-06-20 19:07:26,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 145 transitions, 1453 flow [2024-06-20 19:07:26,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:07:26,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:07:26,612 INFO L175 Difference]: Start difference. First operand has 161 places, 136 transitions, 1189 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:07:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 145 transitions, 1453 flow [2024-06-20 19:07:26,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 145 transitions, 1376 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-20 19:07:26,677 INFO L231 Difference]: Finished difference. Result has 165 places, 136 transitions, 1144 flow [2024-06-20 19:07:26,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1144, PETRI_PLACES=165, PETRI_TRANSITIONS=136} [2024-06-20 19:07:26,677 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-20 19:07:26,677 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 136 transitions, 1144 flow [2024-06-20 19:07:26,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:26,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:26,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:26,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:07:26,678 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-20 19:07:26,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash 282287937, now seen corresponding path program 10 times [2024-06-20 19:07:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731674997] [2024-06-20 19:07:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:33,213 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-20 19:07:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731674997] [2024-06-20 19:07:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731674997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122691140] [2024-06-20 19:07:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:33,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:33,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:07:33,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 136 transitions, 1144 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:33,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:07:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:33,653 INFO L124 PetriNetUnfolderBase]: 385/677 cut-off events. [2024-06-20 19:07:33,653 INFO L125 PetriNetUnfolderBase]: For 43605/43605 co-relation queries the response was YES. [2024-06-20 19:07:33,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 677 events. 385/677 cut-off events. For 43605/43605 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2869 event pairs, 61 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 4398. Up to 638 conditions per place. [2024-06-20 19:07:33,658 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 119 selfloop transitions, 23 changer transitions 0/144 dead transitions. [2024-06-20 19:07:33,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 144 transitions, 1446 flow [2024-06-20 19:07:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-20 19:07:33,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:07:33,659 INFO L175 Difference]: Start difference. First operand has 165 places, 136 transitions, 1144 flow. Second operand 9 states and 99 transitions. [2024-06-20 19:07:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 144 transitions, 1446 flow [2024-06-20 19:07:33,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 144 transitions, 1348 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:33,732 INFO L231 Difference]: Finished difference. Result has 165 places, 136 transitions, 1097 flow [2024-06-20 19:07:33,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1097, PETRI_PLACES=165, PETRI_TRANSITIONS=136} [2024-06-20 19:07:33,732 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-20 19:07:33,732 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 136 transitions, 1097 flow [2024-06-20 19:07:33,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:33,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:33,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:33,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:07:33,733 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-20 19:07:33,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash 160752161, now seen corresponding path program 10 times [2024-06-20 19:07:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:33,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207728293] [2024-06-20 19:07:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:39,046 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-20 19:07:39,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207728293] [2024-06-20 19:07:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207728293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456235172] [2024-06-20 19:07:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:39,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:39,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:07:39,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 136 transitions, 1097 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:39,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:39,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:07:39,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:39,467 INFO L124 PetriNetUnfolderBase]: 379/668 cut-off events. [2024-06-20 19:07:39,468 INFO L125 PetriNetUnfolderBase]: For 43338/43338 co-relation queries the response was YES. [2024-06-20 19:07:39,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 668 events. 379/668 cut-off events. For 43338/43338 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2852 event pairs, 47 based on Foata normal form. 3/669 useless extension candidates. Maximal degree in co-relation 4143. Up to 536 conditions per place. [2024-06-20 19:07:39,473 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-20 19:07:39,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 150 transitions, 1429 flow [2024-06-20 19:07:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:07:39,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:07:39,474 INFO L175 Difference]: Start difference. First operand has 165 places, 136 transitions, 1097 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:07:39,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 150 transitions, 1429 flow [2024-06-20 19:07:39,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 150 transitions, 1312 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-20 19:07:39,551 INFO L231 Difference]: Finished difference. Result has 163 places, 136 transitions, 1057 flow [2024-06-20 19:07:39,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=163, PETRI_TRANSITIONS=136} [2024-06-20 19:07:39,551 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-20 19:07:39,552 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 136 transitions, 1057 flow [2024-06-20 19:07:39,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:39,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:39,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:39,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:07:39,552 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-20 19:07:39,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 397414841, now seen corresponding path program 1 times [2024-06-20 19:07:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505519085] [2024-06-20 19:07:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:46,923 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-20 19:07:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505519085] [2024-06-20 19:07:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505519085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602565407] [2024-06-20 19:07:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:47,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:07:47,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 136 transitions, 1057 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-20 19:07:47,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:47,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:07:47,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:47,527 INFO L124 PetriNetUnfolderBase]: 376/663 cut-off events. [2024-06-20 19:07:47,527 INFO L125 PetriNetUnfolderBase]: For 39904/39904 co-relation queries the response was YES. [2024-06-20 19:07:47,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 663 events. 376/663 cut-off events. For 39904/39904 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2791 event pairs, 53 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 3962. Up to 633 conditions per place. [2024-06-20 19:07:47,532 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 130 selfloop transitions, 14 changer transitions 0/146 dead transitions. [2024-06-20 19:07:47,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 146 transitions, 1367 flow [2024-06-20 19:07:47,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:07:47,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:07:47,533 INFO L175 Difference]: Start difference. First operand has 163 places, 136 transitions, 1057 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:07:47,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 146 transitions, 1367 flow [2024-06-20 19:07:47,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 146 transitions, 1279 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:07:47,596 INFO L231 Difference]: Finished difference. Result has 163 places, 136 transitions, 1001 flow [2024-06-20 19:07:47,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1001, PETRI_PLACES=163, PETRI_TRANSITIONS=136} [2024-06-20 19:07:47,596 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-20 19:07:47,596 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 136 transitions, 1001 flow [2024-06-20 19:07:47,597 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-20 19:07:47,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:47,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:47,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:07:47,597 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-20 19:07:47,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1384700821, now seen corresponding path program 1 times [2024-06-20 19:07:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:47,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060037092] [2024-06-20 19:07:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:55,106 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-20 19:07:55,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060037092] [2024-06-20 19:07:55,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060037092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:55,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:55,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:07:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011361925] [2024-06-20 19:07:55,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:55,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:07:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:07:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:07:55,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:07:55,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 136 transitions, 1001 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:55,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:55,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:07:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:55,689 INFO L124 PetriNetUnfolderBase]: 387/684 cut-off events. [2024-06-20 19:07:55,689 INFO L125 PetriNetUnfolderBase]: For 44833/44833 co-relation queries the response was YES. [2024-06-20 19:07:55,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 684 events. 387/684 cut-off events. For 44833/44833 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2949 event pairs, 37 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 4169. Up to 555 conditions per place. [2024-06-20 19:07:55,697 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 130 selfloop transitions, 28 changer transitions 0/160 dead transitions. [2024-06-20 19:07:55,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 160 transitions, 1539 flow [2024-06-20 19:07:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:07:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:07:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 19:07:55,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-20 19:07:55,712 INFO L175 Difference]: Start difference. First operand has 163 places, 136 transitions, 1001 flow. Second operand 11 states and 128 transitions. [2024-06-20 19:07:55,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 160 transitions, 1539 flow [2024-06-20 19:07:55,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 1505 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:07:55,788 INFO L231 Difference]: Finished difference. Result has 167 places, 138 transitions, 1077 flow [2024-06-20 19:07:55,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1077, PETRI_PLACES=167, PETRI_TRANSITIONS=138} [2024-06-20 19:07:55,789 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-20 19:07:55,791 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 138 transitions, 1077 flow [2024-06-20 19:07:55,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:55,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:55,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:07:55,791 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-20 19:07:55,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2004361616, now seen corresponding path program 1 times [2024-06-20 19:07:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539791033] [2024-06-20 19:07:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:02,045 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-20 19:08:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:02,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539791033] [2024-06-20 19:08:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539791033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163263396] [2024-06-20 19:08:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:02,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:02,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:02,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 138 transitions, 1077 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:02,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:02,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:02,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:02,573 INFO L124 PetriNetUnfolderBase]: 405/713 cut-off events. [2024-06-20 19:08:02,573 INFO L125 PetriNetUnfolderBase]: For 50034/50034 co-relation queries the response was YES. [2024-06-20 19:08:02,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4676 conditions, 713 events. 405/713 cut-off events. For 50034/50034 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3093 event pairs, 55 based on Foata normal form. 1/712 useless extension candidates. Maximal degree in co-relation 4594. Up to 620 conditions per place. [2024-06-20 19:08:02,579 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 133 selfloop transitions, 30 changer transitions 0/165 dead transitions. [2024-06-20 19:08:02,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 165 transitions, 1645 flow [2024-06-20 19:08:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:08:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:08:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-20 19:08:02,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-20 19:08:02,580 INFO L175 Difference]: Start difference. First operand has 167 places, 138 transitions, 1077 flow. Second operand 11 states and 133 transitions. [2024-06-20 19:08:02,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 165 transitions, 1645 flow [2024-06-20 19:08:02,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 1579 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:08:02,665 INFO L231 Difference]: Finished difference. Result has 172 places, 143 transitions, 1160 flow [2024-06-20 19:08:02,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1160, PETRI_PLACES=172, PETRI_TRANSITIONS=143} [2024-06-20 19:08:02,665 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-06-20 19:08:02,665 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 143 transitions, 1160 flow [2024-06-20 19:08:02,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:02,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:02,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:02,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:08:02,666 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-20 19:08:02,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1711541321, now seen corresponding path program 2 times [2024-06-20 19:08:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207332032] [2024-06-20 19:08:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:09,215 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-20 19:08:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207332032] [2024-06-20 19:08:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207332032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:09,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355345995] [2024-06-20 19:08:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:09,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:09,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:09,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:09,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:09,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 143 transitions, 1160 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:09,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:09,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:09,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:09,736 INFO L124 PetriNetUnfolderBase]: 409/721 cut-off events. [2024-06-20 19:08:09,737 INFO L125 PetriNetUnfolderBase]: For 54101/54101 co-relation queries the response was YES. [2024-06-20 19:08:09,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 721 events. 409/721 cut-off events. For 54101/54101 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3138 event pairs, 60 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 4785. Up to 653 conditions per place. [2024-06-20 19:08:09,743 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 134 selfloop transitions, 27 changer transitions 0/163 dead transitions. [2024-06-20 19:08:09,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 163 transitions, 1554 flow [2024-06-20 19:08:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:08:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:08:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-20 19:08:09,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-20 19:08:09,749 INFO L175 Difference]: Start difference. First operand has 172 places, 143 transitions, 1160 flow. Second operand 11 states and 126 transitions. [2024-06-20 19:08:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 163 transitions, 1554 flow [2024-06-20 19:08:09,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 163 transitions, 1495 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:08:09,827 INFO L231 Difference]: Finished difference. Result has 176 places, 144 transitions, 1179 flow [2024-06-20 19:08:09,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1179, PETRI_PLACES=176, PETRI_TRANSITIONS=144} [2024-06-20 19:08:09,828 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2024-06-20 19:08:09,828 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 144 transitions, 1179 flow [2024-06-20 19:08:09,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:09,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:09,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:09,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:08:09,829 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-20 19:08:09,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1763249331, now seen corresponding path program 3 times [2024-06-20 19:08:09,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:09,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192316992] [2024-06-20 19:08:09,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:09,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:17,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-20 19:08:17,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:17,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192316992] [2024-06-20 19:08:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192316992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013851602] [2024-06-20 19:08:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:17,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:17,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:17,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 144 transitions, 1179 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:17,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:17,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:17,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:18,142 INFO L124 PetriNetUnfolderBase]: 413/729 cut-off events. [2024-06-20 19:08:18,142 INFO L125 PetriNetUnfolderBase]: For 55831/55831 co-relation queries the response was YES. [2024-06-20 19:08:18,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4964 conditions, 729 events. 413/729 cut-off events. For 55831/55831 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3201 event pairs, 60 based on Foata normal form. 2/729 useless extension candidates. Maximal degree in co-relation 4877. Up to 647 conditions per place. [2024-06-20 19:08:18,148 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 135 selfloop transitions, 28 changer transitions 0/165 dead transitions. [2024-06-20 19:08:18,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 165 transitions, 1581 flow [2024-06-20 19:08:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:08:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:08:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 19:08:18,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-20 19:08:18,149 INFO L175 Difference]: Start difference. First operand has 176 places, 144 transitions, 1179 flow. Second operand 11 states and 128 transitions. [2024-06-20 19:08:18,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 165 transitions, 1581 flow [2024-06-20 19:08:18,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 165 transitions, 1515 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-20 19:08:18,235 INFO L231 Difference]: Finished difference. Result has 178 places, 145 transitions, 1195 flow [2024-06-20 19:08:18,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1195, PETRI_PLACES=178, PETRI_TRANSITIONS=145} [2024-06-20 19:08:18,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-20 19:08:18,236 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 145 transitions, 1195 flow [2024-06-20 19:08:18,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:18,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:18,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:18,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:08:18,237 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-20 19:08:18,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1296135061, now seen corresponding path program 4 times [2024-06-20 19:08:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:18,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630129280] [2024-06-20 19:08:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:25,360 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-20 19:08:25,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:25,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630129280] [2024-06-20 19:08:25,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630129280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:25,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:25,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:25,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601732131] [2024-06-20 19:08:25,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:25,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:25,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:25,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 145 transitions, 1195 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:25,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:25,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:25,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:25,981 INFO L124 PetriNetUnfolderBase]: 417/737 cut-off events. [2024-06-20 19:08:25,981 INFO L125 PetriNetUnfolderBase]: For 57809/57809 co-relation queries the response was YES. [2024-06-20 19:08:25,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 737 events. 417/737 cut-off events. For 57809/57809 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3262 event pairs, 60 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 4951. Up to 665 conditions per place. [2024-06-20 19:08:25,988 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 23 changer transitions 0/163 dead transitions. [2024-06-20 19:08:25,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 163 transitions, 1705 flow [2024-06-20 19:08:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 19:08:25,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:08:25,990 INFO L175 Difference]: Start difference. First operand has 178 places, 145 transitions, 1195 flow. Second operand 10 states and 115 transitions. [2024-06-20 19:08:25,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 163 transitions, 1705 flow [2024-06-20 19:08:26,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 163 transitions, 1635 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:08:26,084 INFO L231 Difference]: Finished difference. Result has 179 places, 146 transitions, 1197 flow [2024-06-20 19:08:26,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1197, PETRI_PLACES=179, PETRI_TRANSITIONS=146} [2024-06-20 19:08:26,084 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-20 19:08:26,084 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 146 transitions, 1197 flow [2024-06-20 19:08:26,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:26,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:26,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:26,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:08:26,085 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-20 19:08:26,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1478953581, now seen corresponding path program 5 times [2024-06-20 19:08:26,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245744613] [2024-06-20 19:08:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:33,011 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-20 19:08:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:33,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245744613] [2024-06-20 19:08:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245744613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989415979] [2024-06-20 19:08:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:33,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:33,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:33,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 146 transitions, 1197 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:33,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:33,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:33,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:33,561 INFO L124 PetriNetUnfolderBase]: 421/745 cut-off events. [2024-06-20 19:08:33,561 INFO L125 PetriNetUnfolderBase]: For 59799/59799 co-relation queries the response was YES. [2024-06-20 19:08:33,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5093 conditions, 745 events. 421/745 cut-off events. For 59799/59799 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3308 event pairs, 62 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 5004. Up to 692 conditions per place. [2024-06-20 19:08:33,567 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2024-06-20 19:08:33,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 162 transitions, 1581 flow [2024-06-20 19:08:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:08:33,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:08:33,569 INFO L175 Difference]: Start difference. First operand has 179 places, 146 transitions, 1197 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:08:33,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 162 transitions, 1581 flow [2024-06-20 19:08:33,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 162 transitions, 1511 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:08:33,668 INFO L231 Difference]: Finished difference. Result has 181 places, 147 transitions, 1201 flow [2024-06-20 19:08:33,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1201, PETRI_PLACES=181, PETRI_TRANSITIONS=147} [2024-06-20 19:08:33,669 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2024-06-20 19:08:33,669 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 147 transitions, 1201 flow [2024-06-20 19:08:33,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:33,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:33,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:08:33,670 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-20 19:08:33,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2000786696, now seen corresponding path program 2 times [2024-06-20 19:08:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671975420] [2024-06-20 19:08:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:40,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-20 19:08:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671975420] [2024-06-20 19:08:40,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671975420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:40,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:40,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4741473] [2024-06-20 19:08:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:40,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:40,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:40,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:40,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 147 transitions, 1201 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:40,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:40,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:40,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:40,678 INFO L124 PetriNetUnfolderBase]: 424/750 cut-off events. [2024-06-20 19:08:40,678 INFO L125 PetriNetUnfolderBase]: For 59564/59564 co-relation queries the response was YES. [2024-06-20 19:08:40,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5115 conditions, 750 events. 424/750 cut-off events. For 59564/59564 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3345 event pairs, 62 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 5025. Up to 691 conditions per place. [2024-06-20 19:08:40,685 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 25 changer transitions 0/167 dead transitions. [2024-06-20 19:08:40,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 167 transitions, 1763 flow [2024-06-20 19:08:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 19:08:40,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-20 19:08:40,690 INFO L175 Difference]: Start difference. First operand has 181 places, 147 transitions, 1201 flow. Second operand 10 states and 116 transitions. [2024-06-20 19:08:40,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 167 transitions, 1763 flow [2024-06-20 19:08:40,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 167 transitions, 1703 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:08:40,832 INFO L231 Difference]: Finished difference. Result has 184 places, 152 transitions, 1273 flow [2024-06-20 19:08:40,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=173, 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=1273, PETRI_PLACES=184, PETRI_TRANSITIONS=152} [2024-06-20 19:08:40,834 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2024-06-20 19:08:40,834 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 152 transitions, 1273 flow [2024-06-20 19:08:40,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:40,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:40,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:40,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:08:40,835 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-20 19:08:40,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1295987191, now seen corresponding path program 6 times [2024-06-20 19:08:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:40,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468388915] [2024-06-20 19:08:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:47,433 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-20 19:08:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468388915] [2024-06-20 19:08:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468388915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264566881] [2024-06-20 19:08:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:47,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:47,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:47,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:47,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:47,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 152 transitions, 1273 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:47,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:47,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:47,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:47,967 INFO L124 PetriNetUnfolderBase]: 421/745 cut-off events. [2024-06-20 19:08:47,967 INFO L125 PetriNetUnfolderBase]: For 59363/59363 co-relation queries the response was YES. [2024-06-20 19:08:47,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5014 conditions, 745 events. 421/745 cut-off events. For 59363/59363 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3303 event pairs, 61 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 4922. Up to 698 conditions per place. [2024-06-20 19:08:47,973 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 19 changer transitions 0/167 dead transitions. [2024-06-20 19:08:47,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 167 transitions, 1643 flow [2024-06-20 19:08:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:08:47,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:08:47,989 INFO L175 Difference]: Start difference. First operand has 184 places, 152 transitions, 1273 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:08:47,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 167 transitions, 1643 flow [2024-06-20 19:08:48,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 167 transitions, 1580 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-20 19:08:48,080 INFO L231 Difference]: Finished difference. Result has 189 places, 152 transitions, 1252 flow [2024-06-20 19:08:48,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1252, PETRI_PLACES=189, PETRI_TRANSITIONS=152} [2024-06-20 19:08:48,080 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-20 19:08:48,080 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 152 transitions, 1252 flow [2024-06-20 19:08:48,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:48,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:48,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:48,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:08:48,081 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-20 19:08:48,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1295987036, now seen corresponding path program 3 times [2024-06-20 19:08:48,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:48,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435597369] [2024-06-20 19:08:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:54,682 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-20 19:08:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435597369] [2024-06-20 19:08:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435597369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177086877] [2024-06-20 19:08:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:54,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:54,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:54,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:08:54,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 152 transitions, 1252 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:54,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:54,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:08:54,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:55,195 INFO L124 PetriNetUnfolderBase]: 424/750 cut-off events. [2024-06-20 19:08:55,195 INFO L125 PetriNetUnfolderBase]: For 58762/58762 co-relation queries the response was YES. [2024-06-20 19:08:55,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 750 events. 424/750 cut-off events. For 58762/58762 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3333 event pairs, 61 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 4959. Up to 699 conditions per place. [2024-06-20 19:08:55,204 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 23 changer transitions 0/169 dead transitions. [2024-06-20 19:08:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 169 transitions, 1788 flow [2024-06-20 19:08:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 19:08:55,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-20 19:08:55,207 INFO L175 Difference]: Start difference. First operand has 189 places, 152 transitions, 1252 flow. Second operand 10 states and 114 transitions. [2024-06-20 19:08:55,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 169 transitions, 1788 flow [2024-06-20 19:08:55,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 169 transitions, 1744 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:08:55,323 INFO L231 Difference]: Finished difference. Result has 190 places, 154 transitions, 1291 flow [2024-06-20 19:08:55,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1291, PETRI_PLACES=190, PETRI_TRANSITIONS=154} [2024-06-20 19:08:55,324 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-20 19:08:55,324 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 154 transitions, 1291 flow [2024-06-20 19:08:55,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:55,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:55,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:55,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:08:55,324 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-20 19:08:55,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1479103466, now seen corresponding path program 4 times [2024-06-20 19:08:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554243303] [2024-06-20 19:08:55,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:02,061 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-20 19:09:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554243303] [2024-06-20 19:09:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554243303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204163088] [2024-06-20 19:09:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:02,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:02,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:02,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:02,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:02,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 154 transitions, 1291 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:02,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:02,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:02,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:02,680 INFO L124 PetriNetUnfolderBase]: 422/747 cut-off events. [2024-06-20 19:09:02,680 INFO L125 PetriNetUnfolderBase]: For 58356/58356 co-relation queries the response was YES. [2024-06-20 19:09:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4995 conditions, 747 events. 422/747 cut-off events. For 58356/58356 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3324 event pairs, 61 based on Foata normal form. 1/746 useless extension candidates. Maximal degree in co-relation 4900. Up to 703 conditions per place. [2024-06-20 19:09:02,686 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 146 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2024-06-20 19:09:02,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 168 transitions, 1661 flow [2024-06-20 19:09:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:09:02,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:09:02,688 INFO L175 Difference]: Start difference. First operand has 190 places, 154 transitions, 1291 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:09:02,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 168 transitions, 1661 flow [2024-06-20 19:09:02,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 168 transitions, 1579 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-20 19:09:02,788 INFO L231 Difference]: Finished difference. Result has 192 places, 154 transitions, 1254 flow [2024-06-20 19:09:02,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1254, PETRI_PLACES=192, PETRI_TRANSITIONS=154} [2024-06-20 19:09:02,788 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-20 19:09:02,788 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 154 transitions, 1254 flow [2024-06-20 19:09:02,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:02,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:02,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:02,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:09:02,793 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-20 19:09:02,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash 763726630, now seen corresponding path program 5 times [2024-06-20 19:09:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:02,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738419162] [2024-06-20 19:09:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:09,872 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-20 19:09:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738419162] [2024-06-20 19:09:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738419162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:09,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031804001] [2024-06-20 19:09:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:09,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:10,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:10,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 154 transitions, 1254 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:10,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:10,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:10,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:10,361 INFO L124 PetriNetUnfolderBase]: 425/752 cut-off events. [2024-06-20 19:09:10,362 INFO L125 PetriNetUnfolderBase]: For 60024/60024 co-relation queries the response was YES. [2024-06-20 19:09:10,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5025 conditions, 752 events. 425/752 cut-off events. For 60024/60024 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3384 event pairs, 48 based on Foata normal form. 1/751 useless extension candidates. Maximal degree in co-relation 4929. Up to 617 conditions per place. [2024-06-20 19:09:10,368 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 136 selfloop transitions, 46 changer transitions 0/184 dead transitions. [2024-06-20 19:09:10,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 184 transitions, 1787 flow [2024-06-20 19:09:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:09:10,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-20 19:09:10,369 INFO L175 Difference]: Start difference. First operand has 192 places, 154 transitions, 1254 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:09:10,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 184 transitions, 1787 flow [2024-06-20 19:09:10,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 184 transitions, 1741 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:10,477 INFO L231 Difference]: Finished difference. Result has 196 places, 169 transitions, 1478 flow [2024-06-20 19:09:10,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1478, PETRI_PLACES=196, PETRI_TRANSITIONS=169} [2024-06-20 19:09:10,478 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-20 19:09:10,478 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 169 transitions, 1478 flow [2024-06-20 19:09:10,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:10,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:10,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:10,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:09:10,479 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-20 19:09:10,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash 763519085, now seen corresponding path program 7 times [2024-06-20 19:09:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352529994] [2024-06-20 19:09:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:17,724 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-20 19:09:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352529994] [2024-06-20 19:09:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352529994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:17,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977040828] [2024-06-20 19:09:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:17,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:17,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:17,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:17,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 169 transitions, 1478 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:17,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:17,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:17,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:18,210 INFO L124 PetriNetUnfolderBase]: 429/760 cut-off events. [2024-06-20 19:09:18,210 INFO L125 PetriNetUnfolderBase]: For 64764/64764 co-relation queries the response was YES. [2024-06-20 19:09:18,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 760 events. 429/760 cut-off events. For 64764/64764 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3404 event pairs, 61 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 5221. Up to 664 conditions per place. [2024-06-20 19:09:18,217 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 144 selfloop transitions, 37 changer transitions 0/183 dead transitions. [2024-06-20 19:09:18,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 183 transitions, 1900 flow [2024-06-20 19:09:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 19:09:18,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:09:18,219 INFO L175 Difference]: Start difference. First operand has 196 places, 169 transitions, 1478 flow. Second operand 10 states and 115 transitions. [2024-06-20 19:09:18,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 183 transitions, 1900 flow [2024-06-20 19:09:18,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 183 transitions, 1810 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-20 19:09:18,344 INFO L231 Difference]: Finished difference. Result has 201 places, 170 transitions, 1494 flow [2024-06-20 19:09:18,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=201, PETRI_TRANSITIONS=170} [2024-06-20 19:09:18,344 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-20 19:09:18,345 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 170 transitions, 1494 flow [2024-06-20 19:09:18,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:18,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:18,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:18,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:09:18,345 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-20 19:09:18,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash 763519240, now seen corresponding path program 6 times [2024-06-20 19:09:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:18,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134263853] [2024-06-20 19:09:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:24,581 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-20 19:09:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:24,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134263853] [2024-06-20 19:09:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134263853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464496957] [2024-06-20 19:09:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:24,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:24,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:09:24,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 170 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:24,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:24,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:09:24,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:24,974 INFO L124 PetriNetUnfolderBase]: 437/773 cut-off events. [2024-06-20 19:09:24,975 INFO L125 PetriNetUnfolderBase]: For 66568/66568 co-relation queries the response was YES. [2024-06-20 19:09:24,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5444 conditions, 773 events. 437/773 cut-off events. For 66568/66568 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3513 event pairs, 50 based on Foata normal form. 1/772 useless extension candidates. Maximal degree in co-relation 5343. Up to 628 conditions per place. [2024-06-20 19:09:24,981 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 139 selfloop transitions, 50 changer transitions 0/191 dead transitions. [2024-06-20 19:09:24,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 191 transitions, 2144 flow [2024-06-20 19:09:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-20 19:09:24,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-20 19:09:24,984 INFO L175 Difference]: Start difference. First operand has 201 places, 170 transitions, 1494 flow. Second operand 10 states and 131 transitions. [2024-06-20 19:09:24,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 191 transitions, 2144 flow [2024-06-20 19:09:25,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 191 transitions, 2048 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:09:25,102 INFO L231 Difference]: Finished difference. Result has 203 places, 175 transitions, 1586 flow [2024-06-20 19:09:25,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1586, PETRI_PLACES=203, PETRI_TRANSITIONS=175} [2024-06-20 19:09:25,103 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-20 19:09:25,103 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 175 transitions, 1586 flow [2024-06-20 19:09:25,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:25,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:25,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:09:25,104 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-20 19:09:25,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2011560102, now seen corresponding path program 7 times [2024-06-20 19:09:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834964297] [2024-06-20 19:09:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:31,690 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-20 19:09:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834964297] [2024-06-20 19:09:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834964297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:31,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513475479] [2024-06-20 19:09:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:31,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:31,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:31,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 175 transitions, 1586 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:31,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:31,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:31,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:32,154 INFO L124 PetriNetUnfolderBase]: 441/780 cut-off events. [2024-06-20 19:09:32,155 INFO L125 PetriNetUnfolderBase]: For 71235/71235 co-relation queries the response was YES. [2024-06-20 19:09:32,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5487 conditions, 780 events. 441/780 cut-off events. For 71235/71235 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3536 event pairs, 58 based on Foata normal form. 3/781 useless extension candidates. Maximal degree in co-relation 5385. Up to 537 conditions per place. [2024-06-20 19:09:32,161 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 125 selfloop transitions, 67 changer transitions 0/194 dead transitions. [2024-06-20 19:09:32,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 194 transitions, 2054 flow [2024-06-20 19:09:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:09:32,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-20 19:09:32,163 INFO L175 Difference]: Start difference. First operand has 203 places, 175 transitions, 1586 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:09:32,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 194 transitions, 2054 flow [2024-06-20 19:09:32,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 194 transitions, 1954 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-20 19:09:32,310 INFO L231 Difference]: Finished difference. Result has 209 places, 177 transitions, 1674 flow [2024-06-20 19:09:32,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1674, PETRI_PLACES=209, PETRI_TRANSITIONS=177} [2024-06-20 19:09:32,312 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-20 19:09:32,312 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 177 transitions, 1674 flow [2024-06-20 19:09:32,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:32,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:32,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:32,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:09:32,313 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-20 19:09:32,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2017072367, now seen corresponding path program 8 times [2024-06-20 19:09:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826628071] [2024-06-20 19:09:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:39,349 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-20 19:09:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826628071] [2024-06-20 19:09:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826628071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140774447] [2024-06-20 19:09:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:39,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:39,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 177 transitions, 1674 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:39,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:39,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:39,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:39,807 INFO L124 PetriNetUnfolderBase]: 445/788 cut-off events. [2024-06-20 19:09:39,807 INFO L125 PetriNetUnfolderBase]: For 70697/70697 co-relation queries the response was YES. [2024-06-20 19:09:39,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5691 conditions, 788 events. 445/788 cut-off events. For 70697/70697 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3594 event pairs, 63 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 5587. Up to 681 conditions per place. [2024-06-20 19:09:39,814 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 148 selfloop transitions, 42 changer transitions 0/192 dead transitions. [2024-06-20 19:09:39,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 192 transitions, 2118 flow [2024-06-20 19:09:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:09:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:09:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-20 19:09:39,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-20 19:09:39,815 INFO L175 Difference]: Start difference. First operand has 209 places, 177 transitions, 1674 flow. Second operand 11 states and 126 transitions. [2024-06-20 19:09:39,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 192 transitions, 2118 flow [2024-06-20 19:09:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 192 transitions, 1920 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:39,959 INFO L231 Difference]: Finished difference. Result has 211 places, 178 transitions, 1595 flow [2024-06-20 19:09:39,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1595, PETRI_PLACES=211, PETRI_TRANSITIONS=178} [2024-06-20 19:09:39,959 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-20 19:09:39,959 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 178 transitions, 1595 flow [2024-06-20 19:09:39,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:39,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:39,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:39,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:09:39,960 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-20 19:09:39,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2017072212, now seen corresponding path program 8 times [2024-06-20 19:09:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009193202] [2024-06-20 19:09:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:45,749 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-20 19:09:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009193202] [2024-06-20 19:09:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009193202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059339271] [2024-06-20 19:09:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:45,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:45,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:45,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 178 transitions, 1595 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:45,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:45,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:45,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:46,185 INFO L124 PetriNetUnfolderBase]: 453/801 cut-off events. [2024-06-20 19:09:46,185 INFO L125 PetriNetUnfolderBase]: For 72512/72512 co-relation queries the response was YES. [2024-06-20 19:09:46,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 801 events. 453/801 cut-off events. For 72512/72512 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3684 event pairs, 54 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 5603. Up to 639 conditions per place. [2024-06-20 19:09:46,192 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 57 changer transitions 0/199 dead transitions. [2024-06-20 19:09:46,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 199 transitions, 2276 flow [2024-06-20 19:09:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:09:46,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-20 19:09:46,202 INFO L175 Difference]: Start difference. First operand has 211 places, 178 transitions, 1595 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:09:46,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 199 transitions, 2276 flow [2024-06-20 19:09:46,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 199 transitions, 2169 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:46,350 INFO L231 Difference]: Finished difference. Result has 212 places, 183 transitions, 1699 flow [2024-06-20 19:09:46,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1699, PETRI_PLACES=212, PETRI_TRANSITIONS=183} [2024-06-20 19:09:46,351 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-20 19:09:46,351 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 183 transitions, 1699 flow [2024-06-20 19:09:46,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:46,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:46,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:09:46,352 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-20 19:09:46,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2017076087, now seen corresponding path program 9 times [2024-06-20 19:09:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793390183] [2024-06-20 19:09:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:53,595 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-20 19:09:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793390183] [2024-06-20 19:09:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793390183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023334370] [2024-06-20 19:09:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:53,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:53,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:53,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:53,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:09:53,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 183 transitions, 1699 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:53,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:53,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:09:53,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:54,242 INFO L124 PetriNetUnfolderBase]: 457/809 cut-off events. [2024-06-20 19:09:54,243 INFO L125 PetriNetUnfolderBase]: For 77443/77443 co-relation queries the response was YES. [2024-06-20 19:09:54,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5832 conditions, 809 events. 457/809 cut-off events. For 77443/77443 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3739 event pairs, 61 based on Foata normal form. 2/809 useless extension candidates. Maximal degree in co-relation 5727. Up to 682 conditions per place. [2024-06-20 19:09:54,250 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 153 selfloop transitions, 43 changer transitions 0/198 dead transitions. [2024-06-20 19:09:54,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 198 transitions, 2157 flow [2024-06-20 19:09:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:09:54,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-20 19:09:54,251 INFO L175 Difference]: Start difference. First operand has 212 places, 183 transitions, 1699 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:09:54,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 198 transitions, 2157 flow [2024-06-20 19:09:54,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 198 transitions, 2077 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-20 19:09:54,424 INFO L231 Difference]: Finished difference. Result has 218 places, 184 transitions, 1741 flow [2024-06-20 19:09:54,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1741, PETRI_PLACES=218, PETRI_TRANSITIONS=184} [2024-06-20 19:09:54,424 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-20 19:09:54,425 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 184 transitions, 1741 flow [2024-06-20 19:09:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:54,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:54,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:54,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:09:54,425 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-20 19:09:54,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2016928062, now seen corresponding path program 9 times [2024-06-20 19:09:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:54,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394454015] [2024-06-20 19:09:54,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:01,009 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-20 19:10:01,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394454015] [2024-06-20 19:10:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394454015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:01,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:01,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794730171] [2024-06-20 19:10:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:01,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:01,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:01,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:01,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:01,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 184 transitions, 1741 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:01,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:01,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:01,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:01,586 INFO L124 PetriNetUnfolderBase]: 470/830 cut-off events. [2024-06-20 19:10:01,587 INFO L125 PetriNetUnfolderBase]: For 82691/82691 co-relation queries the response was YES. [2024-06-20 19:10:01,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 830 events. 470/830 cut-off events. For 82691/82691 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3838 event pairs, 60 based on Foata normal form. 1/829 useless extension candidates. Maximal degree in co-relation 6122. Up to 577 conditions per place. [2024-06-20 19:10:01,593 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 135 selfloop transitions, 69 changer transitions 0/206 dead transitions. [2024-06-20 19:10:01,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 206 transitions, 2423 flow [2024-06-20 19:10:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 19:10:01,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-20 19:10:01,594 INFO L175 Difference]: Start difference. First operand has 218 places, 184 transitions, 1741 flow. Second operand 10 states and 133 transitions. [2024-06-20 19:10:01,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 206 transitions, 2423 flow [2024-06-20 19:10:01,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 206 transitions, 2311 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:10:01,746 INFO L231 Difference]: Finished difference. Result has 221 places, 188 transitions, 1867 flow [2024-06-20 19:10:01,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1867, PETRI_PLACES=221, PETRI_TRANSITIONS=188} [2024-06-20 19:10:01,746 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-20 19:10:01,746 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 188 transitions, 1867 flow [2024-06-20 19:10:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:01,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:01,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:01,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:10:01,747 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-20 19:10:01,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2016922482, now seen corresponding path program 10 times [2024-06-20 19:10:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:01,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227121899] [2024-06-20 19:10:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:08,305 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-20 19:10:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227121899] [2024-06-20 19:10:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227121899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:08,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585122331] [2024-06-20 19:10:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:08,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:08,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:08,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 188 transitions, 1867 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:08,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:08,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:08,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:08,832 INFO L124 PetriNetUnfolderBase]: 464/821 cut-off events. [2024-06-20 19:10:08,833 INFO L125 PetriNetUnfolderBase]: For 82065/82065 co-relation queries the response was YES. [2024-06-20 19:10:08,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 821 events. 464/821 cut-off events. For 82065/82065 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3800 event pairs, 60 based on Foata normal form. 3/822 useless extension candidates. Maximal degree in co-relation 5916. Up to 578 conditions per place. [2024-06-20 19:10:08,840 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 137 selfloop transitions, 66 changer transitions 0/205 dead transitions. [2024-06-20 19:10:08,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 205 transitions, 2315 flow [2024-06-20 19:10:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 19:10:08,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:10:08,841 INFO L175 Difference]: Start difference. First operand has 221 places, 188 transitions, 1867 flow. Second operand 10 states and 130 transitions. [2024-06-20 19:10:08,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 205 transitions, 2315 flow [2024-06-20 19:10:08,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 205 transitions, 2099 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-20 19:10:08,992 INFO L231 Difference]: Finished difference. Result has 224 places, 188 transitions, 1791 flow [2024-06-20 19:10:08,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1791, PETRI_PLACES=224, PETRI_TRANSITIONS=188} [2024-06-20 19:10:08,993 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-20 19:10:08,993 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 188 transitions, 1791 flow [2024-06-20 19:10:08,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:08,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:08,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:08,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:10:08,994 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-20 19:10:08,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1032800526, now seen corresponding path program 11 times [2024-06-20 19:10:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615294317] [2024-06-20 19:10:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:14,680 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-20 19:10:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615294317] [2024-06-20 19:10:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615294317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425634688] [2024-06-20 19:10:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:14,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:14,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 188 transitions, 1791 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:14,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:14,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:15,163 INFO L124 PetriNetUnfolderBase]: 467/826 cut-off events. [2024-06-20 19:10:15,163 INFO L125 PetriNetUnfolderBase]: For 77863/77863 co-relation queries the response was YES. [2024-06-20 19:10:15,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 826 events. 467/826 cut-off events. For 77863/77863 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3853 event pairs, 54 based on Foata normal form. 1/825 useless extension candidates. Maximal degree in co-relation 5891. Up to 757 conditions per place. [2024-06-20 19:10:15,171 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 172 selfloop transitions, 30 changer transitions 0/204 dead transitions. [2024-06-20 19:10:15,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 204 transitions, 2294 flow [2024-06-20 19:10:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-20 19:10:15,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-20 19:10:15,172 INFO L175 Difference]: Start difference. First operand has 224 places, 188 transitions, 1791 flow. Second operand 10 states and 112 transitions. [2024-06-20 19:10:15,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 204 transitions, 2294 flow [2024-06-20 19:10:15,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 204 transitions, 2155 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:10:15,344 INFO L231 Difference]: Finished difference. Result has 226 places, 193 transitions, 1795 flow [2024-06-20 19:10:15,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1795, PETRI_PLACES=226, PETRI_TRANSITIONS=193} [2024-06-20 19:10:15,345 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-20 19:10:15,345 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 193 transitions, 1795 flow [2024-06-20 19:10:15,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:15,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:15,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:15,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:10:15,346 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-20 19:10:15,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1101669239, now seen corresponding path program 1 times [2024-06-20 19:10:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187133145] [2024-06-20 19:10:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:21,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-20 19:10:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187133145] [2024-06-20 19:10:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187133145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548194013] [2024-06-20 19:10:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:21,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:21,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:21,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 193 transitions, 1795 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:21,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:21,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:21,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:21,986 INFO L124 PetriNetUnfolderBase]: 463/820 cut-off events. [2024-06-20 19:10:21,986 INFO L125 PetriNetUnfolderBase]: For 76742/76742 co-relation queries the response was YES. [2024-06-20 19:10:21,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5791 conditions, 820 events. 463/820 cut-off events. For 76742/76742 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3782 event pairs, 57 based on Foata normal form. 2/820 useless extension candidates. Maximal degree in co-relation 5679. Up to 780 conditions per place. [2024-06-20 19:10:21,996 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 17 changer transitions 0/207 dead transitions. [2024-06-20 19:10:21,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 207 transitions, 2263 flow [2024-06-20 19:10:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:10:21,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:10:21,997 INFO L175 Difference]: Start difference. First operand has 226 places, 193 transitions, 1795 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:10:21,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 207 transitions, 2263 flow [2024-06-20 19:10:22,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 207 transitions, 2163 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-20 19:10:22,198 INFO L231 Difference]: Finished difference. Result has 230 places, 195 transitions, 1770 flow [2024-06-20 19:10:22,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1770, PETRI_PLACES=230, PETRI_TRANSITIONS=195} [2024-06-20 19:10:22,199 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-20 19:10:22,199 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 195 transitions, 1770 flow [2024-06-20 19:10:22,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:22,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:22,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:10:22,200 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-20 19:10:22,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash -574583892, now seen corresponding path program 12 times [2024-06-20 19:10:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387358366] [2024-06-20 19:10:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:27,959 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-20 19:10:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387358366] [2024-06-20 19:10:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387358366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943503973] [2024-06-20 19:10:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:27,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:27,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:27,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:28,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:28,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 195 transitions, 1770 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:28,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:28,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:28,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:28,517 INFO L124 PetriNetUnfolderBase]: 466/825 cut-off events. [2024-06-20 19:10:28,518 INFO L125 PetriNetUnfolderBase]: For 75504/75504 co-relation queries the response was YES. [2024-06-20 19:10:28,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5823 conditions, 825 events. 466/825 cut-off events. For 75504/75504 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3819 event pairs, 57 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 5710. Up to 798 conditions per place. [2024-06-20 19:10:28,524 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 190 selfloop transitions, 17 changer transitions 0/209 dead transitions. [2024-06-20 19:10:28,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 209 transitions, 2273 flow [2024-06-20 19:10:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-20 19:10:28,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:10:28,525 INFO L175 Difference]: Start difference. First operand has 230 places, 195 transitions, 1770 flow. Second operand 10 states and 105 transitions. [2024-06-20 19:10:28,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 209 transitions, 2273 flow [2024-06-20 19:10:28,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 209 transitions, 2214 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:10:28,688 INFO L231 Difference]: Finished difference. Result has 233 places, 200 transitions, 1830 flow [2024-06-20 19:10:28,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1830, PETRI_PLACES=233, PETRI_TRANSITIONS=200} [2024-06-20 19:10:28,689 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-20 19:10:28,689 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 200 transitions, 1830 flow [2024-06-20 19:10:28,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:28,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:28,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:10:28,690 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-20 19:10:28,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash 693706995, now seen corresponding path program 10 times [2024-06-20 19:10:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684469488] [2024-06-20 19:10:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:28,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:34,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-20 19:10:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684469488] [2024-06-20 19:10:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684469488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:34,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:10:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313685800] [2024-06-20 19:10:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:34,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:10:34,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:34,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:10:34,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:10:35,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:35,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 200 transitions, 1830 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-20 19:10:35,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:35,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:35,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:35,403 INFO L124 PetriNetUnfolderBase]: 470/833 cut-off events. [2024-06-20 19:10:35,403 INFO L125 PetriNetUnfolderBase]: For 80935/80935 co-relation queries the response was YES. [2024-06-20 19:10:35,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5924 conditions, 833 events. 470/833 cut-off events. For 80935/80935 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3884 event pairs, 57 based on Foata normal form. 2/833 useless extension candidates. Maximal degree in co-relation 5809. Up to 788 conditions per place. [2024-06-20 19:10:35,411 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 186 selfloop transitions, 23 changer transitions 0/211 dead transitions. [2024-06-20 19:10:35,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 211 transitions, 2302 flow [2024-06-20 19:10:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-20 19:10:35,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-20 19:10:35,412 INFO L175 Difference]: Start difference. First operand has 233 places, 200 transitions, 1830 flow. Second operand 10 states and 119 transitions. [2024-06-20 19:10:35,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 211 transitions, 2302 flow [2024-06-20 19:10:35,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 211 transitions, 2241 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-20 19:10:35,577 INFO L231 Difference]: Finished difference. Result has 238 places, 201 transitions, 1853 flow [2024-06-20 19:10:35,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1853, PETRI_PLACES=238, PETRI_TRANSITIONS=201} [2024-06-20 19:10:35,578 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-20 19:10:35,578 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 201 transitions, 1853 flow [2024-06-20 19:10:35,578 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-20 19:10:35,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:35,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:35,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:10:35,579 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-20 19:10:35,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1797304508, now seen corresponding path program 13 times [2024-06-20 19:10:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422352159] [2024-06-20 19:10:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:35,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:41,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-20 19:10:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422352159] [2024-06-20 19:10:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422352159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724714618] [2024-06-20 19:10:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:41,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:42,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:42,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 201 transitions, 1853 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:42,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:42,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:42,522 INFO L124 PetriNetUnfolderBase]: 478/846 cut-off events. [2024-06-20 19:10:42,522 INFO L125 PetriNetUnfolderBase]: For 83281/83281 co-relation queries the response was YES. [2024-06-20 19:10:42,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6183 conditions, 846 events. 478/846 cut-off events. For 83281/83281 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3950 event pairs, 55 based on Foata normal form. 1/845 useless extension candidates. Maximal degree in co-relation 6066. Up to 792 conditions per place. [2024-06-20 19:10:42,530 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 29 changer transitions 0/217 dead transitions. [2024-06-20 19:10:42,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 217 transitions, 2588 flow [2024-06-20 19:10:42,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:10:42,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:10:42,531 INFO L175 Difference]: Start difference. First operand has 238 places, 201 transitions, 1853 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:10:42,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 217 transitions, 2588 flow [2024-06-20 19:10:42,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 217 transitions, 2514 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-20 19:10:42,705 INFO L231 Difference]: Finished difference. Result has 241 places, 207 transitions, 1978 flow [2024-06-20 19:10:42,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1978, PETRI_PLACES=241, PETRI_TRANSITIONS=207} [2024-06-20 19:10:42,706 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-20 19:10:42,706 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 207 transitions, 1978 flow [2024-06-20 19:10:42,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:42,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:42,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:42,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:10:42,707 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-20 19:10:42,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -831291947, now seen corresponding path program 11 times [2024-06-20 19:10:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:42,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570631842] [2024-06-20 19:10:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:49,012 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-20 19:10:49,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570631842] [2024-06-20 19:10:49,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570631842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:49,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:49,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:49,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715924616] [2024-06-20 19:10:49,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:49,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:49,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:49,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:49,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:49,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 207 transitions, 1978 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:49,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:49,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:49,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:49,635 INFO L124 PetriNetUnfolderBase]: 482/854 cut-off events. [2024-06-20 19:10:49,636 INFO L125 PetriNetUnfolderBase]: For 89029/89029 co-relation queries the response was YES. [2024-06-20 19:10:49,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 854 events. 482/854 cut-off events. For 89029/89029 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4009 event pairs, 55 based on Foata normal form. 2/854 useless extension candidates. Maximal degree in co-relation 6168. Up to 824 conditions per place. [2024-06-20 19:10:49,643 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 200 selfloop transitions, 16 changer transitions 0/218 dead transitions. [2024-06-20 19:10:49,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 218 transitions, 2466 flow [2024-06-20 19:10:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-20 19:10:49,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:10:49,644 INFO L175 Difference]: Start difference. First operand has 241 places, 207 transitions, 1978 flow. Second operand 10 states and 105 transitions. [2024-06-20 19:10:49,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 218 transitions, 2466 flow [2024-06-20 19:10:49,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 218 transitions, 2371 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-20 19:10:49,848 INFO L231 Difference]: Finished difference. Result has 246 places, 208 transitions, 1955 flow [2024-06-20 19:10:49,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1955, PETRI_PLACES=246, PETRI_TRANSITIONS=208} [2024-06-20 19:10:49,849 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-20 19:10:49,849 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 208 transitions, 1955 flow [2024-06-20 19:10:49,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:49,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:49,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:49,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:10:49,850 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-20 19:10:49,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 693707150, now seen corresponding path program 14 times [2024-06-20 19:10:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708095953] [2024-06-20 19:10:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:56,368 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-20 19:10:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708095953] [2024-06-20 19:10:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708095953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:56,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:56,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101089127] [2024-06-20 19:10:56,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:56,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:56,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:56,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:56,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:56,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 208 transitions, 1955 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:56,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:56,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:56,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:56,969 INFO L124 PetriNetUnfolderBase]: 490/867 cut-off events. [2024-06-20 19:10:56,970 INFO L125 PetriNetUnfolderBase]: For 91411/91411 co-relation queries the response was YES. [2024-06-20 19:10:56,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6510 conditions, 867 events. 490/867 cut-off events. For 91411/91411 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4110 event pairs, 55 based on Foata normal form. 1/866 useless extension candidates. Maximal degree in co-relation 6389. Up to 788 conditions per place. [2024-06-20 19:10:56,979 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 38 changer transitions 0/223 dead transitions. [2024-06-20 19:10:56,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 223 transitions, 2706 flow [2024-06-20 19:10:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 19:10:56,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:10:56,981 INFO L175 Difference]: Start difference. First operand has 246 places, 208 transitions, 1955 flow. Second operand 10 states and 115 transitions. [2024-06-20 19:10:56,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 223 transitions, 2706 flow [2024-06-20 19:10:57,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 223 transitions, 2644 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-20 19:10:57,191 INFO L231 Difference]: Finished difference. Result has 248 places, 213 transitions, 2101 flow [2024-06-20 19:10:57,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2101, PETRI_PLACES=248, PETRI_TRANSITIONS=213} [2024-06-20 19:10:57,192 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-20 19:10:57,192 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 213 transitions, 2101 flow [2024-06-20 19:10:57,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:57,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:57,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:10:57,193 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-20 19:10:57,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 166360256, now seen corresponding path program 15 times [2024-06-20 19:10:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283009145] [2024-06-20 19:10:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:03,092 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-20 19:11:03,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283009145] [2024-06-20 19:11:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283009145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:03,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772451391] [2024-06-20 19:11:03,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:03,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:03,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:03,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 213 transitions, 2101 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:03,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:03,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:03,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:03,588 INFO L124 PetriNetUnfolderBase]: 488/864 cut-off events. [2024-06-20 19:11:03,589 INFO L125 PetriNetUnfolderBase]: For 89812/89812 co-relation queries the response was YES. [2024-06-20 19:11:03,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 864 events. 488/864 cut-off events. For 89812/89812 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4098 event pairs, 55 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 6310. Up to 795 conditions per place. [2024-06-20 19:11:03,598 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 187 selfloop transitions, 33 changer transitions 0/222 dead transitions. [2024-06-20 19:11:03,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 222 transitions, 2561 flow [2024-06-20 19:11:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:11:03,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:11:03,599 INFO L175 Difference]: Start difference. First operand has 248 places, 213 transitions, 2101 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:11:03,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 222 transitions, 2561 flow [2024-06-20 19:11:03,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 222 transitions, 2436 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:03,818 INFO L231 Difference]: Finished difference. Result has 254 places, 213 transitions, 2047 flow [2024-06-20 19:11:03,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2047, PETRI_PLACES=254, PETRI_TRANSITIONS=213} [2024-06-20 19:11:03,819 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2024-06-20 19:11:03,819 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 213 transitions, 2047 flow [2024-06-20 19:11:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:03,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:03,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:03,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:11:03,820 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-20 19:11:03,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 160997876, now seen corresponding path program 16 times [2024-06-20 19:11:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441143854] [2024-06-20 19:11:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:09,739 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-20 19:11:09,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:09,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441143854] [2024-06-20 19:11:09,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441143854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:09,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:09,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850612386] [2024-06-20 19:11:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:09,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:09,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:09,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:09,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:09,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 213 transitions, 2047 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:09,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:09,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:09,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:10,240 INFO L124 PetriNetUnfolderBase]: 491/869 cut-off events. [2024-06-20 19:11:10,240 INFO L125 PetriNetUnfolderBase]: For 91690/91690 co-relation queries the response was YES. [2024-06-20 19:11:10,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6489 conditions, 869 events. 491/869 cut-off events. For 91690/91690 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4125 event pairs, 53 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 6365. Up to 800 conditions per place. [2024-06-20 19:11:10,249 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 37 changer transitions 0/225 dead transitions. [2024-06-20 19:11:10,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 225 transitions, 2586 flow [2024-06-20 19:11:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:11:10,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:11:10,251 INFO L175 Difference]: Start difference. First operand has 254 places, 213 transitions, 2047 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:11:10,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 225 transitions, 2586 flow [2024-06-20 19:11:10,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 225 transitions, 2500 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:11:10,438 INFO L231 Difference]: Finished difference. Result has 255 places, 216 transitions, 2117 flow [2024-06-20 19:11:10,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2117, PETRI_PLACES=255, PETRI_TRANSITIONS=216} [2024-06-20 19:11:10,439 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-20 19:11:10,439 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 216 transitions, 2117 flow [2024-06-20 19:11:10,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:10,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:10,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:10,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:11:10,440 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-20 19:11:10,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -831286212, now seen corresponding path program 17 times [2024-06-20 19:11:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:10,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466075449] [2024-06-20 19:11:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:16,807 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-20 19:11:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:16,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466075449] [2024-06-20 19:11:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466075449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:16,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680620864] [2024-06-20 19:11:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:16,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:16,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 216 transitions, 2117 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:16,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:16,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:16,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:17,367 INFO L124 PetriNetUnfolderBase]: 500/884 cut-off events. [2024-06-20 19:11:17,368 INFO L125 PetriNetUnfolderBase]: For 102105/102105 co-relation queries the response was YES. [2024-06-20 19:11:17,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6702 conditions, 884 events. 500/884 cut-off events. For 102105/102105 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4206 event pairs, 53 based on Foata normal form. 3/885 useless extension candidates. Maximal degree in co-relation 6577. Up to 796 conditions per place. [2024-06-20 19:11:17,377 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 200 selfloop transitions, 32 changer transitions 0/234 dead transitions. [2024-06-20 19:11:17,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 234 transitions, 2725 flow [2024-06-20 19:11:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 19:11:17,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-20 19:11:17,379 INFO L175 Difference]: Start difference. First operand has 255 places, 216 transitions, 2117 flow. Second operand 10 states and 116 transitions. [2024-06-20 19:11:17,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 234 transitions, 2725 flow [2024-06-20 19:11:17,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 234 transitions, 2609 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-20 19:11:17,579 INFO L231 Difference]: Finished difference. Result has 259 places, 220 transitions, 2187 flow [2024-06-20 19:11:17,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2187, PETRI_PLACES=259, PETRI_TRANSITIONS=220} [2024-06-20 19:11:17,580 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-20 19:11:17,580 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 220 transitions, 2187 flow [2024-06-20 19:11:17,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:17,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:17,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:17,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:11:17,581 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-20 19:11:17,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash -831084402, now seen corresponding path program 18 times [2024-06-20 19:11:17,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:17,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772144930] [2024-06-20 19:11:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:24,007 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-20 19:11:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772144930] [2024-06-20 19:11:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772144930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:24,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116021068] [2024-06-20 19:11:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:24,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:24,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:24,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 220 transitions, 2187 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:24,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:24,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:24,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:24,594 INFO L124 PetriNetUnfolderBase]: 504/891 cut-off events. [2024-06-20 19:11:24,595 INFO L125 PetriNetUnfolderBase]: For 101639/101639 co-relation queries the response was YES. [2024-06-20 19:11:24,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 891 events. 504/891 cut-off events. For 101639/101639 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4240 event pairs, 55 based on Foata normal form. 3/892 useless extension candidates. Maximal degree in co-relation 6609. Up to 803 conditions per place. [2024-06-20 19:11:24,604 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 204 selfloop transitions, 30 changer transitions 0/236 dead transitions. [2024-06-20 19:11:24,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 236 transitions, 2761 flow [2024-06-20 19:11:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-20 19:11:24,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-20 19:11:24,606 INFO L175 Difference]: Start difference. First operand has 259 places, 220 transitions, 2187 flow. Second operand 10 states and 117 transitions. [2024-06-20 19:11:24,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 236 transitions, 2761 flow [2024-06-20 19:11:24,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 236 transitions, 2589 flow, removed 57 selfloop flow, removed 8 redundant places. [2024-06-20 19:11:24,800 INFO L231 Difference]: Finished difference. Result has 261 places, 222 transitions, 2155 flow [2024-06-20 19:11:24,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2155, PETRI_PLACES=261, PETRI_TRANSITIONS=222} [2024-06-20 19:11:24,800 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-20 19:11:24,801 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 222 transitions, 2155 flow [2024-06-20 19:11:24,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:24,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:24,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:24,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:11:24,801 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-20 19:11:24,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1719394375, now seen corresponding path program 12 times [2024-06-20 19:11:24,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:24,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125609085] [2024-06-20 19:11:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:31,595 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-20 19:11:31,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125609085] [2024-06-20 19:11:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125609085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:31,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754561882] [2024-06-20 19:11:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:31,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:31,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:31,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:31,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 222 transitions, 2155 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:31,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:31,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:31,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:32,145 INFO L124 PetriNetUnfolderBase]: 508/899 cut-off events. [2024-06-20 19:11:32,146 INFO L125 PetriNetUnfolderBase]: For 99300/99300 co-relation queries the response was YES. [2024-06-20 19:11:32,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6723 conditions, 899 events. 508/899 cut-off events. For 99300/99300 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4309 event pairs, 63 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 6596. Up to 842 conditions per place. [2024-06-20 19:11:32,155 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 200 selfloop transitions, 31 changer transitions 0/233 dead transitions. [2024-06-20 19:11:32,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 233 transitions, 2675 flow [2024-06-20 19:11:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 19:11:32,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-20 19:11:32,157 INFO L175 Difference]: Start difference. First operand has 261 places, 222 transitions, 2155 flow. Second operand 10 states and 109 transitions. [2024-06-20 19:11:32,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 233 transitions, 2675 flow [2024-06-20 19:11:32,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 233 transitions, 2547 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-20 19:11:32,366 INFO L231 Difference]: Finished difference. Result has 263 places, 223 transitions, 2131 flow [2024-06-20 19:11:32,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2131, PETRI_PLACES=263, PETRI_TRANSITIONS=223} [2024-06-20 19:11:32,367 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2024-06-20 19:11:32,367 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 223 transitions, 2131 flow [2024-06-20 19:11:32,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:32,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:32,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:32,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 19:11:32,368 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-20 19:11:32,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 688200620, now seen corresponding path program 19 times [2024-06-20 19:11:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759621738] [2024-06-20 19:11:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:38,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-20 19:11:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759621738] [2024-06-20 19:11:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759621738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678821570] [2024-06-20 19:11:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:38,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:38,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:38,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 223 transitions, 2131 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:38,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:38,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:38,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:39,310 INFO L124 PetriNetUnfolderBase]: 527/930 cut-off events. [2024-06-20 19:11:39,310 INFO L125 PetriNetUnfolderBase]: For 106050/106050 co-relation queries the response was YES. [2024-06-20 19:11:39,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7126 conditions, 930 events. 527/930 cut-off events. For 106050/106050 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4463 event pairs, 49 based on Foata normal form. 1/929 useless extension candidates. Maximal degree in co-relation 6998. Up to 692 conditions per place. [2024-06-20 19:11:39,320 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 165 selfloop transitions, 80 changer transitions 0/247 dead transitions. [2024-06-20 19:11:39,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 247 transitions, 3015 flow [2024-06-20 19:11:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:11:39,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-20 19:11:39,321 INFO L175 Difference]: Start difference. First operand has 263 places, 223 transitions, 2131 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:11:39,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 247 transitions, 3015 flow [2024-06-20 19:11:39,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 247 transitions, 2921 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-20 19:11:39,555 INFO L231 Difference]: Finished difference. Result has 269 places, 234 transitions, 2513 flow [2024-06-20 19:11:39,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2513, PETRI_PLACES=269, PETRI_TRANSITIONS=234} [2024-06-20 19:11:39,556 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2024-06-20 19:11:39,556 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 234 transitions, 2513 flow [2024-06-20 19:11:39,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:39,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:39,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:39,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 19:11:39,557 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-20 19:11:39,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 688196745, now seen corresponding path program 13 times [2024-06-20 19:11:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140033345] [2024-06-20 19:11:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:46,873 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-20 19:11:46,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140033345] [2024-06-20 19:11:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140033345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474445528] [2024-06-20 19:11:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:46,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:47,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:47,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 234 transitions, 2513 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:47,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:47,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:47,369 INFO L124 PetriNetUnfolderBase]: 531/938 cut-off events. [2024-06-20 19:11:47,369 INFO L125 PetriNetUnfolderBase]: For 113288/113288 co-relation queries the response was YES. [2024-06-20 19:11:47,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7582 conditions, 938 events. 531/938 cut-off events. For 113288/113288 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4509 event pairs, 60 based on Foata normal form. 2/938 useless extension candidates. Maximal degree in co-relation 7449. Up to 846 conditions per place. [2024-06-20 19:11:47,380 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 210 selfloop transitions, 35 changer transitions 0/247 dead transitions. [2024-06-20 19:11:47,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 247 transitions, 3245 flow [2024-06-20 19:11:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:11:47,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:11:47,381 INFO L175 Difference]: Start difference. First operand has 269 places, 234 transitions, 2513 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:11:47,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 247 transitions, 3245 flow [2024-06-20 19:11:47,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 247 transitions, 3136 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-20 19:11:47,661 INFO L231 Difference]: Finished difference. Result has 276 places, 235 transitions, 2516 flow [2024-06-20 19:11:47,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2516, PETRI_PLACES=276, PETRI_TRANSITIONS=235} [2024-06-20 19:11:47,662 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places. [2024-06-20 19:11:47,662 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 235 transitions, 2516 flow [2024-06-20 19:11:47,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:47,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:47,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:47,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 19:11:47,662 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-20 19:11:47,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 160992296, now seen corresponding path program 20 times [2024-06-20 19:11:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:47,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505834497] [2024-06-20 19:11:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:54,207 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-20 19:11:54,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505834497] [2024-06-20 19:11:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505834497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:54,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:54,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:11:54,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398592906] [2024-06-20 19:11:54,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:54,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:11:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:11:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:11:54,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:54,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 235 transitions, 2516 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:54,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:54,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:54,780 INFO L124 PetriNetUnfolderBase]: 529/935 cut-off events. [2024-06-20 19:11:54,780 INFO L125 PetriNetUnfolderBase]: For 105717/105717 co-relation queries the response was YES. [2024-06-20 19:11:54,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 935 events. 529/935 cut-off events. For 105717/105717 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4509 event pairs, 62 based on Foata normal form. 1/934 useless extension candidates. Maximal degree in co-relation 7262. Up to 860 conditions per place. [2024-06-20 19:11:54,790 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 203 selfloop transitions, 40 changer transitions 0/245 dead transitions. [2024-06-20 19:11:54,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 245 transitions, 3063 flow [2024-06-20 19:11:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:11:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:11:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:11:54,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:11:54,791 INFO L175 Difference]: Start difference. First operand has 276 places, 235 transitions, 2516 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:11:54,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 245 transitions, 3063 flow [2024-06-20 19:11:55,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 245 transitions, 2945 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-20 19:11:55,059 INFO L231 Difference]: Finished difference. Result has 278 places, 236 transitions, 2526 flow [2024-06-20 19:11:55,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2526, PETRI_PLACES=278, PETRI_TRANSITIONS=236} [2024-06-20 19:11:55,059 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2024-06-20 19:11:55,059 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 236 transitions, 2526 flow [2024-06-20 19:11:55,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:55,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:55,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:55,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 19:11:55,060 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-20 19:11:55,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash 688344615, now seen corresponding path program 14 times [2024-06-20 19:11:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069269206] [2024-06-20 19:11:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:01,343 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-20 19:12:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069269206] [2024-06-20 19:12:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069269206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:01,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:01,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:12:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092629863] [2024-06-20 19:12:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:12:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:12:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:12:01,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:12:01,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 236 transitions, 2526 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-20 19:12:01,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:01,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:12:01,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:01,966 INFO L124 PetriNetUnfolderBase]: 526/930 cut-off events. [2024-06-20 19:12:01,966 INFO L125 PetriNetUnfolderBase]: For 103093/103093 co-relation queries the response was YES. [2024-06-20 19:12:01,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7085 conditions, 930 events. 526/930 cut-off events. For 103093/103093 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4466 event pairs, 57 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 6950. Up to 885 conditions per place. [2024-06-20 19:12:01,976 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 220 selfloop transitions, 24 changer transitions 0/246 dead transitions. [2024-06-20 19:12:01,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 3036 flow [2024-06-20 19:12:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:12:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:12:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:12:01,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-20 19:12:01,977 INFO L175 Difference]: Start difference. First operand has 278 places, 236 transitions, 2526 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:12:01,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 246 transitions, 3036 flow [2024-06-20 19:12:02,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 246 transitions, 2848 flow, removed 38 selfloop flow, removed 10 redundant places. [2024-06-20 19:12:02,214 INFO L231 Difference]: Finished difference. Result has 278 places, 236 transitions, 2390 flow [2024-06-20 19:12:02,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2390, PETRI_PLACES=278, PETRI_TRANSITIONS=236} [2024-06-20 19:12:02,215 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2024-06-20 19:12:02,215 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 236 transitions, 2390 flow [2024-06-20 19:12:02,215 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-20 19:12:02,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:02,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:02,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 19:12:02,216 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-20 19:12:02,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash 152235012, now seen corresponding path program 1 times [2024-06-20 19:12:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:02,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041228135] [2024-06-20 19:12:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:09,688 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-20 19:12:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041228135] [2024-06-20 19:12:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041228135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:09,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288186370] [2024-06-20 19:12:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:09,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:09,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:09,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:12:09,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 236 transitions, 2390 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:09,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:09,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:12:09,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:10,517 INFO L124 PetriNetUnfolderBase]: 566/1010 cut-off events. [2024-06-20 19:12:10,518 INFO L125 PetriNetUnfolderBase]: For 153768/153768 co-relation queries the response was YES. [2024-06-20 19:12:10,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8437 conditions, 1010 events. 566/1010 cut-off events. For 153768/153768 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4942 event pairs, 51 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 8303. Up to 725 conditions per place. [2024-06-20 19:12:10,531 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 229 selfloop transitions, 38 changer transitions 0/269 dead transitions. [2024-06-20 19:12:10,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 269 transitions, 3480 flow [2024-06-20 19:12:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-20 19:12:10,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40053763440860213 [2024-06-20 19:12:10,532 INFO L175 Difference]: Start difference. First operand has 278 places, 236 transitions, 2390 flow. Second operand 12 states and 149 transitions. [2024-06-20 19:12:10,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 269 transitions, 3480 flow [2024-06-20 19:12:11,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 269 transitions, 3368 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:12:11,005 INFO L231 Difference]: Finished difference. Result has 280 places, 238 transitions, 2400 flow [2024-06-20 19:12:11,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2278, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2400, PETRI_PLACES=280, PETRI_TRANSITIONS=238} [2024-06-20 19:12:11,005 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places. [2024-06-20 19:12:11,005 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 238 transitions, 2400 flow [2024-06-20 19:12:11,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:11,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:11,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:11,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 19:12:11,006 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-20 19:12:11,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 82156120, now seen corresponding path program 2 times [2024-06-20 19:12:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852443630] [2024-06-20 19:12:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:18,478 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-20 19:12:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852443630] [2024-06-20 19:12:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852443630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687332435] [2024-06-20 19:12:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:18,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:18,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:12:18,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 238 transitions, 2400 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:18,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:18,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:12:18,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:19,338 INFO L124 PetriNetUnfolderBase]: 577/1031 cut-off events. [2024-06-20 19:12:19,338 INFO L125 PetriNetUnfolderBase]: For 164928/164928 co-relation queries the response was YES. [2024-06-20 19:12:19,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8801 conditions, 1031 events. 577/1031 cut-off events. For 164928/164928 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5126 event pairs, 80 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 8666. Up to 931 conditions per place. [2024-06-20 19:12:19,347 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 225 selfloop transitions, 35 changer transitions 0/262 dead transitions. [2024-06-20 19:12:19,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 262 transitions, 3210 flow [2024-06-20 19:12:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-20 19:12:19,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:12:19,350 INFO L175 Difference]: Start difference. First operand has 280 places, 238 transitions, 2400 flow. Second operand 12 states and 140 transitions. [2024-06-20 19:12:19,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 262 transitions, 3210 flow [2024-06-20 19:12:19,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 262 transitions, 3137 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:12:19,753 INFO L231 Difference]: Finished difference. Result has 284 places, 240 transitions, 2447 flow [2024-06-20 19:12:19,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2331, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2447, PETRI_PLACES=284, PETRI_TRANSITIONS=240} [2024-06-20 19:12:19,754 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2024-06-20 19:12:19,754 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 240 transitions, 2447 flow [2024-06-20 19:12:19,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:19,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:19,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:19,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 19:12:19,755 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-20 19:12:19,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash 210447432, now seen corresponding path program 3 times [2024-06-20 19:12:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:19,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496048689] [2024-06-20 19:12:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:27,469 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-20 19:12:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496048689] [2024-06-20 19:12:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496048689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909788625] [2024-06-20 19:12:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:27,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:27,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:12:27,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 240 transitions, 2447 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:27,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:27,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:12:27,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:28,188 INFO L124 PetriNetUnfolderBase]: 574/1026 cut-off events. [2024-06-20 19:12:28,188 INFO L125 PetriNetUnfolderBase]: For 161801/161801 co-relation queries the response was YES. [2024-06-20 19:12:28,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 1026 events. 574/1026 cut-off events. For 161801/161801 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5084 event pairs, 73 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 8487. Up to 926 conditions per place. [2024-06-20 19:12:28,200 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 224 selfloop transitions, 37 changer transitions 0/263 dead transitions. [2024-06-20 19:12:28,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 263 transitions, 3223 flow [2024-06-20 19:12:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-20 19:12:28,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-20 19:12:28,201 INFO L175 Difference]: Start difference. First operand has 284 places, 240 transitions, 2447 flow. Second operand 12 states and 142 transitions. [2024-06-20 19:12:28,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 263 transitions, 3223 flow [2024-06-20 19:12:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 263 transitions, 3146 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-20 19:12:28,685 INFO L231 Difference]: Finished difference. Result has 288 places, 240 transitions, 2448 flow [2024-06-20 19:12:28,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2448, PETRI_PLACES=288, PETRI_TRANSITIONS=240} [2024-06-20 19:12:28,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 258 predicate places. [2024-06-20 19:12:28,685 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 240 transitions, 2448 flow [2024-06-20 19:12:28,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:28,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:28,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:28,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 19:12:28,686 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-20 19:12:28,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 210327462, now seen corresponding path program 4 times [2024-06-20 19:12:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28687196] [2024-06-20 19:12:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:36,265 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-20 19:12:36,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:36,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28687196] [2024-06-20 19:12:36,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28687196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:36,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:36,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920680068] [2024-06-20 19:12:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:36,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:36,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:36,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:36,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:12:36,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 240 transitions, 2448 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:36,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:36,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:12:36,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:37,094 INFO L124 PetriNetUnfolderBase]: 578/1034 cut-off events. [2024-06-20 19:12:37,095 INFO L125 PetriNetUnfolderBase]: For 165052/165052 co-relation queries the response was YES. [2024-06-20 19:12:37,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8714 conditions, 1034 events. 578/1034 cut-off events. For 165052/165052 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5145 event pairs, 69 based on Foata normal form. 2/1034 useless extension candidates. Maximal degree in co-relation 8575. Up to 898 conditions per place. [2024-06-20 19:12:37,107 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 225 selfloop transitions, 39 changer transitions 0/266 dead transitions. [2024-06-20 19:12:37,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 266 transitions, 3258 flow [2024-06-20 19:12:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2024-06-20 19:12:37,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2024-06-20 19:12:37,109 INFO L175 Difference]: Start difference. First operand has 288 places, 240 transitions, 2448 flow. Second operand 12 states and 146 transitions. [2024-06-20 19:12:37,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 266 transitions, 3258 flow [2024-06-20 19:12:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 266 transitions, 3200 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:12:37,558 INFO L231 Difference]: Finished difference. Result has 290 places, 241 transitions, 2496 flow [2024-06-20 19:12:37,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2496, PETRI_PLACES=290, PETRI_TRANSITIONS=241} [2024-06-20 19:12:37,559 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2024-06-20 19:12:37,559 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 241 transitions, 2496 flow [2024-06-20 19:12:37,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:37,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:37,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:37,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 19:12:37,559 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-20 19:12:37,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 210447618, now seen corresponding path program 1 times [2024-06-20 19:12:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:37,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675056582] [2024-06-20 19:12:37,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:44,099 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-20 19:12:44,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:44,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675056582] [2024-06-20 19:12:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675056582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:44,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:44,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687002945] [2024-06-20 19:12:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:44,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:44,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:12:44,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 241 transitions, 2496 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:44,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:44,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:12:44,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:44,790 INFO L124 PetriNetUnfolderBase]: 594/1060 cut-off events. [2024-06-20 19:12:44,791 INFO L125 PetriNetUnfolderBase]: For 179844/179844 co-relation queries the response was YES. [2024-06-20 19:12:44,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 1060 events. 594/1060 cut-off events. For 179844/179844 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5315 event pairs, 65 based on Foata normal form. 2/1060 useless extension candidates. Maximal degree in co-relation 9153. Up to 947 conditions per place. [2024-06-20 19:12:44,802 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 229 selfloop transitions, 37 changer transitions 0/268 dead transitions. [2024-06-20 19:12:44,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 268 transitions, 3424 flow [2024-06-20 19:12:44,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:12:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:12:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-20 19:12:44,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-20 19:12:44,804 INFO L175 Difference]: Start difference. First operand has 290 places, 241 transitions, 2496 flow. Second operand 12 states and 143 transitions. [2024-06-20 19:12:44,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 268 transitions, 3424 flow [2024-06-20 19:12:45,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 268 transitions, 3330 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-20 19:12:45,236 INFO L231 Difference]: Finished difference. Result has 292 places, 245 transitions, 2621 flow [2024-06-20 19:12:45,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2402, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2621, PETRI_PLACES=292, PETRI_TRANSITIONS=245} [2024-06-20 19:12:45,237 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 262 predicate places. [2024-06-20 19:12:45,237 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 245 transitions, 2621 flow [2024-06-20 19:12:45,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:45,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:45,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:45,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 19:12:45,238 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-20 19:12:45,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1520712090, now seen corresponding path program 2 times [2024-06-20 19:12:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79034460] [2024-06-20 19:12:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:53,086 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-20 19:12:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:53,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79034460] [2024-06-20 19:12:53,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79034460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:53,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:53,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:12:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637013772] [2024-06-20 19:12:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:53,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:12:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:12:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:12:53,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:12:53,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 245 transitions, 2621 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:53,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:53,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:12:53,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:53,875 INFO L124 PetriNetUnfolderBase]: 590/1054 cut-off events. [2024-06-20 19:12:53,875 INFO L125 PetriNetUnfolderBase]: For 173710/173710 co-relation queries the response was YES. [2024-06-20 19:12:53,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9088 conditions, 1054 events. 590/1054 cut-off events. For 173710/173710 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5274 event pairs, 75 based on Foata normal form. 2/1054 useless extension candidates. Maximal degree in co-relation 8947. Up to 999 conditions per place. [2024-06-20 19:12:53,887 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 238 selfloop transitions, 22 changer transitions 0/262 dead transitions. [2024-06-20 19:12:53,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 262 transitions, 3189 flow [2024-06-20 19:12:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:12:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:12:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:12:53,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:12:53,888 INFO L175 Difference]: Start difference. First operand has 292 places, 245 transitions, 2621 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:12:53,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 262 transitions, 3189 flow [2024-06-20 19:12:54,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 262 transitions, 3054 flow, removed 51 selfloop flow, removed 8 redundant places. [2024-06-20 19:12:54,374 INFO L231 Difference]: Finished difference. Result has 295 places, 245 transitions, 2535 flow [2024-06-20 19:12:54,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2535, PETRI_PLACES=295, PETRI_TRANSITIONS=245} [2024-06-20 19:12:54,374 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-20 19:12:54,375 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 245 transitions, 2535 flow [2024-06-20 19:12:54,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:54,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:54,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:54,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 19:12:54,375 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-20 19:12:54,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:54,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1525365066, now seen corresponding path program 5 times [2024-06-20 19:12:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187097828] [2024-06-20 19:12:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:01,605 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-20 19:13:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187097828] [2024-06-20 19:13:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187097828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483597512] [2024-06-20 19:13:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:01,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:01,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:01,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:01,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 245 transitions, 2535 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:01,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:01,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:01,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:02,310 INFO L124 PetriNetUnfolderBase]: 601/1075 cut-off events. [2024-06-20 19:13:02,310 INFO L125 PetriNetUnfolderBase]: For 186839/186839 co-relation queries the response was YES. [2024-06-20 19:13:02,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 1075 events. 601/1075 cut-off events. For 186839/186839 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5411 event pairs, 78 based on Foata normal form. 2/1075 useless extension candidates. Maximal degree in co-relation 9172. Up to 993 conditions per place. [2024-06-20 19:13:02,323 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 234 selfloop transitions, 29 changer transitions 0/265 dead transitions. [2024-06-20 19:13:02,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 265 transitions, 3351 flow [2024-06-20 19:13:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:13:02,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:13:02,325 INFO L175 Difference]: Start difference. First operand has 295 places, 245 transitions, 2535 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:13:02,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 265 transitions, 3351 flow [2024-06-20 19:13:02,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 265 transitions, 3236 flow, removed 4 selfloop flow, removed 13 redundant places. [2024-06-20 19:13:02,879 INFO L231 Difference]: Finished difference. Result has 293 places, 247 transitions, 2532 flow [2024-06-20 19:13:02,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2532, PETRI_PLACES=293, PETRI_TRANSITIONS=247} [2024-06-20 19:13:02,879 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 263 predicate places. [2024-06-20 19:13:02,879 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 247 transitions, 2532 flow [2024-06-20 19:13:02,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:02,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:02,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:02,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 19:13:02,880 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-20 19:13:02,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1392431938, now seen corresponding path program 3 times [2024-06-20 19:13:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905926028] [2024-06-20 19:13:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:09,532 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-20 19:13:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905926028] [2024-06-20 19:13:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905926028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830184] [2024-06-20 19:13:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:09,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:09,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:09,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 247 transitions, 2532 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:09,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:09,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:09,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:10,244 INFO L124 PetriNetUnfolderBase]: 607/1085 cut-off events. [2024-06-20 19:13:10,245 INFO L125 PetriNetUnfolderBase]: For 191632/191632 co-relation queries the response was YES. [2024-06-20 19:13:10,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9384 conditions, 1085 events. 607/1085 cut-off events. For 191632/191632 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5458 event pairs, 76 based on Foata normal form. 2/1085 useless extension candidates. Maximal degree in co-relation 9242. Up to 1021 conditions per place. [2024-06-20 19:13:10,257 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 240 selfloop transitions, 25 changer transitions 0/267 dead transitions. [2024-06-20 19:13:10,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 267 transitions, 3170 flow [2024-06-20 19:13:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:13:10,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-20 19:13:10,258 INFO L175 Difference]: Start difference. First operand has 293 places, 247 transitions, 2532 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:13:10,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 267 transitions, 3170 flow [2024-06-20 19:13:10,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 267 transitions, 3101 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:10,782 INFO L231 Difference]: Finished difference. Result has 297 places, 249 transitions, 2578 flow [2024-06-20 19:13:10,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2463, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2578, PETRI_PLACES=297, PETRI_TRANSITIONS=249} [2024-06-20 19:13:10,782 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2024-06-20 19:13:10,782 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 249 transitions, 2578 flow [2024-06-20 19:13:10,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:10,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:10,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:10,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 19:13:10,783 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-20 19:13:10,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1392432124, now seen corresponding path program 6 times [2024-06-20 19:13:10,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183051568] [2024-06-20 19:13:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:17,371 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-20 19:13:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183051568] [2024-06-20 19:13:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183051568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:17,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65938216] [2024-06-20 19:13:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:17,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:17,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:17,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:17,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:17,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 249 transitions, 2578 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:17,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:17,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:17,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:17,991 INFO L124 PetriNetUnfolderBase]: 611/1093 cut-off events. [2024-06-20 19:13:17,991 INFO L125 PetriNetUnfolderBase]: For 195125/195125 co-relation queries the response was YES. [2024-06-20 19:13:18,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9460 conditions, 1093 events. 611/1093 cut-off events. For 195125/195125 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5525 event pairs, 82 based on Foata normal form. 2/1093 useless extension candidates. Maximal degree in co-relation 9316. Up to 1043 conditions per place. [2024-06-20 19:13:18,004 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 243 selfloop transitions, 21 changer transitions 0/266 dead transitions. [2024-06-20 19:13:18,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 266 transitions, 3174 flow [2024-06-20 19:13:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:13:18,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-20 19:13:18,006 INFO L175 Difference]: Start difference. First operand has 297 places, 249 transitions, 2578 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:13:18,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 266 transitions, 3174 flow [2024-06-20 19:13:18,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 266 transitions, 3079 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-20 19:13:18,506 INFO L231 Difference]: Finished difference. Result has 299 places, 250 transitions, 2557 flow [2024-06-20 19:13:18,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2483, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2557, PETRI_PLACES=299, PETRI_TRANSITIONS=250} [2024-06-20 19:13:18,506 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-20 19:13:18,506 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 250 transitions, 2557 flow [2024-06-20 19:13:18,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:18,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:18,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 19:13:18,507 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-20 19:13:18,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1397193724, now seen corresponding path program 7 times [2024-06-20 19:13:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840889277] [2024-06-20 19:13:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:25,484 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-20 19:13:25,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840889277] [2024-06-20 19:13:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840889277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:25,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276983694] [2024-06-20 19:13:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:25,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:25,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:25,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:25,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 250 transitions, 2557 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:25,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:25,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:25,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:26,278 INFO L124 PetriNetUnfolderBase]: 615/1101 cut-off events. [2024-06-20 19:13:26,279 INFO L125 PetriNetUnfolderBase]: For 198493/198493 co-relation queries the response was YES. [2024-06-20 19:13:26,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9485 conditions, 1101 events. 615/1101 cut-off events. For 198493/198493 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5580 event pairs, 80 based on Foata normal form. 2/1101 useless extension candidates. Maximal degree in co-relation 9340. Up to 972 conditions per place. [2024-06-20 19:13:26,293 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 236 selfloop transitions, 32 changer transitions 0/270 dead transitions. [2024-06-20 19:13:26,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 270 transitions, 3371 flow [2024-06-20 19:13:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:13:26,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:13:26,294 INFO L175 Difference]: Start difference. First operand has 299 places, 250 transitions, 2557 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:13:26,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 270 transitions, 3371 flow [2024-06-20 19:13:26,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 270 transitions, 3309 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-20 19:13:26,799 INFO L231 Difference]: Finished difference. Result has 301 places, 251 transitions, 2591 flow [2024-06-20 19:13:26,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2495, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2591, PETRI_PLACES=301, PETRI_TRANSITIONS=251} [2024-06-20 19:13:26,800 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-20 19:13:26,800 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 251 transitions, 2591 flow [2024-06-20 19:13:26,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:26,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:26,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:26,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 19:13:26,800 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-20 19:13:26,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1629001410, now seen corresponding path program 8 times [2024-06-20 19:13:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553154698] [2024-06-20 19:13:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:34,374 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-20 19:13:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553154698] [2024-06-20 19:13:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553154698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:34,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:34,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:34,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633418248] [2024-06-20 19:13:34,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:34,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:34,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:34,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:34,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:34,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 251 transitions, 2591 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:34,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:34,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:34,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:35,133 INFO L124 PetriNetUnfolderBase]: 612/1096 cut-off events. [2024-06-20 19:13:35,134 INFO L125 PetriNetUnfolderBase]: For 191901/191901 co-relation queries the response was YES. [2024-06-20 19:13:35,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9292 conditions, 1096 events. 612/1096 cut-off events. For 191901/191901 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5547 event pairs, 83 based on Foata normal form. 2/1096 useless extension candidates. Maximal degree in co-relation 9146. Up to 1031 conditions per place. [2024-06-20 19:13:35,147 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 237 selfloop transitions, 28 changer transitions 0/267 dead transitions. [2024-06-20 19:13:35,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 267 transitions, 3163 flow [2024-06-20 19:13:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-20 19:13:35,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:13:35,148 INFO L175 Difference]: Start difference. First operand has 301 places, 251 transitions, 2591 flow. Second operand 11 states and 124 transitions. [2024-06-20 19:13:35,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 267 transitions, 3163 flow [2024-06-20 19:13:35,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 267 transitions, 3028 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-20 19:13:35,721 INFO L231 Difference]: Finished difference. Result has 302 places, 251 transitions, 2516 flow [2024-06-20 19:13:35,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2516, PETRI_PLACES=302, PETRI_TRANSITIONS=251} [2024-06-20 19:13:35,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-20 19:13:35,722 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 251 transitions, 2516 flow [2024-06-20 19:13:35,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:35,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:35,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:35,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 19:13:35,723 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-20 19:13:35,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1629001596, now seen corresponding path program 4 times [2024-06-20 19:13:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:35,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629802454] [2024-06-20 19:13:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:35,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:42,508 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-20 19:13:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629802454] [2024-06-20 19:13:42,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629802454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:42,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:42,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941405350] [2024-06-20 19:13:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:42,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:42,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:42,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 251 transitions, 2516 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:42,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:42,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:42,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:43,321 INFO L124 PetriNetUnfolderBase]: 618/1106 cut-off events. [2024-06-20 19:13:43,321 INFO L125 PetriNetUnfolderBase]: For 195658/195658 co-relation queries the response was YES. [2024-06-20 19:13:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 1106 events. 618/1106 cut-off events. For 195658/195658 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5614 event pairs, 79 based on Foata normal form. 2/1106 useless extension candidates. Maximal degree in co-relation 9122. Up to 1012 conditions per place. [2024-06-20 19:13:43,334 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 236 selfloop transitions, 34 changer transitions 0/272 dead transitions. [2024-06-20 19:13:43,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 272 transitions, 3376 flow [2024-06-20 19:13:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 19:13:43,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-20 19:13:43,336 INFO L175 Difference]: Start difference. First operand has 302 places, 251 transitions, 2516 flow. Second operand 11 states and 130 transitions. [2024-06-20 19:13:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 272 transitions, 3376 flow [2024-06-20 19:13:44,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 272 transitions, 3318 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:13:44,025 INFO L231 Difference]: Finished difference. Result has 303 places, 253 transitions, 2591 flow [2024-06-20 19:13:44,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2591, PETRI_PLACES=303, PETRI_TRANSITIONS=253} [2024-06-20 19:13:44,040 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 273 predicate places. [2024-06-20 19:13:44,040 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 253 transitions, 2591 flow [2024-06-20 19:13:44,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:44,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:44,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-20 19:13:44,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 19:13:44,041 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-20 19:13:44,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1392609754, now seen corresponding path program 9 times [2024-06-20 19:13:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090036733] [2024-06-20 19:13:44,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:51,542 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-20 19:13:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090036733] [2024-06-20 19:13:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090036733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217313856] [2024-06-20 19:13:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:13:51,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 253 transitions, 2591 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:52,433 INFO L124 PetriNetUnfolderBase]: 622/1114 cut-off events. [2024-06-20 19:13:52,433 INFO L125 PetriNetUnfolderBase]: For 199548/199548 co-relation queries the response was YES. [2024-06-20 19:13:52,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 1114 events. 622/1114 cut-off events. For 199548/199548 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5688 event pairs, 81 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 9231. Up to 1035 conditions per place. [2024-06-20 19:13:52,447 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 26 changer transitions 0/272 dead transitions. [2024-06-20 19:13:52,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 272 transitions, 3403 flow [2024-06-20 19:13:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:13:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:13:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-20 19:13:52,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:13:52,448 INFO L175 Difference]: Start difference. First operand has 303 places, 253 transitions, 2591 flow. Second operand 11 states and 124 transitions. [2024-06-20 19:13:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 272 transitions, 3403 flow [2024-06-20 19:13:53,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 272 transitions, 3280 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-20 19:13:53,067 INFO L231 Difference]: Finished difference. Result has 305 places, 254 transitions, 2542 flow [2024-06-20 19:13:53,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2468, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2542, PETRI_PLACES=305, PETRI_TRANSITIONS=254} [2024-06-20 19:13:53,068 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-20 19:13:53,068 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 254 transitions, 2542 flow [2024-06-20 19:13:53,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:53,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:53,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:53,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 19:13:53,068 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-20 19:13:53,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2028621698, now seen corresponding path program 5 times [2024-06-20 19:13:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816229026] [2024-06-20 19:13:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:59,962 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-20 19:13:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816229026] [2024-06-20 19:13:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816229026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:13:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079813191] [2024-06-20 19:13:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:59,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:13:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:13:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:00,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:00,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 254 transitions, 2542 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:00,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:00,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:00,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:00,772 INFO L124 PetriNetUnfolderBase]: 618/1108 cut-off events. [2024-06-20 19:14:00,772 INFO L125 PetriNetUnfolderBase]: For 191554/191554 co-relation queries the response was YES. [2024-06-20 19:14:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9040 conditions, 1108 events. 618/1108 cut-off events. For 191554/191554 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5650 event pairs, 78 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 8892. Up to 1032 conditions per place. [2024-06-20 19:14:00,782 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 241 selfloop transitions, 29 changer transitions 0/272 dead transitions. [2024-06-20 19:14:00,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 272 transitions, 3134 flow [2024-06-20 19:14:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:14:00,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:14:00,788 INFO L175 Difference]: Start difference. First operand has 305 places, 254 transitions, 2542 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:14:00,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 272 transitions, 3134 flow [2024-06-20 19:14:01,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 272 transitions, 3003 flow, removed 30 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:01,318 INFO L231 Difference]: Finished difference. Result has 306 places, 254 transitions, 2474 flow [2024-06-20 19:14:01,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=295, 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=2474, PETRI_PLACES=306, PETRI_TRANSITIONS=254} [2024-06-20 19:14:01,318 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-20 19:14:01,319 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 254 transitions, 2474 flow [2024-06-20 19:14:01,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:01,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:01,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:01,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-20 19:14:01,319 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-20 19:14:01,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1392605104, now seen corresponding path program 10 times [2024-06-20 19:14:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600515472] [2024-06-20 19:14:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:08,507 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-20 19:14:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600515472] [2024-06-20 19:14:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600515472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:08,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720479717] [2024-06-20 19:14:08,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:08,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:08,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:08,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:08,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 254 transitions, 2474 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:08,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:08,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:08,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:09,279 INFO L124 PetriNetUnfolderBase]: 615/1103 cut-off events. [2024-06-20 19:14:09,279 INFO L125 PetriNetUnfolderBase]: For 182927/182927 co-relation queries the response was YES. [2024-06-20 19:14:09,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 1103 events. 615/1103 cut-off events. For 182927/182927 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5617 event pairs, 81 based on Foata normal form. 2/1103 useless extension candidates. Maximal degree in co-relation 8553. Up to 1047 conditions per place. [2024-06-20 19:14:09,289 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 24 changer transitions 0/270 dead transitions. [2024-06-20 19:14:09,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 270 transitions, 3052 flow [2024-06-20 19:14:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:14:09,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:14:09,291 INFO L175 Difference]: Start difference. First operand has 306 places, 254 transitions, 2474 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:14:09,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 270 transitions, 3052 flow [2024-06-20 19:14:09,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 270 transitions, 2943 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-06-20 19:14:09,803 INFO L231 Difference]: Finished difference. Result has 306 places, 254 transitions, 2417 flow [2024-06-20 19:14:09,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2365, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2417, PETRI_PLACES=306, PETRI_TRANSITIONS=254} [2024-06-20 19:14:09,804 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-20 19:14:09,804 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 254 transitions, 2417 flow [2024-06-20 19:14:09,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:09,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:09,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:09,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-20 19:14:09,804 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-20 19:14:09,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2100533670, now seen corresponding path program 11 times [2024-06-20 19:14:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465470137] [2024-06-20 19:14:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:16,855 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-20 19:14:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465470137] [2024-06-20 19:14:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465470137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:16,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648063692] [2024-06-20 19:14:16,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:16,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:16,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:16,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:16,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:17,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:17,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 254 transitions, 2417 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:17,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:17,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:17,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:17,482 INFO L124 PetriNetUnfolderBase]: 619/1111 cut-off events. [2024-06-20 19:14:17,482 INFO L125 PetriNetUnfolderBase]: For 186207/186207 co-relation queries the response was YES. [2024-06-20 19:14:17,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8686 conditions, 1111 events. 619/1111 cut-off events. For 186207/186207 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5679 event pairs, 86 based on Foata normal form. 2/1111 useless extension candidates. Maximal degree in co-relation 8538. Up to 970 conditions per place. [2024-06-20 19:14:17,495 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 213 selfloop transitions, 54 changer transitions 0/269 dead transitions. [2024-06-20 19:14:17,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 269 transitions, 3007 flow [2024-06-20 19:14:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 19:14:17,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-20 19:14:17,496 INFO L175 Difference]: Start difference. First operand has 306 places, 254 transitions, 2417 flow. Second operand 11 states and 128 transitions. [2024-06-20 19:14:17,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 269 transitions, 3007 flow [2024-06-20 19:14:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 269 transitions, 2953 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:18,117 INFO L231 Difference]: Finished difference. Result has 307 places, 255 transitions, 2497 flow [2024-06-20 19:14:18,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2497, PETRI_PLACES=307, PETRI_TRANSITIONS=255} [2024-06-20 19:14:18,118 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 277 predicate places. [2024-06-20 19:14:18,118 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 255 transitions, 2497 flow [2024-06-20 19:14:18,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:18,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:18,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:18,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-20 19:14:18,118 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:18,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1799282360, now seen corresponding path program 6 times [2024-06-20 19:14:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977124214] [2024-06-20 19:14:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:24,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-20 19:14:24,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977124214] [2024-06-20 19:14:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977124214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:24,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:24,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301823506] [2024-06-20 19:14:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:24,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:24,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:25,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:25,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 255 transitions, 2497 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:25,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:25,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:25,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:25,687 INFO L124 PetriNetUnfolderBase]: 625/1121 cut-off events. [2024-06-20 19:14:25,687 INFO L125 PetriNetUnfolderBase]: For 190741/190741 co-relation queries the response was YES. [2024-06-20 19:14:25,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8907 conditions, 1121 events. 625/1121 cut-off events. For 190741/190741 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5752 event pairs, 69 based on Foata normal form. 2/1121 useless extension candidates. Maximal degree in co-relation 8758. Up to 846 conditions per place. [2024-06-20 19:14:25,700 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 197 selfloop transitions, 77 changer transitions 0/276 dead transitions. [2024-06-20 19:14:25,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 276 transitions, 3173 flow [2024-06-20 19:14:25,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-20 19:14:25,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41348973607038125 [2024-06-20 19:14:25,702 INFO L175 Difference]: Start difference. First operand has 307 places, 255 transitions, 2497 flow. Second operand 11 states and 141 transitions. [2024-06-20 19:14:25,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 276 transitions, 3173 flow [2024-06-20 19:14:26,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 276 transitions, 3039 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:14:26,283 INFO L231 Difference]: Finished difference. Result has 309 places, 257 transitions, 2596 flow [2024-06-20 19:14:26,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2596, PETRI_PLACES=309, PETRI_TRANSITIONS=257} [2024-06-20 19:14:26,283 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 279 predicate places. [2024-06-20 19:14:26,283 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 257 transitions, 2596 flow [2024-06-20 19:14:26,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:26,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:26,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:26,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-20 19:14:26,284 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:26,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2065969334, now seen corresponding path program 12 times [2024-06-20 19:14:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230154371] [2024-06-20 19:14:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:33,814 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-20 19:14:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:33,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230154371] [2024-06-20 19:14:33,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230154371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149496309] [2024-06-20 19:14:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:34,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:34,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 257 transitions, 2596 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:34,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:34,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:34,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:34,686 INFO L124 PetriNetUnfolderBase]: 675/1217 cut-off events. [2024-06-20 19:14:34,686 INFO L125 PetriNetUnfolderBase]: For 278800/278800 co-relation queries the response was YES. [2024-06-20 19:14:34,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11212 conditions, 1217 events. 675/1217 cut-off events. For 278800/278800 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6342 event pairs, 81 based on Foata normal form. 2/1217 useless extension candidates. Maximal degree in co-relation 11062. Up to 849 conditions per place. [2024-06-20 19:14:34,703 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 207 selfloop transitions, 77 changer transitions 0/286 dead transitions. [2024-06-20 19:14:34,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 286 transitions, 3856 flow [2024-06-20 19:14:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-20 19:14:34,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2024-06-20 19:14:34,705 INFO L175 Difference]: Start difference. First operand has 309 places, 257 transitions, 2596 flow. Second operand 11 states and 144 transitions. [2024-06-20 19:14:34,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 286 transitions, 3856 flow [2024-06-20 19:14:35,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 286 transitions, 3639 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-06-20 19:14:35,452 INFO L231 Difference]: Finished difference. Result has 312 places, 261 transitions, 2677 flow [2024-06-20 19:14:35,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2677, PETRI_PLACES=312, PETRI_TRANSITIONS=261} [2024-06-20 19:14:35,457 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-20 19:14:35,457 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 261 transitions, 2677 flow [2024-06-20 19:14:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:35,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:35,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:35,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-20 19:14:35,458 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:35,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2065973984, now seen corresponding path program 13 times [2024-06-20 19:14:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736900734] [2024-06-20 19:14:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736900734] [2024-06-20 19:14:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736900734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:42,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495588850] [2024-06-20 19:14:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:42,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:42,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:42,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:42,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:42,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 261 transitions, 2677 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:42,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:42,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:42,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:43,319 INFO L124 PetriNetUnfolderBase]: 679/1225 cut-off events. [2024-06-20 19:14:43,320 INFO L125 PetriNetUnfolderBase]: For 279806/279806 co-relation queries the response was YES. [2024-06-20 19:14:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11309 conditions, 1225 events. 679/1225 cut-off events. For 279806/279806 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6403 event pairs, 114 based on Foata normal form. 2/1225 useless extension candidates. Maximal degree in co-relation 11157. Up to 1075 conditions per place. [2024-06-20 19:14:43,334 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 215 selfloop transitions, 59 changer transitions 0/276 dead transitions. [2024-06-20 19:14:43,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 276 transitions, 3285 flow [2024-06-20 19:14:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-20 19:14:43,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-20 19:14:43,336 INFO L175 Difference]: Start difference. First operand has 312 places, 261 transitions, 2677 flow. Second operand 11 states and 129 transitions. [2024-06-20 19:14:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 276 transitions, 3285 flow [2024-06-20 19:14:44,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 276 transitions, 3165 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-20 19:14:44,118 INFO L231 Difference]: Finished difference. Result has 317 places, 262 transitions, 2705 flow [2024-06-20 19:14:44,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2705, PETRI_PLACES=317, PETRI_TRANSITIONS=262} [2024-06-20 19:14:44,119 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-20 19:14:44,119 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 262 transitions, 2705 flow [2024-06-20 19:14:44,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:44,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:44,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:44,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-20 19:14:44,120 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:44,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2072409770, now seen corresponding path program 7 times [2024-06-20 19:14:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494130175] [2024-06-20 19:14:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:51,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-20 19:14:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494130175] [2024-06-20 19:14:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494130175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:14:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956283172] [2024-06-20 19:14:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:51,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:14:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:14:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:14:51,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:14:51,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 262 transitions, 2705 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:51,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:51,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:14:51,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:52,251 INFO L124 PetriNetUnfolderBase]: 691/1245 cut-off events. [2024-06-20 19:14:52,251 INFO L125 PetriNetUnfolderBase]: For 286875/286875 co-relation queries the response was YES. [2024-06-20 19:14:52,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11534 conditions, 1245 events. 691/1245 cut-off events. For 286875/286875 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6532 event pairs, 88 based on Foata normal form. 2/1245 useless extension candidates. Maximal degree in co-relation 11380. Up to 1001 conditions per place. [2024-06-20 19:14:52,265 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 212 selfloop transitions, 70 changer transitions 0/284 dead transitions. [2024-06-20 19:14:52,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 284 transitions, 3400 flow [2024-06-20 19:14:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:14:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:14:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-20 19:14:52,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-20 19:14:52,266 INFO L175 Difference]: Start difference. First operand has 317 places, 262 transitions, 2705 flow. Second operand 11 states and 135 transitions. [2024-06-20 19:14:52,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 284 transitions, 3400 flow [2024-06-20 19:14:53,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 284 transitions, 3266 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:14:53,225 INFO L231 Difference]: Finished difference. Result has 319 places, 266 transitions, 2797 flow [2024-06-20 19:14:53,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2797, PETRI_PLACES=319, PETRI_TRANSITIONS=266} [2024-06-20 19:14:53,226 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-20 19:14:53,226 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 266 transitions, 2797 flow [2024-06-20 19:14:53,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:53,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:53,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:53,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-20 19:14:53,227 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:53,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1899735554, now seen corresponding path program 14 times [2024-06-20 19:14:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168784010] [2024-06-20 19:14:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:00,882 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-20 19:15:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168784010] [2024-06-20 19:15:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168784010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:15:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837818060] [2024-06-20 19:15:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:00,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:15:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:15:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:15:01,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:15:01,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 266 transitions, 2797 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:01,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:01,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:15:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:01,780 INFO L124 PetriNetUnfolderBase]: 735/1333 cut-off events. [2024-06-20 19:15:01,780 INFO L125 PetriNetUnfolderBase]: For 368228/368228 co-relation queries the response was YES. [2024-06-20 19:15:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13466 conditions, 1333 events. 735/1333 cut-off events. For 368228/368228 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7162 event pairs, 103 based on Foata normal form. 2/1333 useless extension candidates. Maximal degree in co-relation 13311. Up to 990 conditions per place. [2024-06-20 19:15:01,797 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 219 selfloop transitions, 73 changer transitions 0/294 dead transitions. [2024-06-20 19:15:01,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 294 transitions, 3800 flow [2024-06-20 19:15:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-20 19:15:01,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4310850439882698 [2024-06-20 19:15:01,806 INFO L175 Difference]: Start difference. First operand has 319 places, 266 transitions, 2797 flow. Second operand 11 states and 147 transitions. [2024-06-20 19:15:01,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 294 transitions, 3800 flow [2024-06-20 19:15:02,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 294 transitions, 3611 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-20 19:15:02,937 INFO L231 Difference]: Finished difference. Result has 323 places, 269 transitions, 2820 flow [2024-06-20 19:15:02,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2608, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2820, PETRI_PLACES=323, PETRI_TRANSITIONS=269} [2024-06-20 19:15:02,937 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 293 predicate places. [2024-06-20 19:15:02,938 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 269 transitions, 2820 flow [2024-06-20 19:15:02,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:02,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:02,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:02,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-20 19:15:02,938 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:02,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1899740390, now seen corresponding path program 8 times [2024-06-20 19:15:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601552369] [2024-06-20 19:15:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:09,822 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-20 19:15:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601552369] [2024-06-20 19:15:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601552369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:09,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:15:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340364322] [2024-06-20 19:15:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:09,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:15:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:15:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:15:10,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:15:10,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 269 transitions, 2820 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:10,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:10,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:15:10,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:10,683 INFO L124 PetriNetUnfolderBase]: 751/1359 cut-off events. [2024-06-20 19:15:10,683 INFO L125 PetriNetUnfolderBase]: For 389127/389127 co-relation queries the response was YES. [2024-06-20 19:15:10,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14054 conditions, 1359 events. 751/1359 cut-off events. For 389127/389127 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7299 event pairs, 113 based on Foata normal form. 2/1359 useless extension candidates. Maximal degree in co-relation 13897. Up to 1091 conditions per place. [2024-06-20 19:15:10,697 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 217 selfloop transitions, 74 changer transitions 0/293 dead transitions. [2024-06-20 19:15:10,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 293 transitions, 3844 flow [2024-06-20 19:15:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-20 19:15:10,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 19:15:10,698 INFO L175 Difference]: Start difference. First operand has 323 places, 269 transitions, 2820 flow. Second operand 11 states and 143 transitions. [2024-06-20 19:15:10,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 293 transitions, 3844 flow [2024-06-20 19:15:11,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 293 transitions, 3730 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-20 19:15:11,791 INFO L231 Difference]: Finished difference. Result has 327 places, 273 transitions, 3019 flow [2024-06-20 19:15:11,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3019, PETRI_PLACES=327, PETRI_TRANSITIONS=273} [2024-06-20 19:15:11,791 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 297 predicate places. [2024-06-20 19:15:11,791 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 273 transitions, 3019 flow [2024-06-20 19:15:11,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:11,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:11,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:11,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-20 19:15:11,817 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:11,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1895266904, now seen corresponding path program 15 times [2024-06-20 19:15:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192437235] [2024-06-20 19:15:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:19,091 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-20 19:15:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192437235] [2024-06-20 19:15:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192437235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:19,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:15:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241821383] [2024-06-20 19:15:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:19,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:15:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:15:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:15:19,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:15:19,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 273 transitions, 3019 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:19,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:19,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:15:19,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:19,924 INFO L124 PetriNetUnfolderBase]: 762/1380 cut-off events. [2024-06-20 19:15:19,924 INFO L125 PetriNetUnfolderBase]: For 404250/404250 co-relation queries the response was YES. [2024-06-20 19:15:19,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14653 conditions, 1380 events. 762/1380 cut-off events. For 404250/404250 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7484 event pairs, 142 based on Foata normal form. 2/1380 useless extension candidates. Maximal degree in co-relation 14494. Up to 1195 conditions per place. [2024-06-20 19:15:19,943 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 221 selfloop transitions, 68 changer transitions 0/291 dead transitions. [2024-06-20 19:15:19,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 291 transitions, 3917 flow [2024-06-20 19:15:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:15:19,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-20 19:15:19,946 INFO L175 Difference]: Start difference. First operand has 327 places, 273 transitions, 3019 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:15:19,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 291 transitions, 3917 flow [2024-06-20 19:15:21,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 291 transitions, 3738 flow, removed 49 selfloop flow, removed 7 redundant places. [2024-06-20 19:15:21,278 INFO L231 Difference]: Finished difference. Result has 331 places, 275 transitions, 3034 flow [2024-06-20 19:15:21,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2840, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3034, PETRI_PLACES=331, PETRI_TRANSITIONS=275} [2024-06-20 19:15:21,279 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 301 predicate places. [2024-06-20 19:15:21,279 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 275 transitions, 3034 flow [2024-06-20 19:15:21,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:21,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:21,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:21,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-20 19:15:21,279 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:21,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2023558402, now seen corresponding path program 9 times [2024-06-20 19:15:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066175412] [2024-06-20 19:15:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:28,165 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-20 19:15:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066175412] [2024-06-20 19:15:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066175412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:28,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:28,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:15:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010510900] [2024-06-20 19:15:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:28,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:15:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:15:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:15:28,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:15:28,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 275 transitions, 3034 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:28,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:28,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:15:28,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:28,941 INFO L124 PetriNetUnfolderBase]: 778/1406 cut-off events. [2024-06-20 19:15:28,941 INFO L125 PetriNetUnfolderBase]: For 427531/427531 co-relation queries the response was YES. [2024-06-20 19:15:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15203 conditions, 1406 events. 778/1406 cut-off events. For 427531/427531 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7637 event pairs, 100 based on Foata normal form. 2/1406 useless extension candidates. Maximal degree in co-relation 15042. Up to 1050 conditions per place. [2024-06-20 19:15:28,958 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 199 selfloop transitions, 97 changer transitions 0/298 dead transitions. [2024-06-20 19:15:28,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 298 transitions, 4068 flow [2024-06-20 19:15:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-20 19:15:28,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41642228739002934 [2024-06-20 19:15:28,959 INFO L175 Difference]: Start difference. First operand has 331 places, 275 transitions, 3034 flow. Second operand 11 states and 142 transitions. [2024-06-20 19:15:28,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 298 transitions, 4068 flow [2024-06-20 19:15:30,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 298 transitions, 3936 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-20 19:15:30,078 INFO L231 Difference]: Finished difference. Result has 334 places, 279 transitions, 3261 flow [2024-06-20 19:15:30,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2902, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3261, PETRI_PLACES=334, PETRI_TRANSITIONS=279} [2024-06-20 19:15:30,078 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 304 predicate places. [2024-06-20 19:15:30,078 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 279 transitions, 3261 flow [2024-06-20 19:15:30,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:30,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:30,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:30,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-20 19:15:30,079 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:30,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2072640410, now seen corresponding path program 10 times [2024-06-20 19:15:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:30,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808925572] [2024-06-20 19:15:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:36,992 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-20 19:15:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808925572] [2024-06-20 19:15:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808925572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:36,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:36,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:15:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074898013] [2024-06-20 19:15:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:36,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:15:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:36,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:15:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:15:37,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:37,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 279 transitions, 3261 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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-20 19:15:37,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:37,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:37,920 INFO L124 PetriNetUnfolderBase]: 774/1400 cut-off events. [2024-06-20 19:15:37,920 INFO L125 PetriNetUnfolderBase]: For 426134/426134 co-relation queries the response was YES. [2024-06-20 19:15:37,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15132 conditions, 1400 events. 774/1400 cut-off events. For 426134/426134 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7596 event pairs, 104 based on Foata normal form. 2/1400 useless extension candidates. Maximal degree in co-relation 14970. Up to 1156 conditions per place. [2024-06-20 19:15:37,937 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 221 selfloop transitions, 73 changer transitions 0/296 dead transitions. [2024-06-20 19:15:37,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 296 transitions, 3899 flow [2024-06-20 19:15:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:15:37,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:15:37,938 INFO L175 Difference]: Start difference. First operand has 334 places, 279 transitions, 3261 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:15:37,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 296 transitions, 3899 flow [2024-06-20 19:15:39,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 296 transitions, 3676 flow, removed 68 selfloop flow, removed 7 redundant places. [2024-06-20 19:15:39,119 INFO L231 Difference]: Finished difference. Result has 338 places, 279 transitions, 3189 flow [2024-06-20 19:15:39,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3189, PETRI_PLACES=338, PETRI_TRANSITIONS=279} [2024-06-20 19:15:39,120 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 308 predicate places. [2024-06-20 19:15:39,120 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 279 transitions, 3189 flow [2024-06-20 19:15:39,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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-20 19:15:39,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:39,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:39,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-20 19:15:39,121 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:39,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2065974170, now seen corresponding path program 11 times [2024-06-20 19:15:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161992533] [2024-06-20 19:15:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15