./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:14:35,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:14:35,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:14:35,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:14:35,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:14:35,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:14:35,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:14:35,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:14:35,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:14:35,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:14:35,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:14:35,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:14:35,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:14:35,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:14:35,499 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:14:35,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:14:35,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:14:35,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:14:35,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:14:35,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:14:35,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:14:35,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:14:35,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:14:35,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:14:35,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:14:35,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:14:35,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:14:35,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:14:35,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:14:35,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:14:35,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:14:35,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:14:35,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:14:35,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:14:35,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:14:35,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:14:35,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:14:35,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:14:35,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:14:35,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:14:35,506 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:14:35,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:14:35,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:14:35,507 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:14:35,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:14:35,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:14:35,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:14:35,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:14:35,770 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:14:35,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-06-27 22:14:36,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:14:37,050 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:14:37,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-06-27 22:14:37,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed86559b4/19ccf0a1eb1644208429b7c709b55aa2/FLAGcf2581eb7 [2024-06-27 22:14:37,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed86559b4/19ccf0a1eb1644208429b7c709b55aa2 [2024-06-27 22:14:37,401 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:14:37,402 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:14:37,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml [2024-06-27 22:14:37,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:14:37,466 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:14:37,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:14:37,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:14:37,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:14:37,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:14:37" (1/2) ... [2024-06-27 22:14:37,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f9efd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:14:37, skipping insertion in model container [2024-06-27 22:14:37,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:14:37" (1/2) ... [2024-06-27 22:14:37,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@35ba8762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:14:37, skipping insertion in model container [2024-06-27 22:14:37,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:14:37" (2/2) ... [2024-06-27 22:14:37,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f9efd6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:37, skipping insertion in model container [2024-06-27 22:14:37,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:14:37" (2/2) ... [2024-06-27 22:14:37,474 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:14:37,489 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:14:37,490 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:14:37,491 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:14:37,491 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:14:37,491 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:14:37,491 INFO L106 edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1; [2024-06-27 22:14:37,519 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:14:37,631 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-06-27 22:14:37,734 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:14:37,742 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:14:37,784 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:14:37,990 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:14:38,064 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:14:38,065 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38 WrapperNode [2024-06-27 22:14:38,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:14:38,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:14:38,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:14:38,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:14:38,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,150 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2024-06-27 22:14:38,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:14:38,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:14:38,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:14:38,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:14:38,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:14:38,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:14:38,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:14:38,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:14:38,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:14:38,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (1/1) ... [2024-06-27 22:14:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:14:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:14:38,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:14:38,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:14:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:14:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:14:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:14:38,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:14:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:14:38,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:14:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:14:38,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:14:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:14:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:14:38,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:14:38,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:14:38,275 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:14:38,404 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:14:38,406 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:14:38,950 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:14:38,950 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:14:39,102 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:14:39,102 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:14:39,102 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:14:39 BoogieIcfgContainer [2024-06-27 22:14:39,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:14:39,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:14:39,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:14:39,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:14:39,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:14:37" (1/4) ... [2024-06-27 22:14:39,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970e2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:14:39, skipping insertion in model container [2024-06-27 22:14:39,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:14:37" (2/4) ... [2024-06-27 22:14:39,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970e2ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:14:39, skipping insertion in model container [2024-06-27 22:14:39,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:14:38" (3/4) ... [2024-06-27 22:14:39,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1970e2ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:14:39, skipping insertion in model container [2024-06-27 22:14:39,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:14:39" (4/4) ... [2024-06-27 22:14:39,109 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-06-27 22:14:39,121 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:14:39,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:14:39,121 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:14:39,162 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:14:39,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 22:14:39,223 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-27 22:14:39,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:14:39,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-27 22:14:39,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 22:14:39,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-06-27 22:14:39,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:14:39,238 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;@7faeb9a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:14:39,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:14:39,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:14:39,241 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:14:39,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:14:39,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:39,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:14:39,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:39,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 346816662, now seen corresponding path program 1 times [2024-06-27 22:14:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:39,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209834202] [2024-06-27 22:14:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:40,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209834202] [2024-06-27 22:14:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209834202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:40,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:14:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126834104] [2024-06-27 22:14:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:40,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:14:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:14:40,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:14:41,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-06-27 22:14:41,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:41,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:41,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-06-27 22:14:41,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:41,698 INFO L124 PetriNetUnfolderBase]: 3008/4709 cut-off events. [2024-06-27 22:14:41,698 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 22:14:41,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9164 conditions, 4709 events. 3008/4709 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 28958 event pairs, 2491 based on Foata normal form. 139/4510 useless extension candidates. Maximal degree in co-relation 9152. Up to 4334 conditions per place. [2024-06-27 22:14:41,725 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 42 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2024-06-27 22:14:41,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 229 flow [2024-06-27 22:14:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:14:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:14:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-06-27 22:14:41,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7210884353741497 [2024-06-27 22:14:41,737 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 106 transitions. [2024-06-27 22:14:41,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 229 flow [2024-06-27 22:14:41,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:41,741 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 128 flow [2024-06-27 22:14:41,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-27 22:14:41,745 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-06-27 22:14:41,745 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 128 flow [2024-06-27 22:14:41,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:41,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:41,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:41,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:14:41,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:41,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1716588972, now seen corresponding path program 1 times [2024-06-27 22:14:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325587165] [2024-06-27 22:14:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325587165] [2024-06-27 22:14:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325587165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:14:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27611418] [2024-06-27 22:14:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:42,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:14:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:14:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:14:42,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-06-27 22:14:42,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:42,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:42,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-06-27 22:14:42,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:43,573 INFO L124 PetriNetUnfolderBase]: 3044/4885 cut-off events. [2024-06-27 22:14:43,574 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2024-06-27 22:14:43,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10507 conditions, 4885 events. 3044/4885 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30424 event pairs, 2272 based on Foata normal form. 5/4565 useless extension candidates. Maximal degree in co-relation 10495. Up to 4365 conditions per place. [2024-06-27 22:14:43,596 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 52 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2024-06-27 22:14:43,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 324 flow [2024-06-27 22:14:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:14:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:14:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-06-27 22:14:43,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-06-27 22:14:43,601 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 128 flow. Second operand 4 states and 133 transitions. [2024-06-27 22:14:43,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 324 flow [2024-06-27 22:14:43,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:14:43,604 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 191 flow [2024-06-27 22:14:43,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-06-27 22:14:43,605 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2024-06-27 22:14:43,606 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 191 flow [2024-06-27 22:14:43,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:43,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:43,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:43,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:14:43,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:43,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1674648991, now seen corresponding path program 1 times [2024-06-27 22:14:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914760552] [2024-06-27 22:14:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914760552] [2024-06-27 22:14:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914760552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:14:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588625575] [2024-06-27 22:14:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:44,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:14:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:14:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:14:44,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:14:44,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:44,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:44,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:14:44,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:45,707 INFO L124 PetriNetUnfolderBase]: 3550/5594 cut-off events. [2024-06-27 22:14:45,708 INFO L125 PetriNetUnfolderBase]: For 2428/2456 co-relation queries the response was YES. [2024-06-27 22:14:45,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 5594 events. 3550/5594 cut-off events. For 2428/2456 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34959 event pairs, 1973 based on Foata normal form. 9/5274 useless extension candidates. Maximal degree in co-relation 13604. Up to 5025 conditions per place. [2024-06-27 22:14:45,740 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 65 selfloop transitions, 11 changer transitions 2/92 dead transitions. [2024-06-27 22:14:45,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 449 flow [2024-06-27 22:14:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:14:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:14:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-06-27 22:14:45,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6653061224489796 [2024-06-27 22:14:45,745 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 191 flow. Second operand 5 states and 163 transitions. [2024-06-27 22:14:45,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 92 transitions, 449 flow [2024-06-27 22:14:45,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 438 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 22:14:45,750 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 232 flow [2024-06-27 22:14:45,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-06-27 22:14:45,751 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-27 22:14:45,751 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 232 flow [2024-06-27 22:14:45,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:45,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:45,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:45,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:14:45,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:45,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -374509549, now seen corresponding path program 1 times [2024-06-27 22:14:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129028867] [2024-06-27 22:14:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:47,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:47,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129028867] [2024-06-27 22:14:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129028867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:47,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680906471] [2024-06-27 22:14:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:47,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:47,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:47,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:14:47,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:47,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:47,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:14:47,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:48,086 INFO L124 PetriNetUnfolderBase]: 3586/5741 cut-off events. [2024-06-27 22:14:48,086 INFO L125 PetriNetUnfolderBase]: For 4550/4578 co-relation queries the response was YES. [2024-06-27 22:14:48,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14883 conditions, 5741 events. 3586/5741 cut-off events. For 4550/4578 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 36167 event pairs, 2257 based on Foata normal form. 9/5414 useless extension candidates. Maximal degree in co-relation 14866. Up to 5016 conditions per place. [2024-06-27 22:14:48,120 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 77 selfloop transitions, 14 changer transitions 3/108 dead transitions. [2024-06-27 22:14:48,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 560 flow [2024-06-27 22:14:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-06-27 22:14:48,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 22:14:48,121 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 232 flow. Second operand 6 states and 196 transitions. [2024-06-27 22:14:48,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 560 flow [2024-06-27 22:14:48,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 108 transitions, 534 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:48,129 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 268 flow [2024-06-27 22:14:48,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-27 22:14:48,130 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2024-06-27 22:14:48,131 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 268 flow [2024-06-27 22:14:48,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:48,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:48,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:14:48,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:48,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1338716508, now seen corresponding path program 1 times [2024-06-27 22:14:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966626937] [2024-06-27 22:14:48,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:48,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-27 22:14:48,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:48,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966626937] [2024-06-27 22:14:48,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966626937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:48,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:48,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:14:48,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780233310] [2024-06-27 22:14:48,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:48,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:14:48,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:14:48,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:14:48,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49 [2024-06-27 22:14:48,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:48,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:48,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49 [2024-06-27 22:14:48,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:48,528 INFO L124 PetriNetUnfolderBase]: 1455/2718 cut-off events. [2024-06-27 22:14:48,529 INFO L125 PetriNetUnfolderBase]: For 2557/2988 co-relation queries the response was YES. [2024-06-27 22:14:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6999 conditions, 2718 events. 1455/2718 cut-off events. For 2557/2988 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18892 event pairs, 678 based on Foata normal form. 6/2531 useless extension candidates. Maximal degree in co-relation 6981. Up to 1581 conditions per place. [2024-06-27 22:14:48,548 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 38 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2024-06-27 22:14:48,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 388 flow [2024-06-27 22:14:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:14:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:14:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-06-27 22:14:48,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-06-27 22:14:48,550 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 268 flow. Second operand 3 states and 116 transitions. [2024-06-27 22:14:48,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 388 flow [2024-06-27 22:14:48,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 352 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:48,558 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 236 flow [2024-06-27 22:14:48,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-06-27 22:14:48,560 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-27 22:14:48,562 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 236 flow [2024-06-27 22:14:48,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:48,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:48,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:48,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:14:48,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:48,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 235406507, now seen corresponding path program 1 times [2024-06-27 22:14:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744240421] [2024-06-27 22:14:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:50,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:50,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744240421] [2024-06-27 22:14:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744240421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:50,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:14:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363072022] [2024-06-27 22:14:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:50,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:14:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:50,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:14:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:14:50,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:14:50,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:50,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:50,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:14:50,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:51,620 INFO L124 PetriNetUnfolderBase]: 4018/6378 cut-off events. [2024-06-27 22:14:51,620 INFO L125 PetriNetUnfolderBase]: For 7575/7630 co-relation queries the response was YES. [2024-06-27 22:14:51,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17322 conditions, 6378 events. 4018/6378 cut-off events. For 7575/7630 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 39763 event pairs, 2370 based on Foata normal form. 28/6234 useless extension candidates. Maximal degree in co-relation 17303. Up to 5727 conditions per place. [2024-06-27 22:14:51,660 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 55 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-06-27 22:14:51,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 432 flow [2024-06-27 22:14:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:14:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:14:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-06-27 22:14:51,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:14:51,661 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 236 flow. Second operand 5 states and 133 transitions. [2024-06-27 22:14:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 432 flow [2024-06-27 22:14:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:51,666 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 300 flow [2024-06-27 22:14:51,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2024-06-27 22:14:51,668 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2024-06-27 22:14:51,668 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 300 flow [2024-06-27 22:14:51,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:51,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:51,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:51,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:14:51,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:51,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 873629138, now seen corresponding path program 1 times [2024-06-27 22:14:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240768630] [2024-06-27 22:14:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:53,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-27 22:14:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240768630] [2024-06-27 22:14:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240768630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:53,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:53,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858384789] [2024-06-27 22:14:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:53,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:53,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:53,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:53,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:14:53,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 300 flow. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:53,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:53,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:14:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:54,795 INFO L124 PetriNetUnfolderBase]: 3841/6070 cut-off events. [2024-06-27 22:14:54,796 INFO L125 PetriNetUnfolderBase]: For 9686/9734 co-relation queries the response was YES. [2024-06-27 22:14:54,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17948 conditions, 6070 events. 3841/6070 cut-off events. For 9686/9734 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38043 event pairs, 1137 based on Foata normal form. 13/5913 useless extension candidates. Maximal degree in co-relation 17926. Up to 5115 conditions per place. [2024-06-27 22:14:54,822 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 108 selfloop transitions, 36 changer transitions 6/163 dead transitions. [2024-06-27 22:14:54,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 163 transitions, 1010 flow [2024-06-27 22:14:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 259 transitions. [2024-06-27 22:14:54,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2024-06-27 22:14:54,824 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 300 flow. Second operand 8 states and 259 transitions. [2024-06-27 22:14:54,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 163 transitions, 1010 flow [2024-06-27 22:14:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 163 transitions, 995 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:54,831 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 581 flow [2024-06-27 22:14:54,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=581, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2024-06-27 22:14:54,832 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-06-27 22:14:54,832 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 581 flow [2024-06-27 22:14:54,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:54,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:54,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:54,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:14:54,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:54,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1416817767, now seen corresponding path program 1 times [2024-06-27 22:14:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410145001] [2024-06-27 22:14:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410145001] [2024-06-27 22:14:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410145001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523624553] [2024-06-27 22:14:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:56,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:56,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:14:56,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:56,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:56,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:14:56,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:57,389 INFO L124 PetriNetUnfolderBase]: 3733/5880 cut-off events. [2024-06-27 22:14:57,390 INFO L125 PetriNetUnfolderBase]: For 15763/15857 co-relation queries the response was YES. [2024-06-27 22:14:57,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20718 conditions, 5880 events. 3733/5880 cut-off events. For 15763/15857 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35699 event pairs, 1342 based on Foata normal form. 46/5811 useless extension candidates. Maximal degree in co-relation 20689. Up to 5229 conditions per place. [2024-06-27 22:14:57,430 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 85 selfloop transitions, 30 changer transitions 0/129 dead transitions. [2024-06-27 22:14:57,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 129 transitions, 1025 flow [2024-06-27 22:14:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-06-27 22:14:57,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-27 22:14:57,433 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 581 flow. Second operand 6 states and 166 transitions. [2024-06-27 22:14:57,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 129 transitions, 1025 flow [2024-06-27 22:14:57,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 129 transitions, 1009 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-27 22:14:57,447 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 804 flow [2024-06-27 22:14:57,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2024-06-27 22:14:57,449 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2024-06-27 22:14:57,449 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 804 flow [2024-06-27 22:14:57,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:57,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:57,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:57,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:14:57,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:57,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1407584727, now seen corresponding path program 2 times [2024-06-27 22:14:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092429418] [2024-06-27 22:14:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092429418] [2024-06-27 22:14:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092429418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:58,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:58,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:58,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229654412] [2024-06-27 22:14:58,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:58,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:58,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:58,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:58,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:14:58,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:58,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:58,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:14:58,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:59,756 INFO L124 PetriNetUnfolderBase]: 3728/5873 cut-off events. [2024-06-27 22:14:59,756 INFO L125 PetriNetUnfolderBase]: For 20039/20180 co-relation queries the response was YES. [2024-06-27 22:14:59,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22563 conditions, 5873 events. 3728/5873 cut-off events. For 20039/20180 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35658 event pairs, 1339 based on Foata normal form. 47/5810 useless extension candidates. Maximal degree in co-relation 22527. Up to 5296 conditions per place. [2024-06-27 22:14:59,794 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 99 selfloop transitions, 16 changer transitions 0/129 dead transitions. [2024-06-27 22:14:59,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 129 transitions, 1120 flow [2024-06-27 22:14:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-06-27 22:14:59,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340136054421769 [2024-06-27 22:14:59,796 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 804 flow. Second operand 6 states and 157 transitions. [2024-06-27 22:14:59,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 129 transitions, 1120 flow [2024-06-27 22:14:59,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 129 transitions, 1083 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-06-27 22:14:59,812 INFO L231 Difference]: Finished difference. Result has 90 places, 109 transitions, 854 flow [2024-06-27 22:14:59,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=854, PETRI_PLACES=90, PETRI_TRANSITIONS=109} [2024-06-27 22:14:59,812 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2024-06-27 22:14:59,812 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 109 transitions, 854 flow [2024-06-27 22:14:59,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:59,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:59,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:59,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:14:59,813 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:59,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1312701215, now seen corresponding path program 1 times [2024-06-27 22:14:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:59,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561496783] [2024-06-27 22:14:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:01,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561496783] [2024-06-27 22:15:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561496783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:01,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313920600] [2024-06-27 22:15:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:01,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:01,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:01,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:02,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:15:02,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 854 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:02,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:02,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:15:02,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:03,225 INFO L124 PetriNetUnfolderBase]: 3463/5590 cut-off events. [2024-06-27 22:15:03,225 INFO L125 PetriNetUnfolderBase]: For 21408/21472 co-relation queries the response was YES. [2024-06-27 22:15:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21717 conditions, 5590 events. 3463/5590 cut-off events. For 21408/21472 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 35248 event pairs, 722 based on Foata normal form. 28/5480 useless extension candidates. Maximal degree in co-relation 21679. Up to 4460 conditions per place. [2024-06-27 22:15:03,283 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 139 selfloop transitions, 42 changer transitions 0/194 dead transitions. [2024-06-27 22:15:03,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1620 flow [2024-06-27 22:15:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 282 transitions. [2024-06-27 22:15:03,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6394557823129252 [2024-06-27 22:15:03,285 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 854 flow. Second operand 9 states and 282 transitions. [2024-06-27 22:15:03,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1620 flow [2024-06-27 22:15:03,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 194 transitions, 1581 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:15:03,304 INFO L231 Difference]: Finished difference. Result has 94 places, 110 transitions, 921 flow [2024-06-27 22:15:03,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=921, PETRI_PLACES=94, PETRI_TRANSITIONS=110} [2024-06-27 22:15:03,304 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 39 predicate places. [2024-06-27 22:15:03,304 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 110 transitions, 921 flow [2024-06-27 22:15:03,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:03,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:03,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:03,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:15:03,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:03,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash 185172521, now seen corresponding path program 3 times [2024-06-27 22:15:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:03,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315222830] [2024-06-27 22:15:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:05,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:05,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315222830] [2024-06-27 22:15:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315222830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:05,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:05,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:15:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109947843] [2024-06-27 22:15:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:15:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:05,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:15:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:15:05,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:15:05,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 110 transitions, 921 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:05,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:05,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:15:05,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:06,295 INFO L124 PetriNetUnfolderBase]: 3914/6263 cut-off events. [2024-06-27 22:15:06,295 INFO L125 PetriNetUnfolderBase]: For 27187/27351 co-relation queries the response was YES. [2024-06-27 22:15:06,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25293 conditions, 6263 events. 3914/6263 cut-off events. For 27187/27351 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 38731 event pairs, 1570 based on Foata normal form. 78/6187 useless extension candidates. Maximal degree in co-relation 25254. Up to 5500 conditions per place. [2024-06-27 22:15:06,334 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 106 selfloop transitions, 49 changer transitions 0/169 dead transitions. [2024-06-27 22:15:06,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 169 transitions, 1544 flow [2024-06-27 22:15:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:15:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:15:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 22:15:06,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451895043731778 [2024-06-27 22:15:06,337 INFO L175 Difference]: Start difference. First operand has 94 places, 110 transitions, 921 flow. Second operand 7 states and 187 transitions. [2024-06-27 22:15:06,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 169 transitions, 1544 flow [2024-06-27 22:15:06,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 169 transitions, 1454 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:06,357 INFO L231 Difference]: Finished difference. Result has 96 places, 142 transitions, 1253 flow [2024-06-27 22:15:06,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1253, PETRI_PLACES=96, PETRI_TRANSITIONS=142} [2024-06-27 22:15:06,358 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2024-06-27 22:15:06,358 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 142 transitions, 1253 flow [2024-06-27 22:15:06,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:06,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:06,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:06,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:15:06,359 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:06,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1407573846, now seen corresponding path program 1 times [2024-06-27 22:15:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490726518] [2024-06-27 22:15:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490726518] [2024-06-27 22:15:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490726518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:08,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:08,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073810381] [2024-06-27 22:15:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:08,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 22:15:08,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 142 transitions, 1253 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:08,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:08,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 22:15:08,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:10,132 INFO L124 PetriNetUnfolderBase]: 6798/10732 cut-off events. [2024-06-27 22:15:10,133 INFO L125 PetriNetUnfolderBase]: For 46881/46981 co-relation queries the response was YES. [2024-06-27 22:15:10,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41954 conditions, 10732 events. 6798/10732 cut-off events. For 46881/46981 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 68911 event pairs, 2533 based on Foata normal form. 92/10561 useless extension candidates. Maximal degree in co-relation 41911. Up to 9400 conditions per place. [2024-06-27 22:15:10,209 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 176 selfloop transitions, 24 changer transitions 0/211 dead transitions. [2024-06-27 22:15:10,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 211 transitions, 2093 flow [2024-06-27 22:15:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:15:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:15:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 22:15:10,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 22:15:10,211 INFO L175 Difference]: Start difference. First operand has 96 places, 142 transitions, 1253 flow. Second operand 7 states and 175 transitions. [2024-06-27 22:15:10,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 211 transitions, 2093 flow [2024-06-27 22:15:10,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 211 transitions, 2043 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-06-27 22:15:10,281 INFO L231 Difference]: Finished difference. Result has 105 places, 162 transitions, 1462 flow [2024-06-27 22:15:10,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1462, PETRI_PLACES=105, PETRI_TRANSITIONS=162} [2024-06-27 22:15:10,282 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-06-27 22:15:10,282 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 162 transitions, 1462 flow [2024-06-27 22:15:10,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:10,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:10,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:10,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:15:10,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:10,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -170486636, now seen corresponding path program 1 times [2024-06-27 22:15:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601308457] [2024-06-27 22:15:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601308457] [2024-06-27 22:15:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601308457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:11,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:11,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700694225] [2024-06-27 22:15:11,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:11,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:11,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 162 transitions, 1462 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:11,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:11,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:11,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:13,422 INFO L124 PetriNetUnfolderBase]: 5733/9264 cut-off events. [2024-06-27 22:15:13,422 INFO L125 PetriNetUnfolderBase]: For 59477/60105 co-relation queries the response was YES. [2024-06-27 22:15:13,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40810 conditions, 9264 events. 5733/9264 cut-off events. For 59477/60105 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 61079 event pairs, 1744 based on Foata normal form. 132/8940 useless extension candidates. Maximal degree in co-relation 40760. Up to 7796 conditions per place. [2024-06-27 22:15:13,495 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 121 selfloop transitions, 70 changer transitions 0/207 dead transitions. [2024-06-27 22:15:13,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 207 transitions, 2158 flow [2024-06-27 22:15:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:15:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:15:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2024-06-27 22:15:13,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481049562682215 [2024-06-27 22:15:13,497 INFO L175 Difference]: Start difference. First operand has 105 places, 162 transitions, 1462 flow. Second operand 7 states and 188 transitions. [2024-06-27 22:15:13,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 207 transitions, 2158 flow [2024-06-27 22:15:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 207 transitions, 2139 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:15:13,559 INFO L231 Difference]: Finished difference. Result has 112 places, 176 transitions, 1761 flow [2024-06-27 22:15:13,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1761, PETRI_PLACES=112, PETRI_TRANSITIONS=176} [2024-06-27 22:15:13,559 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2024-06-27 22:15:13,559 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 176 transitions, 1761 flow [2024-06-27 22:15:13,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:13,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:13,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:13,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:15:13,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:13,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -170307146, now seen corresponding path program 2 times [2024-06-27 22:15:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937131236] [2024-06-27 22:15:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:14,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:14,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937131236] [2024-06-27 22:15:14,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937131236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:14,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:14,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71335560] [2024-06-27 22:15:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:14,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:14,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:15,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:15,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 176 transitions, 1761 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:15,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:15,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:15,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:16,501 INFO L124 PetriNetUnfolderBase]: 5751/9286 cut-off events. [2024-06-27 22:15:16,501 INFO L125 PetriNetUnfolderBase]: For 71818/72819 co-relation queries the response was YES. [2024-06-27 22:15:16,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43734 conditions, 9286 events. 5751/9286 cut-off events. For 71818/72819 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61187 event pairs, 1724 based on Foata normal form. 160/8994 useless extension candidates. Maximal degree in co-relation 43680. Up to 7930 conditions per place. [2024-06-27 22:15:16,572 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 148 selfloop transitions, 53 changer transitions 0/217 dead transitions. [2024-06-27 22:15:16,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 217 transitions, 2433 flow [2024-06-27 22:15:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:15:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:15:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 22:15:16,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 22:15:16,574 INFO L175 Difference]: Start difference. First operand has 112 places, 176 transitions, 1761 flow. Second operand 7 states and 182 transitions. [2024-06-27 22:15:16,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 217 transitions, 2433 flow [2024-06-27 22:15:16,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 217 transitions, 2264 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-27 22:15:16,656 INFO L231 Difference]: Finished difference. Result has 117 places, 186 transitions, 1862 flow [2024-06-27 22:15:16,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1862, PETRI_PLACES=117, PETRI_TRANSITIONS=186} [2024-06-27 22:15:16,656 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 62 predicate places. [2024-06-27 22:15:16,657 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 186 transitions, 1862 flow [2024-06-27 22:15:16,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:16,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:16,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:16,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:15:16,657 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:16,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash -685452588, now seen corresponding path program 3 times [2024-06-27 22:15:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815831368] [2024-06-27 22:15:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815831368] [2024-06-27 22:15:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815831368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740607410] [2024-06-27 22:15:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:17,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:18,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:18,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 186 transitions, 1862 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:18,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:18,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:18,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:19,502 INFO L124 PetriNetUnfolderBase]: 5708/8859 cut-off events. [2024-06-27 22:15:19,502 INFO L125 PetriNetUnfolderBase]: For 73825/74777 co-relation queries the response was YES. [2024-06-27 22:15:19,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43441 conditions, 8859 events. 5708/8859 cut-off events. For 73825/74777 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 55517 event pairs, 1674 based on Foata normal form. 153/8672 useless extension candidates. Maximal degree in co-relation 43384. Up to 7980 conditions per place. [2024-06-27 22:15:19,576 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 170 selfloop transitions, 29 changer transitions 0/215 dead transitions. [2024-06-27 22:15:19,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 215 transitions, 2368 flow [2024-06-27 22:15:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:15:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:15:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 22:15:19,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 22:15:19,579 INFO L175 Difference]: Start difference. First operand has 117 places, 186 transitions, 1862 flow. Second operand 7 states and 175 transitions. [2024-06-27 22:15:19,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 215 transitions, 2368 flow [2024-06-27 22:15:19,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 215 transitions, 2315 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 22:15:19,694 INFO L231 Difference]: Finished difference. Result has 122 places, 188 transitions, 1903 flow [2024-06-27 22:15:19,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1903, PETRI_PLACES=122, PETRI_TRANSITIONS=188} [2024-06-27 22:15:19,695 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 67 predicate places. [2024-06-27 22:15:19,695 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 188 transitions, 1903 flow [2024-06-27 22:15:19,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:19,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:19,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:19,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:15:19,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:19,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash 881953216, now seen corresponding path program 4 times [2024-06-27 22:15:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51740099] [2024-06-27 22:15:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51740099] [2024-06-27 22:15:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51740099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671196491] [2024-06-27 22:15:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:21,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:21,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:21,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 188 transitions, 1903 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:21,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:21,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:21,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:23,074 INFO L124 PetriNetUnfolderBase]: 5962/9780 cut-off events. [2024-06-27 22:15:23,074 INFO L125 PetriNetUnfolderBase]: For 80638/81813 co-relation queries the response was YES. [2024-06-27 22:15:23,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46390 conditions, 9780 events. 5962/9780 cut-off events. For 80638/81813 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 65736 event pairs, 1975 based on Foata normal form. 225/9496 useless extension candidates. Maximal degree in co-relation 46331. Up to 8120 conditions per place. [2024-06-27 22:15:23,161 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 148 selfloop transitions, 101 changer transitions 0/265 dead transitions. [2024-06-27 22:15:23,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 265 transitions, 2986 flow [2024-06-27 22:15:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:15:23,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-06-27 22:15:23,164 INFO L175 Difference]: Start difference. First operand has 122 places, 188 transitions, 1903 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:15:23,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 265 transitions, 2986 flow [2024-06-27 22:15:23,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 265 transitions, 2897 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 22:15:23,263 INFO L231 Difference]: Finished difference. Result has 126 places, 226 transitions, 2486 flow [2024-06-27 22:15:23,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2486, PETRI_PLACES=126, PETRI_TRANSITIONS=226} [2024-06-27 22:15:23,264 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 71 predicate places. [2024-06-27 22:15:23,264 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 226 transitions, 2486 flow [2024-06-27 22:15:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:23,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:23,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:23,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:15:23,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:23,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1415709264, now seen corresponding path program 5 times [2024-06-27 22:15:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272326933] [2024-06-27 22:15:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:25,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:25,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272326933] [2024-06-27 22:15:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272326933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:25,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:25,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:25,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191021762] [2024-06-27 22:15:25,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:25,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:25,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:25,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:25,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:25,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:25,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 226 transitions, 2486 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:25,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:25,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:25,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:27,422 INFO L124 PetriNetUnfolderBase]: 6174/10076 cut-off events. [2024-06-27 22:15:27,422 INFO L125 PetriNetUnfolderBase]: For 96762/98728 co-relation queries the response was YES. [2024-06-27 22:15:27,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51255 conditions, 10076 events. 6174/10076 cut-off events. For 96762/98728 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 67298 event pairs, 1989 based on Foata normal form. 243/9804 useless extension candidates. Maximal degree in co-relation 51195. Up to 8307 conditions per place. [2024-06-27 22:15:27,512 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 150 selfloop transitions, 152 changer transitions 0/318 dead transitions. [2024-06-27 22:15:27,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 318 transitions, 3998 flow [2024-06-27 22:15:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-27 22:15:27,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382653061224489 [2024-06-27 22:15:27,514 INFO L175 Difference]: Start difference. First operand has 126 places, 226 transitions, 2486 flow. Second operand 8 states and 211 transitions. [2024-06-27 22:15:27,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 318 transitions, 3998 flow [2024-06-27 22:15:27,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 318 transitions, 3784 flow, removed 79 selfloop flow, removed 3 redundant places. [2024-06-27 22:15:27,680 INFO L231 Difference]: Finished difference. Result has 133 places, 282 transitions, 3423 flow [2024-06-27 22:15:27,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3423, PETRI_PLACES=133, PETRI_TRANSITIONS=282} [2024-06-27 22:15:27,681 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2024-06-27 22:15:27,681 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 282 transitions, 3423 flow [2024-06-27 22:15:27,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:27,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:27,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:27,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:15:27,682 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:27,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1446362064, now seen corresponding path program 6 times [2024-06-27 22:15:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421426811] [2024-06-27 22:15:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:29,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-27 22:15:29,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:29,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421426811] [2024-06-27 22:15:29,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421426811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:29,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:29,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551937959] [2024-06-27 22:15:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:29,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:29,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:29,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:29,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:29,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 282 transitions, 3423 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:29,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:29,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:29,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:31,643 INFO L124 PetriNetUnfolderBase]: 6134/10022 cut-off events. [2024-06-27 22:15:31,644 INFO L125 PetriNetUnfolderBase]: For 101667/103535 co-relation queries the response was YES. [2024-06-27 22:15:31,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51914 conditions, 10022 events. 6134/10022 cut-off events. For 101667/103535 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 66823 event pairs, 1989 based on Foata normal form. 245/9758 useless extension candidates. Maximal degree in co-relation 51850. Up to 8286 conditions per place. [2024-06-27 22:15:31,756 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 150 selfloop transitions, 164 changer transitions 0/330 dead transitions. [2024-06-27 22:15:31,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 330 transitions, 4359 flow [2024-06-27 22:15:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:15:31,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 22:15:31,769 INFO L175 Difference]: Start difference. First operand has 133 places, 282 transitions, 3423 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:15:31,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 330 transitions, 4359 flow [2024-06-27 22:15:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 330 transitions, 4124 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-27 22:15:31,945 INFO L231 Difference]: Finished difference. Result has 138 places, 294 transitions, 3706 flow [2024-06-27 22:15:31,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3706, PETRI_PLACES=138, PETRI_TRANSITIONS=294} [2024-06-27 22:15:31,946 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 83 predicate places. [2024-06-27 22:15:31,946 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 294 transitions, 3706 flow [2024-06-27 22:15:31,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:31,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:31,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:31,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:15:31,946 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:31,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -653834417, now seen corresponding path program 1 times [2024-06-27 22:15:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:31,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634700908] [2024-06-27 22:15:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:34,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634700908] [2024-06-27 22:15:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634700908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:34,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:15:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551280666] [2024-06-27 22:15:34,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:34,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:15:34,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:34,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:15:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:15:34,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 22:15:34,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 294 transitions, 3706 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:34,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:34,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 22:15:34,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:37,281 INFO L124 PetriNetUnfolderBase]: 8720/13782 cut-off events. [2024-06-27 22:15:37,281 INFO L125 PetriNetUnfolderBase]: For 121396/121419 co-relation queries the response was YES. [2024-06-27 22:15:37,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67962 conditions, 13782 events. 8720/13782 cut-off events. For 121396/121419 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 90452 event pairs, 2980 based on Foata normal form. 55/13520 useless extension candidates. Maximal degree in co-relation 67897. Up to 11352 conditions per place. [2024-06-27 22:15:37,400 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 301 selfloop transitions, 41 changer transitions 0/386 dead transitions. [2024-06-27 22:15:37,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 386 transitions, 5149 flow [2024-06-27 22:15:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-06-27 22:15:37,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:15:37,404 INFO L175 Difference]: Start difference. First operand has 138 places, 294 transitions, 3706 flow. Second operand 10 states and 245 transitions. [2024-06-27 22:15:37,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 386 transitions, 5149 flow [2024-06-27 22:15:37,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 386 transitions, 4874 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:15:37,659 INFO L231 Difference]: Finished difference. Result has 144 places, 311 transitions, 3820 flow [2024-06-27 22:15:37,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3820, PETRI_PLACES=144, PETRI_TRANSITIONS=311} [2024-06-27 22:15:37,660 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2024-06-27 22:15:37,661 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 311 transitions, 3820 flow [2024-06-27 22:15:37,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:37,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:37,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:37,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:15:37,662 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:37,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash -141176650, now seen corresponding path program 1 times [2024-06-27 22:15:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317475940] [2024-06-27 22:15:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317475940] [2024-06-27 22:15:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317475940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:39,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:39,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:15:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753070537] [2024-06-27 22:15:39,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:15:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:39,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:15:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:15:39,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:39,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 311 transitions, 3820 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:39,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:39,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:39,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:41,261 INFO L124 PetriNetUnfolderBase]: 6635/10324 cut-off events. [2024-06-27 22:15:41,261 INFO L125 PetriNetUnfolderBase]: For 142765/144558 co-relation queries the response was YES. [2024-06-27 22:15:41,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60054 conditions, 10324 events. 6635/10324 cut-off events. For 142765/144558 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 65795 event pairs, 1669 based on Foata normal form. 282/10101 useless extension candidates. Maximal degree in co-relation 59987. Up to 8804 conditions per place. [2024-06-27 22:15:41,347 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 206 selfloop transitions, 133 changer transitions 0/357 dead transitions. [2024-06-27 22:15:41,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 357 transitions, 4833 flow [2024-06-27 22:15:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:15:41,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 22:15:41,349 INFO L175 Difference]: Start difference. First operand has 144 places, 311 transitions, 3820 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:15:41,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 357 transitions, 4833 flow [2024-06-27 22:15:41,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 357 transitions, 4760 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 22:15:41,540 INFO L231 Difference]: Finished difference. Result has 147 places, 321 transitions, 4189 flow [2024-06-27 22:15:41,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3747, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4189, PETRI_PLACES=147, PETRI_TRANSITIONS=321} [2024-06-27 22:15:41,541 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-06-27 22:15:41,541 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 321 transitions, 4189 flow [2024-06-27 22:15:41,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:41,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:41,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:15:41,541 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:41,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -141026920, now seen corresponding path program 2 times [2024-06-27 22:15:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120198404] [2024-06-27 22:15:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120198404] [2024-06-27 22:15:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120198404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:15:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175266203] [2024-06-27 22:15:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:43,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:15:43,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:15:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:15:43,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:43,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 321 transitions, 4189 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:43,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:43,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:43,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:45,758 INFO L124 PetriNetUnfolderBase]: 7718/12330 cut-off events. [2024-06-27 22:15:45,758 INFO L125 PetriNetUnfolderBase]: For 176749/178719 co-relation queries the response was YES. [2024-06-27 22:15:45,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72186 conditions, 12330 events. 7718/12330 cut-off events. For 176749/178719 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 83173 event pairs, 1952 based on Foata normal form. 246/11898 useless extension candidates. Maximal degree in co-relation 72117. Up to 8914 conditions per place. [2024-06-27 22:15:46,078 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 337 selfloop transitions, 61 changer transitions 0/416 dead transitions. [2024-06-27 22:15:46,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 416 transitions, 6028 flow [2024-06-27 22:15:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 228 transitions. [2024-06-27 22:15:46,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2024-06-27 22:15:46,079 INFO L175 Difference]: Start difference. First operand has 147 places, 321 transitions, 4189 flow. Second operand 8 states and 228 transitions. [2024-06-27 22:15:46,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 416 transitions, 6028 flow [2024-06-27 22:15:46,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 416 transitions, 5913 flow, removed 49 selfloop flow, removed 2 redundant places. [2024-06-27 22:15:46,347 INFO L231 Difference]: Finished difference. Result has 156 places, 344 transitions, 4543 flow [2024-06-27 22:15:46,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4102, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4543, PETRI_PLACES=156, PETRI_TRANSITIONS=344} [2024-06-27 22:15:46,347 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 101 predicate places. [2024-06-27 22:15:46,348 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 344 transitions, 4543 flow [2024-06-27 22:15:46,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:46,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:46,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:46,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:15:46,348 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:46,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash -135454794, now seen corresponding path program 1 times [2024-06-27 22:15:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:46,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779764505] [2024-06-27 22:15:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779764505] [2024-06-27 22:15:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779764505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:47,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:47,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071762952] [2024-06-27 22:15:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:47,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:48,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 22:15:48,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 344 transitions, 4543 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:48,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:48,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 22:15:48,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:50,832 INFO L124 PetriNetUnfolderBase]: 10655/16743 cut-off events. [2024-06-27 22:15:50,832 INFO L125 PetriNetUnfolderBase]: For 213792/213881 co-relation queries the response was YES. [2024-06-27 22:15:50,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95278 conditions, 16743 events. 10655/16743 cut-off events. For 213792/213881 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 113156 event pairs, 3006 based on Foata normal form. 57/16366 useless extension candidates. Maximal degree in co-relation 95204. Up to 13897 conditions per place. [2024-06-27 22:15:51,033 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 369 selfloop transitions, 42 changer transitions 0/456 dead transitions. [2024-06-27 22:15:51,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 456 transitions, 6829 flow [2024-06-27 22:15:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 22:15:51,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2024-06-27 22:15:51,036 INFO L175 Difference]: Start difference. First operand has 156 places, 344 transitions, 4543 flow. Second operand 8 states and 197 transitions. [2024-06-27 22:15:51,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 456 transitions, 6829 flow [2024-06-27 22:15:51,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 456 transitions, 6787 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 22:15:51,601 INFO L231 Difference]: Finished difference. Result has 165 places, 379 transitions, 5262 flow [2024-06-27 22:15:51,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4504, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5262, PETRI_PLACES=165, PETRI_TRANSITIONS=379} [2024-06-27 22:15:51,601 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 110 predicate places. [2024-06-27 22:15:51,602 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 379 transitions, 5262 flow [2024-06-27 22:15:51,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:51,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:51,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:51,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:15:51,602 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:51,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash -984553210, now seen corresponding path program 3 times [2024-06-27 22:15:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528832354] [2024-06-27 22:15:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528832354] [2024-06-27 22:15:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528832354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:53,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:15:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527484899] [2024-06-27 22:15:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:53,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:15:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:15:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:15:53,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:15:53,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 379 transitions, 5262 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:53,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:53,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:15:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:55,890 INFO L124 PetriNetUnfolderBase]: 8649/13632 cut-off events. [2024-06-27 22:15:55,891 INFO L125 PetriNetUnfolderBase]: For 235206/236917 co-relation queries the response was YES. [2024-06-27 22:15:56,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87400 conditions, 13632 events. 8649/13632 cut-off events. For 235206/236917 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 91683 event pairs, 2181 based on Foata normal form. 372/13233 useless extension candidates. Maximal degree in co-relation 87321. Up to 11100 conditions per place. [2024-06-27 22:15:56,075 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 266 selfloop transitions, 138 changer transitions 0/429 dead transitions. [2024-06-27 22:15:56,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 429 transitions, 6442 flow [2024-06-27 22:15:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:15:56,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 22:15:56,076 INFO L175 Difference]: Start difference. First operand has 165 places, 379 transitions, 5262 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:15:56,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 429 transitions, 6442 flow [2024-06-27 22:15:56,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 429 transitions, 6401 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 22:15:56,526 INFO L231 Difference]: Finished difference. Result has 171 places, 386 transitions, 5591 flow [2024-06-27 22:15:56,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5221, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5591, PETRI_PLACES=171, PETRI_TRANSITIONS=386} [2024-06-27 22:15:56,526 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 116 predicate places. [2024-06-27 22:15:56,526 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 386 transitions, 5591 flow [2024-06-27 22:15:56,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:56,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:56,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:56,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:15:56,527 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:56,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 225815208, now seen corresponding path program 2 times [2024-06-27 22:15:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976032510] [2024-06-27 22:15:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:57,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976032510] [2024-06-27 22:15:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976032510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118979290] [2024-06-27 22:15:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:57,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:58,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 22:15:58,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 386 transitions, 5591 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:58,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:58,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 22:15:58,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:01,177 INFO L124 PetriNetUnfolderBase]: 10855/17028 cut-off events. [2024-06-27 22:16:01,177 INFO L125 PetriNetUnfolderBase]: For 248373/248475 co-relation queries the response was YES. [2024-06-27 22:16:01,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102964 conditions, 17028 events. 10855/17028 cut-off events. For 248373/248475 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 114904 event pairs, 3152 based on Foata normal form. 77/16682 useless extension candidates. Maximal degree in co-relation 102883. Up to 14425 conditions per place. [2024-06-27 22:16:01,381 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 378 selfloop transitions, 34 changer transitions 0/457 dead transitions. [2024-06-27 22:16:01,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 457 transitions, 7244 flow [2024-06-27 22:16:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:16:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:16:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 22:16:01,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 22:16:01,382 INFO L175 Difference]: Start difference. First operand has 171 places, 386 transitions, 5591 flow. Second operand 8 states and 189 transitions. [2024-06-27 22:16:01,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 457 transitions, 7244 flow [2024-06-27 22:16:02,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 457 transitions, 7049 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 22:16:02,077 INFO L231 Difference]: Finished difference. Result has 176 places, 398 transitions, 5730 flow [2024-06-27 22:16:02,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5408, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5730, PETRI_PLACES=176, PETRI_TRANSITIONS=398} [2024-06-27 22:16:02,078 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 121 predicate places. [2024-06-27 22:16:02,078 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 398 transitions, 5730 flow [2024-06-27 22:16:02,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:02,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:02,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:02,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:16:02,079 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:02,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1656285062, now seen corresponding path program 4 times [2024-06-27 22:16:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70268099] [2024-06-27 22:16:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70268099] [2024-06-27 22:16:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70268099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:03,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:03,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197010080] [2024-06-27 22:16:03,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:03,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:04,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:04,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 398 transitions, 5730 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:04,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:04,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:04,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:07,045 INFO L124 PetriNetUnfolderBase]: 9354/14821 cut-off events. [2024-06-27 22:16:07,045 INFO L125 PetriNetUnfolderBase]: For 277694/279503 co-relation queries the response was YES. [2024-06-27 22:16:07,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96669 conditions, 14821 events. 9354/14821 cut-off events. For 277694/279503 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 101688 event pairs, 2253 based on Foata normal form. 130/14143 useless extension candidates. Maximal degree in co-relation 96586. Up to 11318 conditions per place. [2024-06-27 22:16:07,231 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 379 selfloop transitions, 74 changer transitions 0/481 dead transitions. [2024-06-27 22:16:07,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 481 transitions, 7555 flow [2024-06-27 22:16:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:16:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:16:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:16:07,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:16:07,233 INFO L175 Difference]: Start difference. First operand has 176 places, 398 transitions, 5730 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:16:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 481 transitions, 7555 flow [2024-06-27 22:16:07,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 481 transitions, 7453 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 22:16:07,806 INFO L231 Difference]: Finished difference. Result has 182 places, 416 transitions, 6123 flow [2024-06-27 22:16:07,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5636, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6123, PETRI_PLACES=182, PETRI_TRANSITIONS=416} [2024-06-27 22:16:07,807 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 127 predicate places. [2024-06-27 22:16:07,807 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 416 transitions, 6123 flow [2024-06-27 22:16:07,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:07,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:07,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:07,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:16:07,808 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:07,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1893841742, now seen corresponding path program 5 times [2024-06-27 22:16:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:07,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556223971] [2024-06-27 22:16:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:09,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556223971] [2024-06-27 22:16:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556223971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:09,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:09,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139648683] [2024-06-27 22:16:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:09,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:09,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:09,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 416 transitions, 6123 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:09,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:09,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:09,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:12,679 INFO L124 PetriNetUnfolderBase]: 9630/15162 cut-off events. [2024-06-27 22:16:12,679 INFO L125 PetriNetUnfolderBase]: For 307322/309589 co-relation queries the response was YES. [2024-06-27 22:16:12,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102771 conditions, 15162 events. 9630/15162 cut-off events. For 307322/309589 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 103377 event pairs, 2236 based on Foata normal form. 493/14782 useless extension candidates. Maximal degree in co-relation 102685. Up to 12156 conditions per place. [2024-06-27 22:16:12,929 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 235 selfloop transitions, 240 changer transitions 0/503 dead transitions. [2024-06-27 22:16:12,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 503 transitions, 7867 flow [2024-06-27 22:16:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-06-27 22:16:12,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2024-06-27 22:16:12,931 INFO L175 Difference]: Start difference. First operand has 182 places, 416 transitions, 6123 flow. Second operand 9 states and 240 transitions. [2024-06-27 22:16:12,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 503 transitions, 7867 flow [2024-06-27 22:16:13,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 503 transitions, 7769 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-27 22:16:13,697 INFO L231 Difference]: Finished difference. Result has 190 places, 456 transitions, 7096 flow [2024-06-27 22:16:13,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6027, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7096, PETRI_PLACES=190, PETRI_TRANSITIONS=456} [2024-06-27 22:16:13,698 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 135 predicate places. [2024-06-27 22:16:13,698 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 456 transitions, 7096 flow [2024-06-27 22:16:13,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:13,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:13,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:13,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:16:13,699 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:13,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1540123900, now seen corresponding path program 6 times [2024-06-27 22:16:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398471030] [2024-06-27 22:16:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398471030] [2024-06-27 22:16:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398471030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511710326] [2024-06-27 22:16:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:15,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:15,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:15,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:15,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:15,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 456 transitions, 7096 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:15,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:15,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:15,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:19,297 INFO L124 PetriNetUnfolderBase]: 9962/15661 cut-off events. [2024-06-27 22:16:19,298 INFO L125 PetriNetUnfolderBase]: For 351515/355093 co-relation queries the response was YES. [2024-06-27 22:16:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110825 conditions, 15661 events. 9962/15661 cut-off events. For 351515/355093 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 106833 event pairs, 2251 based on Foata normal form. 586/15328 useless extension candidates. Maximal degree in co-relation 110736. Up to 12463 conditions per place. [2024-06-27 22:16:19,575 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 248 selfloop transitions, 294 changer transitions 0/570 dead transitions. [2024-06-27 22:16:19,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 570 transitions, 9632 flow [2024-06-27 22:16:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-06-27 22:16:19,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487528344671202 [2024-06-27 22:16:19,578 INFO L175 Difference]: Start difference. First operand has 190 places, 456 transitions, 7096 flow. Second operand 9 states and 242 transitions. [2024-06-27 22:16:19,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 570 transitions, 9632 flow [2024-06-27 22:16:20,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 570 transitions, 9127 flow, removed 143 selfloop flow, removed 4 redundant places. [2024-06-27 22:16:20,401 INFO L231 Difference]: Finished difference. Result has 197 places, 522 transitions, 8372 flow [2024-06-27 22:16:20,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6763, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8372, PETRI_PLACES=197, PETRI_TRANSITIONS=522} [2024-06-27 22:16:20,401 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2024-06-27 22:16:20,402 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 522 transitions, 8372 flow [2024-06-27 22:16:20,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:20,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:20,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:20,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:16:20,402 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:20,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1570746940, now seen corresponding path program 7 times [2024-06-27 22:16:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:20,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075787168] [2024-06-27 22:16:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:20,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075787168] [2024-06-27 22:16:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075787168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:22,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420669518] [2024-06-27 22:16:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:22,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:22,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:22,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:22,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 522 transitions, 8372 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:22,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:22,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:22,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:26,760 INFO L124 PetriNetUnfolderBase]: 10006/15769 cut-off events. [2024-06-27 22:16:26,760 INFO L125 PetriNetUnfolderBase]: For 360984/364894 co-relation queries the response was YES. [2024-06-27 22:16:26,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113275 conditions, 15769 events. 10006/15769 cut-off events. For 360984/364894 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 108153 event pairs, 2266 based on Foata normal form. 641/15486 useless extension candidates. Maximal degree in co-relation 113182. Up to 12507 conditions per place. [2024-06-27 22:16:26,962 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 255 selfloop transitions, 303 changer transitions 0/586 dead transitions. [2024-06-27 22:16:26,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 586 transitions, 10111 flow [2024-06-27 22:16:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 22:16:26,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-06-27 22:16:26,965 INFO L175 Difference]: Start difference. First operand has 197 places, 522 transitions, 8372 flow. Second operand 9 states and 239 transitions. [2024-06-27 22:16:26,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 586 transitions, 10111 flow [2024-06-27 22:16:28,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 586 transitions, 9753 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:16:28,035 INFO L231 Difference]: Finished difference. Result has 202 places, 538 transitions, 8894 flow [2024-06-27 22:16:28,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8030, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8894, PETRI_PLACES=202, PETRI_TRANSITIONS=538} [2024-06-27 22:16:28,036 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 147 predicate places. [2024-06-27 22:16:28,036 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 538 transitions, 8894 flow [2024-06-27 22:16:28,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:28,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:28,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:28,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:16:28,037 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:28,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash 937165514, now seen corresponding path program 8 times [2024-06-27 22:16:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056777111] [2024-06-27 22:16:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:30,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056777111] [2024-06-27 22:16:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056777111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:30,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376909877] [2024-06-27 22:16:30,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:30,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:30,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:30,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 538 transitions, 8894 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:30,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:34,190 INFO L124 PetriNetUnfolderBase]: 10311/16160 cut-off events. [2024-06-27 22:16:34,190 INFO L125 PetriNetUnfolderBase]: For 381080/386511 co-relation queries the response was YES. [2024-06-27 22:16:34,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117281 conditions, 16160 events. 10311/16160 cut-off events. For 381080/386511 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 110249 event pairs, 2295 based on Foata normal form. 836/16004 useless extension candidates. Maximal degree in co-relation 117187. Up to 12794 conditions per place. [2024-06-27 22:16:34,673 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 260 selfloop transitions, 404 changer transitions 0/692 dead transitions. [2024-06-27 22:16:34,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 692 transitions, 12306 flow [2024-06-27 22:16:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 22:16:34,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-06-27 22:16:34,676 INFO L175 Difference]: Start difference. First operand has 202 places, 538 transitions, 8894 flow. Second operand 9 states and 239 transitions. [2024-06-27 22:16:34,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 692 transitions, 12306 flow [2024-06-27 22:16:35,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 692 transitions, 11611 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 22:16:35,736 INFO L231 Difference]: Finished difference. Result has 207 places, 648 transitions, 11017 flow [2024-06-27 22:16:35,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8387, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11017, PETRI_PLACES=207, PETRI_TRANSITIONS=648} [2024-06-27 22:16:35,737 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 152 predicate places. [2024-06-27 22:16:35,737 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 648 transitions, 11017 flow [2024-06-27 22:16:35,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:35,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:35,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:35,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:16:35,738 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:35,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1088069820, now seen corresponding path program 9 times [2024-06-27 22:16:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:35,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95629422] [2024-06-27 22:16:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:38,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-27 22:16:38,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95629422] [2024-06-27 22:16:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95629422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165058120] [2024-06-27 22:16:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:38,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:38,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:38,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 648 transitions, 11017 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:38,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:38,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:38,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:42,430 INFO L124 PetriNetUnfolderBase]: 10465/16350 cut-off events. [2024-06-27 22:16:42,430 INFO L125 PetriNetUnfolderBase]: For 403907/409259 co-relation queries the response was YES. [2024-06-27 22:16:42,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120340 conditions, 16350 events. 10465/16350 cut-off events. For 403907/409259 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 111175 event pairs, 2319 based on Foata normal form. 739/16070 useless extension candidates. Maximal degree in co-relation 120243. Up to 12987 conditions per place. [2024-06-27 22:16:42,639 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 272 selfloop transitions, 412 changer transitions 0/712 dead transitions. [2024-06-27 22:16:42,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 712 transitions, 13043 flow [2024-06-27 22:16:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 22:16:42,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-06-27 22:16:42,641 INFO L175 Difference]: Start difference. First operand has 207 places, 648 transitions, 11017 flow. Second operand 9 states and 239 transitions. [2024-06-27 22:16:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 712 transitions, 13043 flow [2024-06-27 22:16:43,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 712 transitions, 12523 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 22:16:43,960 INFO L231 Difference]: Finished difference. Result has 212 places, 664 transitions, 11675 flow [2024-06-27 22:16:43,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10513, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=396, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11675, PETRI_PLACES=212, PETRI_TRANSITIONS=664} [2024-06-27 22:16:43,961 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2024-06-27 22:16:43,961 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 664 transitions, 11675 flow [2024-06-27 22:16:43,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:43,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:43,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:43,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:16:43,962 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:43,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1888569030, now seen corresponding path program 3 times [2024-06-27 22:16:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:43,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596430504] [2024-06-27 22:16:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596430504] [2024-06-27 22:16:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596430504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398172626] [2024-06-27 22:16:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:45,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:46,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 22:16:46,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 664 transitions, 11675 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:46,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:46,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 22:16:46,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:51,323 INFO L124 PetriNetUnfolderBase]: 14928/22579 cut-off events. [2024-06-27 22:16:51,324 INFO L125 PetriNetUnfolderBase]: For 514316/515513 co-relation queries the response was YES. [2024-06-27 22:16:51,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159689 conditions, 22579 events. 14928/22579 cut-off events. For 514316/515513 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 149839 event pairs, 3625 based on Foata normal form. 862/22887 useless extension candidates. Maximal degree in co-relation 159591. Up to 19363 conditions per place. [2024-06-27 22:16:51,619 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 652 selfloop transitions, 111 changer transitions 0/810 dead transitions. [2024-06-27 22:16:51,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 810 transitions, 15157 flow [2024-06-27 22:16:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-27 22:16:51,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-06-27 22:16:51,622 INFO L175 Difference]: Start difference. First operand has 212 places, 664 transitions, 11675 flow. Second operand 9 states and 228 transitions. [2024-06-27 22:16:51,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 810 transitions, 15157 flow [2024-06-27 22:16:53,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 810 transitions, 14359 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 22:16:53,302 INFO L231 Difference]: Finished difference. Result has 219 places, 745 transitions, 12618 flow [2024-06-27 22:16:53,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10939, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12618, PETRI_PLACES=219, PETRI_TRANSITIONS=745} [2024-06-27 22:16:53,303 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 164 predicate places. [2024-06-27 22:16:53,303 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 745 transitions, 12618 flow [2024-06-27 22:16:53,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:53,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:53,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:53,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:16:53,304 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:16:53,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1857165224, now seen corresponding path program 10 times [2024-06-27 22:16:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448443751] [2024-06-27 22:16:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448443751] [2024-06-27 22:16:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448443751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:16:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083366173] [2024-06-27 22:16:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:16:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:16:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:16:55,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:16:55,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 745 transitions, 12618 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:55,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:55,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:16:55,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:00,851 INFO L124 PetriNetUnfolderBase]: 11134/17373 cut-off events. [2024-06-27 22:17:00,851 INFO L125 PetriNetUnfolderBase]: For 486780/492353 co-relation queries the response was YES. [2024-06-27 22:17:00,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131908 conditions, 17373 events. 11134/17373 cut-off events. For 486780/492353 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 118689 event pairs, 2336 based on Foata normal form. 931/17272 useless extension candidates. Maximal degree in co-relation 131805. Up to 13616 conditions per place. [2024-06-27 22:17:01,071 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 318 selfloop transitions, 452 changer transitions 0/813 dead transitions. [2024-06-27 22:17:01,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 813 transitions, 14815 flow [2024-06-27 22:17:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:17:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:17:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-06-27 22:17:01,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328798185941043 [2024-06-27 22:17:01,073 INFO L175 Difference]: Start difference. First operand has 219 places, 745 transitions, 12618 flow. Second operand 9 states and 235 transitions. [2024-06-27 22:17:01,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 813 transitions, 14815 flow [2024-06-27 22:17:02,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 813 transitions, 14590 flow, removed 106 selfloop flow, removed 2 redundant places. [2024-06-27 22:17:02,457 INFO L231 Difference]: Finished difference. Result has 226 places, 765 transitions, 13714 flow [2024-06-27 22:17:02,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12425, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13714, PETRI_PLACES=226, PETRI_TRANSITIONS=765} [2024-06-27 22:17:02,459 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 171 predicate places. [2024-06-27 22:17:02,459 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 765 transitions, 13714 flow [2024-06-27 22:17:02,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:02,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:02,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:17:02,460 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:17:02,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash -81627773, now seen corresponding path program 1 times [2024-06-27 22:17:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476513982] [2024-06-27 22:17:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:04,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:04,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476513982] [2024-06-27 22:17:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476513982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:17:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102759533] [2024-06-27 22:17:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:04,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:17:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:17:04,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:17:04,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:17:04,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 765 transitions, 13714 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:04,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:04,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:17:04,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand