./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix035_power.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix035_power.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:19:44,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:19:44,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:19:44,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:19:44,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:19:45,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:19:45,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:19:45,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:19:45,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:19:45,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:19:45,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:19:45,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:19:45,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:19:45,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:19:45,009 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:19:45,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:19:45,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:19:45,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:19:45,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:19:45,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:19:45,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:19:45,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:19:45,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:19:45,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:19:45,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:19:45,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:19:45,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:19:45,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:19:45,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:19:45,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:19:45,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:19:45,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:19:45,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:19:45,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:19:45,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:19:45,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:19:45,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:19:45,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:19:45,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:19:45,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:19:45,028 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:19:45,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:19:45,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:19:45,028 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:19:45,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:19:45,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:19:45,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:19:45,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:19:45,296 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:19:45,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2024-06-27 22:19:46,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:19:46,667 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:19:46,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2024-06-27 22:19:46,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d515b444/bc5c01d676204dcbaf857896a973bb44/FLAG2018237e1 [2024-06-27 22:19:46,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d515b444/bc5c01d676204dcbaf857896a973bb44 [2024-06-27 22:19:46,698 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:19:46,699 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:19:46,699 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/mix035_power.opt_rmo.opt.yml/witness.yml [2024-06-27 22:19:46,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:19:46,778 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:19:46,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:19:46,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:19:46,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:19:46,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:19:46" (1/2) ... [2024-06-27 22:19:46,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d7f167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:19:46, skipping insertion in model container [2024-06-27 22:19:46,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:19:46" (1/2) ... [2024-06-27 22:19:46,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c3ea625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:19:46, skipping insertion in model container [2024-06-27 22:19:46,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:19:46" (2/2) ... [2024-06-27 22:19:46,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d7f167 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:19:46, skipping insertion in model container [2024-06-27 22:19:46,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:19:46" (2/2) ... [2024-06-27 22:19:46,788 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:19:46,811 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:19:46,812 INFO L97 edCorrectnessWitness]: Location invariant before [L844-L844] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:19:46,813 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:19:46,813 INFO L97 edCorrectnessWitness]: Location invariant before [L847-L847] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:19:46,813 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:19:46,813 INFO L106 edCorrectnessWitness]: ghost_update [L842-L842] multithreaded = 1; [2024-06-27 22:19:46,853 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:19:46,966 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/mix035_power.opt_rmo.opt.i[1001,1014] [2024-06-27 22:19:47,129 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:19:47,141 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:19:47,167 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/mix035_power.opt_rmo.opt.i[1001,1014] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:19:47,265 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:19:47,298 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:19:47,300 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:19:47 WrapperNode [2024-06-27 22:19:47,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:19:47,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:19:47,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:19:47,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:19:47,307 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:19:47" (1/1) ... [2024-06-27 22:19:47,338 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:19:47" (1/1) ... [2024-06-27 22:19:47,377 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2024-06-27 22:19:47,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:19:47,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:19:47,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:19:47,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:19:47,389 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:19:47" (1/1) ... [2024-06-27 22:19:47,389 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:19:47" (1/1) ... [2024-06-27 22:19:47,393 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:19:47" (1/1) ... [2024-06-27 22:19:47,408 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:19:47,411 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:19:47" (1/1) ... [2024-06-27 22:19:47,411 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:19:47" (1/1) ... [2024-06-27 22:19:47,420 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:19:47" (1/1) ... [2024-06-27 22:19:47,438 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:19:47" (1/1) ... [2024-06-27 22:19:47,440 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:19:47" (1/1) ... [2024-06-27 22:19:47,446 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:19:47" (1/1) ... [2024-06-27 22:19:47,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:19:47,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:19:47,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:19:47,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:19:47,454 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:19:47" (1/1) ... [2024-06-27 22:19:47,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:19:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:19:47,479 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:19:47,496 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:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:19:47,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:19:47,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:19:47,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:19:47,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:19:47,509 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:19:47,651 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:19:47,654 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:19:48,084 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:19:48,084 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:19:48,176 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:19:48,176 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:19:48,176 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:19:48 BoogieIcfgContainer [2024-06-27 22:19:48,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:19:48,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:19:48,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:19:48,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:19:48,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:19:46" (1/4) ... [2024-06-27 22:19:48,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29766c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:19:48, skipping insertion in model container [2024-06-27 22:19:48,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:19:46" (2/4) ... [2024-06-27 22:19:48,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29766c33 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:19:48, skipping insertion in model container [2024-06-27 22:19:48,208 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:19:47" (3/4) ... [2024-06-27 22:19:48,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29766c33 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:19:48, skipping insertion in model container [2024-06-27 22:19:48,208 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:19:48" (4/4) ... [2024-06-27 22:19:48,209 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2024-06-27 22:19:48,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:19:48,239 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:19:48,239 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:19:48,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:19:48,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:19:48,350 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 22:19:48,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:19:48,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-06-27 22:19:48,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:19:48,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-06-27 22:19:48,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:19:48,383 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;@3832b5b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:19:48,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:19:48,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:19:48,386 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:19:48,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:19:48,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:48,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:19:48,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:48,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 354490088, now seen corresponding path program 1 times [2024-06-27 22:19:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:48,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969835818] [2024-06-27 22:19:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:49,821 INFO 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:19:49,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:49,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969835818] [2024-06-27 22:19:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969835818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:49,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:19:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655566955] [2024-06-27 22:19:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:19:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:19:49,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:19:49,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-06-27 22:19:49,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:19:49,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:49,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-06-27 22:19:49,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:50,570 INFO L124 PetriNetUnfolderBase]: 3107/5154 cut-off events. [2024-06-27 22:19:50,570 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-27 22:19:50,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9723 conditions, 5154 events. 3107/5154 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 33570 event pairs, 2532 based on Foata normal form. 150/4823 useless extension candidates. Maximal degree in co-relation 9711. Up to 4482 conditions per place. [2024-06-27 22:19:50,599 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 40 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-06-27 22:19:50,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 219 flow [2024-06-27 22:19:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:19:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:19:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-27 22:19:50,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7013888888888888 [2024-06-27 22:19:50,610 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 101 transitions. [2024-06-27 22:19:50,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 219 flow [2024-06-27 22:19:50,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:50,617 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 126 flow [2024-06-27 22:19:50,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-27 22:19:50,621 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-06-27 22:19:50,622 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 126 flow [2024-06-27 22:19:50,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:19:50,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:50,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:50,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:19:50,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:50,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1362801817, now seen corresponding path program 1 times [2024-06-27 22:19:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500098443] [2024-06-27 22:19:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500098443] [2024-06-27 22:19:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500098443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:51,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:51,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:19:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138271924] [2024-06-27 22:19:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:51,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:19:51,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:19:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:19:51,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:19:51,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:19:51,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:51,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:19:51,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:52,194 INFO L124 PetriNetUnfolderBase]: 3596/5776 cut-off events. [2024-06-27 22:19:52,194 INFO L125 PetriNetUnfolderBase]: For 784/784 co-relation queries the response was YES. [2024-06-27 22:19:52,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12296 conditions, 5776 events. 3596/5776 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 36252 event pairs, 2118 based on Foata normal form. 3/5319 useless extension candidates. Maximal degree in co-relation 12284. Up to 5144 conditions per place. [2024-06-27 22:19:52,221 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 52 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2024-06-27 22:19:52,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 306 flow [2024-06-27 22:19:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:19:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:19:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-27 22:19:52,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2024-06-27 22:19:52,225 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 126 flow. Second operand 4 states and 127 transitions. [2024-06-27 22:19:52,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 306 flow [2024-06-27 22:19:52,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:19:52,228 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 164 flow [2024-06-27 22:19:52,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-27 22:19:52,229 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-06-27 22:19:52,229 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 164 flow [2024-06-27 22:19:52,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:19:52,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:52,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:52,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:19:52,232 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:52,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -702815265, now seen corresponding path program 1 times [2024-06-27 22:19:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:52,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157884420] [2024-06-27 22:19:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:53,501 INFO 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:19:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157884420] [2024-06-27 22:19:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157884420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:19:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724882871] [2024-06-27 22:19:53,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:53,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:19:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:53,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:19:53,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:19:53,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:19:53,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:19:53,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:53,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:19:53,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:54,232 INFO L124 PetriNetUnfolderBase]: 3562/5813 cut-off events. [2024-06-27 22:19:54,232 INFO L125 PetriNetUnfolderBase]: For 2254/2254 co-relation queries the response was YES. [2024-06-27 22:19:54,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13486 conditions, 5813 events. 3562/5813 cut-off events. For 2254/2254 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 37291 event pairs, 2216 based on Foata normal form. 3/5371 useless extension candidates. Maximal degree in co-relation 13472. Up to 5073 conditions per place. [2024-06-27 22:19:54,269 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2024-06-27 22:19:54,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 402 flow [2024-06-27 22:19:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:19:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:19:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-06-27 22:19:54,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6541666666666667 [2024-06-27 22:19:54,271 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 164 flow. Second operand 5 states and 157 transitions. [2024-06-27 22:19:54,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 402 flow [2024-06-27 22:19:54,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 388 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:54,274 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 202 flow [2024-06-27 22:19:54,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-06-27 22:19:54,275 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2024-06-27 22:19:54,275 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 202 flow [2024-06-27 22:19:54,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:19:54,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:54,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:54,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:19:54,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:54,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1482253488, now seen corresponding path program 1 times [2024-06-27 22:19:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288375337] [2024-06-27 22:19:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:55,921 INFO 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:19:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288375337] [2024-06-27 22:19:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288375337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:19:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825805119] [2024-06-27 22:19:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:55,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:19:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:19:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:19:56,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:19:56,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:56,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:56,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:19:56,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:56,769 INFO L124 PetriNetUnfolderBase]: 3508/5698 cut-off events. [2024-06-27 22:19:56,769 INFO L125 PetriNetUnfolderBase]: For 3923/3923 co-relation queries the response was YES. [2024-06-27 22:19:56,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14339 conditions, 5698 events. 3508/5698 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36172 event pairs, 1770 based on Foata normal form. 6/5291 useless extension candidates. Maximal degree in co-relation 14324. Up to 4945 conditions per place. [2024-06-27 22:19:56,800 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 71 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2024-06-27 22:19:56,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 474 flow [2024-06-27 22:19:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:19:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:19:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-27 22:19:56,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-06-27 22:19:56,802 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 202 flow. Second operand 6 states and 183 transitions. [2024-06-27 22:19:56,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 474 flow [2024-06-27 22:19:56,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 450 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:56,806 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 223 flow [2024-06-27 22:19:56,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-06-27 22:19:56,807 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2024-06-27 22:19:56,807 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 223 flow [2024-06-27 22:19:56,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:56,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:56,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:56,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:19:56,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:56,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash 617691897, now seen corresponding path program 1 times [2024-06-27 22:19:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73552751] [2024-06-27 22:19:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:57,683 INFO 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:19:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73552751] [2024-06-27 22:19:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73552751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:19:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685553449] [2024-06-27 22:19:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:57,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:19:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:19:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:19:57,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-06-27 22:19:57,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 223 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:19:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:57,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-06-27 22:19:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:58,341 INFO L124 PetriNetUnfolderBase]: 3410/5596 cut-off events. [2024-06-27 22:19:58,341 INFO L125 PetriNetUnfolderBase]: For 6167/6167 co-relation queries the response was YES. [2024-06-27 22:19:58,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14808 conditions, 5596 events. 3410/5596 cut-off events. For 6167/6167 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 36363 event pairs, 2183 based on Foata normal form. 2/5196 useless extension candidates. Maximal degree in co-relation 14791. Up to 4891 conditions per place. [2024-06-27 22:19:58,368 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 54 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-27 22:19:58,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 439 flow [2024-06-27 22:19:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:19:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:19:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-06-27 22:19:58,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 22:19:58,369 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 223 flow. Second operand 5 states and 132 transitions. [2024-06-27 22:19:58,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 439 flow [2024-06-27 22:19:58,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 398 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:58,373 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 291 flow [2024-06-27 22:19:58,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-06-27 22:19:58,373 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2024-06-27 22:19:58,374 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 291 flow [2024-06-27 22:19:58,374 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:19:58,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:58,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:58,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:19:58,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:58,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1888014974, now seen corresponding path program 1 times [2024-06-27 22:19:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:58,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044996949] [2024-06-27 22:19:58,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:59,386 INFO 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:19:59,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:59,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044996949] [2024-06-27 22:19:59,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044996949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:59,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:59,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:19:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72839421] [2024-06-27 22:19:59,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:59,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:19:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:19:59,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:19:59,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:19:59,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:19:59,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:59,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:19:59,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:00,278 INFO L124 PetriNetUnfolderBase]: 4049/6566 cut-off events. [2024-06-27 22:20:00,279 INFO L125 PetriNetUnfolderBase]: For 9043/9043 co-relation queries the response was YES. [2024-06-27 22:20:00,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18408 conditions, 6566 events. 4049/6566 cut-off events. For 9043/9043 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 42461 event pairs, 2421 based on Foata normal form. 2/6131 useless extension candidates. Maximal degree in co-relation 18386. Up to 5759 conditions per place. [2024-06-27 22:20:00,309 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 73 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2024-06-27 22:20:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 617 flow [2024-06-27 22:20:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 22:20:00,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327380952380952 [2024-06-27 22:20:00,311 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 291 flow. Second operand 7 states and 179 transitions. [2024-06-27 22:20:00,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 617 flow [2024-06-27 22:20:00,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 607 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-27 22:20:00,319 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 431 flow [2024-06-27 22:20:00,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2024-06-27 22:20:00,321 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2024-06-27 22:20:00,322 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 431 flow [2024-06-27 22:20:00,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:20:00,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:00,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:00,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:20:00,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:00,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash 890711832, now seen corresponding path program 2 times [2024-06-27 22:20:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568775187] [2024-06-27 22:20:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:01,262 INFO 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:20:01,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568775187] [2024-06-27 22:20:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568775187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:01,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746369988] [2024-06-27 22:20:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:01,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:01,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:01,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:01,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:01,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:02,281 INFO L124 PetriNetUnfolderBase]: 4697/7511 cut-off events. [2024-06-27 22:20:02,281 INFO L125 PetriNetUnfolderBase]: For 14878/14878 co-relation queries the response was YES. [2024-06-27 22:20:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22886 conditions, 7511 events. 4697/7511 cut-off events. For 14878/14878 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 48457 event pairs, 2800 based on Foata normal form. 2/7026 useless extension candidates. Maximal degree in co-relation 22859. Up to 6651 conditions per place. [2024-06-27 22:20:02,317 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 73 selfloop transitions, 29 changer transitions 0/112 dead transitions. [2024-06-27 22:20:02,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 799 flow [2024-06-27 22:20:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:20:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:20:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-27 22:20:02,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:20:02,318 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 431 flow. Second operand 6 states and 150 transitions. [2024-06-27 22:20:02,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 799 flow [2024-06-27 22:20:02,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 112 transitions, 757 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 22:20:02,328 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 581 flow [2024-06-27 22:20:02,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=78, PETRI_TRANSITIONS=92} [2024-06-27 22:20:02,329 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2024-06-27 22:20:02,329 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 581 flow [2024-06-27 22:20:02,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:02,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:02,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:02,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:20:02,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:02,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash 896455512, now seen corresponding path program 3 times [2024-06-27 22:20:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251222073] [2024-06-27 22:20:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:03,387 INFO 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:20:03,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251222073] [2024-06-27 22:20:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251222073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732500654] [2024-06-27 22:20:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:03,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:03,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:03,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 92 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:20:03,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:03,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:03,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:04,286 INFO L124 PetriNetUnfolderBase]: 4090/6626 cut-off events. [2024-06-27 22:20:04,286 INFO L125 PetriNetUnfolderBase]: For 17443/17443 co-relation queries the response was YES. [2024-06-27 22:20:04,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21510 conditions, 6626 events. 4090/6626 cut-off events. For 17443/17443 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 42816 event pairs, 2391 based on Foata normal form. 2/6199 useless extension candidates. Maximal degree in co-relation 21480. Up to 5763 conditions per place. [2024-06-27 22:20:04,325 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 65 selfloop transitions, 40 changer transitions 0/116 dead transitions. [2024-06-27 22:20:04,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 891 flow [2024-06-27 22:20:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:20:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:20:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-27 22:20:04,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2024-06-27 22:20:04,328 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 581 flow. Second operand 6 states and 155 transitions. [2024-06-27 22:20:04,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 891 flow [2024-06-27 22:20:04,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 852 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:20:04,342 INFO L231 Difference]: Finished difference. Result has 83 places, 96 transitions, 679 flow [2024-06-27 22:20:04,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=679, PETRI_PLACES=83, PETRI_TRANSITIONS=96} [2024-06-27 22:20:04,344 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2024-06-27 22:20:04,344 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 96 transitions, 679 flow [2024-06-27 22:20:04,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:20:04,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:04,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:20:04,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:04,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 896464440, now seen corresponding path program 1 times [2024-06-27 22:20:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542561461] [2024-06-27 22:20:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:05,939 INFO 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:20:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542561461] [2024-06-27 22:20:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542561461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115045477] [2024-06-27 22:20:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:05,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:06,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:06,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 96 transitions, 679 flow. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:20:06,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:06,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:06,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:07,117 INFO L124 PetriNetUnfolderBase]: 4169/6756 cut-off events. [2024-06-27 22:20:07,117 INFO L125 PetriNetUnfolderBase]: For 22798/22798 co-relation queries the response was YES. [2024-06-27 22:20:07,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22987 conditions, 6756 events. 4169/6756 cut-off events. For 22798/22798 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 43718 event pairs, 2466 based on Foata normal form. 2/6334 useless extension candidates. Maximal degree in co-relation 22954. Up to 5927 conditions per place. [2024-06-27 22:20:07,157 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 101 selfloop transitions, 19 changer transitions 1/132 dead transitions. [2024-06-27 22:20:07,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 132 transitions, 1063 flow [2024-06-27 22:20:07,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:20:07,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:20:07,159 INFO L175 Difference]: Start difference. First operand has 83 places, 96 transitions, 679 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:20:07,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 132 transitions, 1063 flow [2024-06-27 22:20:07,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 951 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:07,171 INFO L231 Difference]: Finished difference. Result has 88 places, 103 transitions, 676 flow [2024-06-27 22:20:07,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=88, PETRI_TRANSITIONS=103} [2024-06-27 22:20:07,172 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2024-06-27 22:20:07,172 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 103 transitions, 676 flow [2024-06-27 22:20:07,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:20:07,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:07,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:07,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:20:07,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:07,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash 303300372, now seen corresponding path program 1 times [2024-06-27 22:20:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666370216] [2024-06-27 22:20:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:08,356 INFO 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:20:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666370216] [2024-06-27 22:20:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666370216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769434257] [2024-06-27 22:20:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:08,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:08,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:08,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 103 transitions, 676 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:20:08,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:08,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:08,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:09,560 INFO L124 PetriNetUnfolderBase]: 4714/7334 cut-off events. [2024-06-27 22:20:09,561 INFO L125 PetriNetUnfolderBase]: For 29341/29341 co-relation queries the response was YES. [2024-06-27 22:20:09,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27083 conditions, 7334 events. 4714/7334 cut-off events. For 29341/29341 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 45484 event pairs, 1924 based on Foata normal form. 2/6986 useless extension candidates. Maximal degree in co-relation 27048. Up to 6601 conditions per place. [2024-06-27 22:20:09,598 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 92 selfloop transitions, 42 changer transitions 0/146 dead transitions. [2024-06-27 22:20:09,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 146 transitions, 1124 flow [2024-06-27 22:20:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 22:20:09,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:20:09,600 INFO L175 Difference]: Start difference. First operand has 88 places, 103 transitions, 676 flow. Second operand 7 states and 186 transitions. [2024-06-27 22:20:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 146 transitions, 1124 flow [2024-06-27 22:20:09,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 146 transitions, 1068 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:09,614 INFO L231 Difference]: Finished difference. Result has 91 places, 114 transitions, 854 flow [2024-06-27 22:20:09,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=854, PETRI_PLACES=91, PETRI_TRANSITIONS=114} [2024-06-27 22:20:09,615 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 37 predicate places. [2024-06-27 22:20:09,615 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 854 flow [2024-06-27 22:20:09,615 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:20:09,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:09,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:09,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:20:09,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:09,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1842143094, now seen corresponding path program 2 times [2024-06-27 22:20:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:09,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371112534] [2024-06-27 22:20:09,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371112534] [2024-06-27 22:20:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371112534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895348670] [2024-06-27 22:20:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:10,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:10,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:11,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:11,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 854 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:20:11,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:11,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:11,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:12,287 INFO L124 PetriNetUnfolderBase]: 4805/7761 cut-off events. [2024-06-27 22:20:12,288 INFO L125 PetriNetUnfolderBase]: For 39139/39139 co-relation queries the response was YES. [2024-06-27 22:20:12,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30304 conditions, 7761 events. 4805/7761 cut-off events. For 39139/39139 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 50798 event pairs, 2136 based on Foata normal form. 2/7303 useless extension candidates. Maximal degree in co-relation 30268. Up to 6735 conditions per place. [2024-06-27 22:20:12,336 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 110 selfloop transitions, 45 changer transitions 1/168 dead transitions. [2024-06-27 22:20:12,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 168 transitions, 1492 flow [2024-06-27 22:20:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 22:20:12,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 22:20:12,339 INFO L175 Difference]: Start difference. First operand has 91 places, 114 transitions, 854 flow. Second operand 8 states and 204 transitions. [2024-06-27 22:20:12,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 168 transitions, 1492 flow [2024-06-27 22:20:12,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 168 transitions, 1364 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:12,375 INFO L231 Difference]: Finished difference. Result has 97 places, 132 transitions, 1069 flow [2024-06-27 22:20:12,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1069, PETRI_PLACES=97, PETRI_TRANSITIONS=132} [2024-06-27 22:20:12,375 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2024-06-27 22:20:12,376 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 132 transitions, 1069 flow [2024-06-27 22:20:12,376 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:20:12,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:12,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:12,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:20:12,376 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:12,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1842263994, now seen corresponding path program 3 times [2024-06-27 22:20:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277375760] [2024-06-27 22:20:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:13,766 INFO 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:20:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277375760] [2024-06-27 22:20:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277375760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184766813] [2024-06-27 22:20:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:13,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:13,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:13,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:13,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 132 transitions, 1069 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:20:13,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:13,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:13,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:15,174 INFO L124 PetriNetUnfolderBase]: 4837/7817 cut-off events. [2024-06-27 22:20:15,174 INFO L125 PetriNetUnfolderBase]: For 47490/47490 co-relation queries the response was YES. [2024-06-27 22:20:15,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31856 conditions, 7817 events. 4837/7817 cut-off events. For 47490/47490 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 51097 event pairs, 2138 based on Foata normal form. 2/7359 useless extension candidates. Maximal degree in co-relation 31818. Up to 6766 conditions per place. [2024-06-27 22:20:15,221 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 107 selfloop transitions, 55 changer transitions 0/174 dead transitions. [2024-06-27 22:20:15,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 174 transitions, 1669 flow [2024-06-27 22:20:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 22:20:15,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130208333333334 [2024-06-27 22:20:15,223 INFO L175 Difference]: Start difference. First operand has 97 places, 132 transitions, 1069 flow. Second operand 8 states and 197 transitions. [2024-06-27 22:20:15,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 174 transitions, 1669 flow [2024-06-27 22:20:15,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 174 transitions, 1550 flow, removed 39 selfloop flow, removed 2 redundant places. [2024-06-27 22:20:15,252 INFO L231 Difference]: Finished difference. Result has 105 places, 148 transitions, 1335 flow [2024-06-27 22:20:15,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1335, PETRI_PLACES=105, PETRI_TRANSITIONS=148} [2024-06-27 22:20:15,252 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 51 predicate places. [2024-06-27 22:20:15,253 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 148 transitions, 1335 flow [2024-06-27 22:20:15,253 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:20:15,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:15,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:20:15,253 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:15,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2020318074, now seen corresponding path program 4 times [2024-06-27 22:20:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820043525] [2024-06-27 22:20:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:16,856 INFO 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:20:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820043525] [2024-06-27 22:20:16,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820043525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:16,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:16,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:16,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073841897] [2024-06-27 22:20:16,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:16,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:17,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:17,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 148 transitions, 1335 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:20:17,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:17,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:17,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:18,144 INFO L124 PetriNetUnfolderBase]: 4832/7833 cut-off events. [2024-06-27 22:20:18,144 INFO L125 PetriNetUnfolderBase]: For 57569/57569 co-relation queries the response was YES. [2024-06-27 22:20:18,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33432 conditions, 7833 events. 4832/7833 cut-off events. For 57569/57569 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 51382 event pairs, 2124 based on Foata normal form. 2/7377 useless extension candidates. Maximal degree in co-relation 33390. Up to 6680 conditions per place. [2024-06-27 22:20:18,201 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 92 selfloop transitions, 74 changer transitions 0/178 dead transitions. [2024-06-27 22:20:18,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 178 transitions, 1815 flow [2024-06-27 22:20:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 22:20:18,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-27 22:20:18,203 INFO L175 Difference]: Start difference. First operand has 105 places, 148 transitions, 1335 flow. Second operand 7 states and 182 transitions. [2024-06-27 22:20:18,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 178 transitions, 1815 flow [2024-06-27 22:20:18,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 178 transitions, 1728 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-27 22:20:18,238 INFO L231 Difference]: Finished difference. Result has 110 places, 152 transitions, 1483 flow [2024-06-27 22:20:18,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1483, PETRI_PLACES=110, PETRI_TRANSITIONS=152} [2024-06-27 22:20:18,239 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2024-06-27 22:20:18,239 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 152 transitions, 1483 flow [2024-06-27 22:20:18,239 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:20:18,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:18,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:18,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:20:18,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:18,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1348394712, now seen corresponding path program 1 times [2024-06-27 22:20:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:18,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464676132] [2024-06-27 22:20:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:18,290 INFO 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:20:18,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464676132] [2024-06-27 22:20:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464676132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:18,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:20:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386213274] [2024-06-27 22:20:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:18,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:20:18,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:20:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:20:18,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 48 [2024-06-27 22:20:18,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 152 transitions, 1483 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:18,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:18,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 48 [2024-06-27 22:20:18,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:18,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L791-->L798: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_31 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_85 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_86 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~x$w_buff1_used~0_78 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_30 256) 0)))) 0 v_~x$r_buff1_thd2~0_26) v_~x$r_buff1_thd2~0_25) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_31) v_~x$r_buff0_thd2~0_30) (= (ite .cse4 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85) (= v_~x~0_62 (ite .cse4 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_63)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_31, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][85], [201#true, 189#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~weak$$choice2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~weak$$choice0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 199#(and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (or (and (= ~x$flush_delayed~0 0) (or (and (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EAX~0 0) (<= ~weak$$choice2~0 1) (= ~x$mem_tmp~0 0)) (and (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~x$mem_tmp~0 0)))) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~weak$$choice2~0 256)) (<= (+ (* 256 (div ~x$w_buff0_used~0 256)) ~x$w_buff1_used~0) ~x$w_buff0_used~0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice2~0 1) (<= ~x$w_buff0_used~0 0) (<= 0 (div ~x$w_buff1_used~0 256)) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 84#true, Black: 131#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 133#(and (= 0 ~x$w_buff1~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~a~0 0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), 94#true, Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 146#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= ~__unbuffered_p0_EAX~0 ~x~0) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff1~0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (<= 0 ~x$r_buff1_thd1~0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (or (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x~0 0) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= ~__unbuffered_p0_EAX~0 ~x~0) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~x$r_buff1_thd1~0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), 21#L751true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 88#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 99#(and (= ~x$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$w_buff0_used~0 1)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 160#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice2~0 1) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (or (and (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1)) (= |#ghost~multithreaded| 0)) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (<= 0 ~x$r_buff1_thd1~0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), 36#L798true, 171#true, 27#L808true, Black: 111#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~x$r_buff1_thd1~0 0))) (= ~a~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (or (and (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1)) (= |#ghost~multithreaded| 0)) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), 11#L851true, P0Thread1of1ForFork0InUse, Black: 185#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (or (and (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= ~weak$$choice2~0 1) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1)), Black: 176#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1)), Black: 122#(and (= ~x$w_buff0~0 1) (= 1 ~x$r_buff0_thd2~0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~a~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~weak$$choice2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~a~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~weak$$choice0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 22:20:18,491 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 22:20:18,491 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:20:18,491 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:20:18,491 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:20:18,670 INFO L124 PetriNetUnfolderBase]: 1698/3503 cut-off events. [2024-06-27 22:20:18,670 INFO L125 PetriNetUnfolderBase]: For 25262/25827 co-relation queries the response was YES. [2024-06-27 22:20:18,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14307 conditions, 3503 events. 1698/3503 cut-off events. For 25262/25827 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 26222 event pairs, 576 based on Foata normal form. 42/3219 useless extension candidates. Maximal degree in co-relation 14264. Up to 1945 conditions per place. [2024-06-27 22:20:18,694 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 76 selfloop transitions, 15 changer transitions 0/163 dead transitions. [2024-06-27 22:20:18,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 163 transitions, 1707 flow [2024-06-27 22:20:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:20:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:20:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-06-27 22:20:18,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-06-27 22:20:18,695 INFO L175 Difference]: Start difference. First operand has 110 places, 152 transitions, 1483 flow. Second operand 3 states and 111 transitions. [2024-06-27 22:20:18,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 163 transitions, 1707 flow [2024-06-27 22:20:18,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 163 transitions, 1504 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:18,710 INFO L231 Difference]: Finished difference. Result has 106 places, 151 transitions, 1300 flow [2024-06-27 22:20:18,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=106, PETRI_TRANSITIONS=151} [2024-06-27 22:20:18,711 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 52 predicate places. [2024-06-27 22:20:18,711 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 151 transitions, 1300 flow [2024-06-27 22:20:18,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:18,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:18,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:18,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:20:18,712 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:18,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2020595121, now seen corresponding path program 1 times [2024-06-27 22:20:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:18,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757234005] [2024-06-27 22:20:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:20,118 INFO 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:20:20,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757234005] [2024-06-27 22:20:20,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757234005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:20,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810045064] [2024-06-27 22:20:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:20,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:20,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:20,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 151 transitions, 1300 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:20,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:20,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:20,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:21,401 INFO L124 PetriNetUnfolderBase]: 4524/7317 cut-off events. [2024-06-27 22:20:21,401 INFO L125 PetriNetUnfolderBase]: For 61659/61659 co-relation queries the response was YES. [2024-06-27 22:20:21,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31072 conditions, 7317 events. 4524/7317 cut-off events. For 61659/61659 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 46368 event pairs, 2378 based on Foata normal form. 4/7138 useless extension candidates. Maximal degree in co-relation 31029. Up to 6357 conditions per place. [2024-06-27 22:20:21,444 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 159 selfloop transitions, 32 changer transitions 6/207 dead transitions. [2024-06-27 22:20:21,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 207 transitions, 2018 flow [2024-06-27 22:20:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-06-27 22:20:21,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976851851851852 [2024-06-27 22:20:21,446 INFO L175 Difference]: Start difference. First operand has 106 places, 151 transitions, 1300 flow. Second operand 9 states and 215 transitions. [2024-06-27 22:20:21,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 207 transitions, 2018 flow [2024-06-27 22:20:21,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 207 transitions, 1988 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:20:21,473 INFO L231 Difference]: Finished difference. Result has 116 places, 161 transitions, 1546 flow [2024-06-27 22:20:21,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1546, PETRI_PLACES=116, PETRI_TRANSITIONS=161} [2024-06-27 22:20:21,474 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 62 predicate places. [2024-06-27 22:20:21,474 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 1546 flow [2024-06-27 22:20:21,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:21,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:21,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:20:21,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:21,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1348357436, now seen corresponding path program 1 times [2024-06-27 22:20:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563156148] [2024-06-27 22:20:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563156148] [2024-06-27 22:20:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563156148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:22,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:22,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:20:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425009295] [2024-06-27 22:20:22,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:22,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:20:22,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:20:22,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:20:22,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:22,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 161 transitions, 1546 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:20:22,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:22,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:22,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:23,326 INFO L124 PetriNetUnfolderBase]: 3446/5931 cut-off events. [2024-06-27 22:20:23,326 INFO L125 PetriNetUnfolderBase]: For 53915/53915 co-relation queries the response was YES. [2024-06-27 22:20:23,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26207 conditions, 5931 events. 3446/5931 cut-off events. For 53915/53915 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 38921 event pairs, 1800 based on Foata normal form. 1/5735 useless extension candidates. Maximal degree in co-relation 26159. Up to 4936 conditions per place. [2024-06-27 22:20:23,364 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 154 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2024-06-27 22:20:23,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 178 transitions, 1956 flow [2024-06-27 22:20:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:20:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:20:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-06-27 22:20:23,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-27 22:20:23,367 INFO L175 Difference]: Start difference. First operand has 116 places, 161 transitions, 1546 flow. Second operand 5 states and 124 transitions. [2024-06-27 22:20:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 178 transitions, 1956 flow [2024-06-27 22:20:23,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 178 transitions, 1831 flow, removed 56 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:23,404 INFO L231 Difference]: Finished difference. Result has 117 places, 164 transitions, 1484 flow [2024-06-27 22:20:23,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1484, PETRI_PLACES=117, PETRI_TRANSITIONS=164} [2024-06-27 22:20:23,405 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 63 predicate places. [2024-06-27 22:20:23,405 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 164 transitions, 1484 flow [2024-06-27 22:20:23,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:20:23,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:23,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:20:23,405 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:23,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash -706901013, now seen corresponding path program 1 times [2024-06-27 22:20:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039111702] [2024-06-27 22:20:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:24,754 INFO 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:20:24,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:24,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039111702] [2024-06-27 22:20:24,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039111702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:24,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239970060] [2024-06-27 22:20:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:24,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:24,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:24,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:24,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 164 transitions, 1484 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:24,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:24,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:24,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:25,997 INFO L124 PetriNetUnfolderBase]: 4007/6562 cut-off events. [2024-06-27 22:20:25,998 INFO L125 PetriNetUnfolderBase]: For 64773/64773 co-relation queries the response was YES. [2024-06-27 22:20:26,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30103 conditions, 6562 events. 4007/6562 cut-off events. For 64773/64773 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 41323 event pairs, 1900 based on Foata normal form. 2/6408 useless extension candidates. Maximal degree in co-relation 30053. Up to 5621 conditions per place. [2024-06-27 22:20:26,045 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 164 selfloop transitions, 54 changer transitions 0/228 dead transitions. [2024-06-27 22:20:26,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 228 transitions, 2307 flow [2024-06-27 22:20:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:20:26,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162037037037037 [2024-06-27 22:20:26,046 INFO L175 Difference]: Start difference. First operand has 117 places, 164 transitions, 1484 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:20:26,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 228 transitions, 2307 flow [2024-06-27 22:20:26,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 228 transitions, 2278 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:26,109 INFO L231 Difference]: Finished difference. Result has 125 places, 182 transitions, 1849 flow [2024-06-27 22:20:26,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1849, PETRI_PLACES=125, PETRI_TRANSITIONS=182} [2024-06-27 22:20:26,110 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 71 predicate places. [2024-06-27 22:20:26,110 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 182 transitions, 1849 flow [2024-06-27 22:20:26,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:26,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:26,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:26,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:20:26,111 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:26,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1659141117, now seen corresponding path program 2 times [2024-06-27 22:20:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890312195] [2024-06-27 22:20:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:27,679 INFO 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:20:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890312195] [2024-06-27 22:20:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890312195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346288496] [2024-06-27 22:20:27,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:27,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:27,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:27,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 182 transitions, 1849 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:20:27,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:27,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:27,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:29,022 INFO L124 PetriNetUnfolderBase]: 4069/6650 cut-off events. [2024-06-27 22:20:29,023 INFO L125 PetriNetUnfolderBase]: For 76346/76346 co-relation queries the response was YES. [2024-06-27 22:20:29,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32508 conditions, 6650 events. 4069/6650 cut-off events. For 76346/76346 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 41884 event pairs, 1865 based on Foata normal form. 2/6493 useless extension candidates. Maximal degree in co-relation 32454. Up to 5695 conditions per place. [2024-06-27 22:20:29,072 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 170 selfloop transitions, 61 changer transitions 0/241 dead transitions. [2024-06-27 22:20:29,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 241 transitions, 2810 flow [2024-06-27 22:20:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 22:20:29,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 22:20:29,074 INFO L175 Difference]: Start difference. First operand has 125 places, 182 transitions, 1849 flow. Second operand 9 states and 212 transitions. [2024-06-27 22:20:29,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 241 transitions, 2810 flow [2024-06-27 22:20:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 241 transitions, 2594 flow, removed 92 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:29,137 INFO L231 Difference]: Finished difference. Result has 133 places, 203 transitions, 2204 flow [2024-06-27 22:20:29,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2204, PETRI_PLACES=133, PETRI_TRANSITIONS=203} [2024-06-27 22:20:29,137 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 79 predicate places. [2024-06-27 22:20:29,138 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 203 transitions, 2204 flow [2024-06-27 22:20:29,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:20:29,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:29,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:29,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:20:29,138 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:29,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1794641193, now seen corresponding path program 3 times [2024-06-27 22:20:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316324208] [2024-06-27 22:20:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:30,592 INFO 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:20:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316324208] [2024-06-27 22:20:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316324208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:30,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:30,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884698775] [2024-06-27 22:20:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:30,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:30,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:30,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 203 transitions, 2204 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:20:30,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:30,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:30,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:31,791 INFO L124 PetriNetUnfolderBase]: 4125/6708 cut-off events. [2024-06-27 22:20:31,791 INFO L125 PetriNetUnfolderBase]: For 88454/88460 co-relation queries the response was YES. [2024-06-27 22:20:31,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34553 conditions, 6708 events. 4125/6708 cut-off events. For 88454/88460 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 42124 event pairs, 1863 based on Foata normal form. 8/6555 useless extension candidates. Maximal degree in co-relation 34495. Up to 5674 conditions per place. [2024-06-27 22:20:31,856 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 152 selfloop transitions, 93 changer transitions 0/255 dead transitions. [2024-06-27 22:20:31,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 255 transitions, 3046 flow [2024-06-27 22:20:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-06-27 22:20:31,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2024-06-27 22:20:31,864 INFO L175 Difference]: Start difference. First operand has 133 places, 203 transitions, 2204 flow. Second operand 9 states and 214 transitions. [2024-06-27 22:20:31,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 255 transitions, 3046 flow [2024-06-27 22:20:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 255 transitions, 2918 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:31,944 INFO L231 Difference]: Finished difference. Result has 139 places, 217 transitions, 2521 flow [2024-06-27 22:20:31,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2521, PETRI_PLACES=139, PETRI_TRANSITIONS=217} [2024-06-27 22:20:31,944 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 85 predicate places. [2024-06-27 22:20:31,945 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 217 transitions, 2521 flow [2024-06-27 22:20:31,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:20:31,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:31,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:31,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:20:31,945 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:31,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1616425607, now seen corresponding path program 4 times [2024-06-27 22:20:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:31,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411397982] [2024-06-27 22:20:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411397982] [2024-06-27 22:20:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411397982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670741177] [2024-06-27 22:20:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:33,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:33,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:33,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:33,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 217 transitions, 2521 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:33,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:33,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:33,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:34,698 INFO L124 PetriNetUnfolderBase]: 4148/6743 cut-off events. [2024-06-27 22:20:34,698 INFO L125 PetriNetUnfolderBase]: For 100277/100283 co-relation queries the response was YES. [2024-06-27 22:20:34,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36446 conditions, 6743 events. 4148/6743 cut-off events. For 100277/100283 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42259 event pairs, 1863 based on Foata normal form. 8/6590 useless extension candidates. Maximal degree in co-relation 36386. Up to 5706 conditions per place. [2024-06-27 22:20:34,756 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 152 selfloop transitions, 101 changer transitions 0/263 dead transitions. [2024-06-27 22:20:34,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 263 transitions, 3292 flow [2024-06-27 22:20:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 22:20:34,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-06-27 22:20:34,759 INFO L175 Difference]: Start difference. First operand has 139 places, 217 transitions, 2521 flow. Second operand 9 states and 213 transitions. [2024-06-27 22:20:34,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 263 transitions, 3292 flow [2024-06-27 22:20:34,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 263 transitions, 2987 flow, removed 105 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:34,856 INFO L231 Difference]: Finished difference. Result has 143 places, 225 transitions, 2574 flow [2024-06-27 22:20:34,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2574, PETRI_PLACES=143, PETRI_TRANSITIONS=225} [2024-06-27 22:20:34,857 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 89 predicate places. [2024-06-27 22:20:34,857 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 225 transitions, 2574 flow [2024-06-27 22:20:34,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:34,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:34,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:34,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:20:34,858 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:34,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1786070313, now seen corresponding path program 5 times [2024-06-27 22:20:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066452937] [2024-06-27 22:20:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:36,591 INFO 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:20:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066452937] [2024-06-27 22:20:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066452937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:36,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:36,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423991309] [2024-06-27 22:20:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:36,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:36,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:36,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 225 transitions, 2574 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:20:36,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:36,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:36,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:37,920 INFO L124 PetriNetUnfolderBase]: 4173/6706 cut-off events. [2024-06-27 22:20:37,920 INFO L125 PetriNetUnfolderBase]: For 100161/100167 co-relation queries the response was YES. [2024-06-27 22:20:37,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36805 conditions, 6706 events. 4173/6706 cut-off events. For 100161/100167 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 41479 event pairs, 1872 based on Foata normal form. 8/6573 useless extension candidates. Maximal degree in co-relation 36744. Up to 5698 conditions per place. [2024-06-27 22:20:37,978 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 190 selfloop transitions, 83 changer transitions 0/283 dead transitions. [2024-06-27 22:20:37,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 283 transitions, 3575 flow [2024-06-27 22:20:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2024-06-27 22:20:37,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48842592592592593 [2024-06-27 22:20:37,979 INFO L175 Difference]: Start difference. First operand has 143 places, 225 transitions, 2574 flow. Second operand 9 states and 211 transitions. [2024-06-27 22:20:37,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 283 transitions, 3575 flow [2024-06-27 22:20:38,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 283 transitions, 3329 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:38,146 INFO L231 Difference]: Finished difference. Result has 149 places, 247 transitions, 2912 flow [2024-06-27 22:20:38,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2912, PETRI_PLACES=149, PETRI_TRANSITIONS=247} [2024-06-27 22:20:38,147 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 95 predicate places. [2024-06-27 22:20:38,147 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 247 transitions, 2912 flow [2024-06-27 22:20:38,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:20:38,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:38,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:20:38,148 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:38,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1184552233, now seen corresponding path program 1 times [2024-06-27 22:20:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437071062] [2024-06-27 22:20:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:39,254 INFO 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:20:39,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437071062] [2024-06-27 22:20:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437071062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905255482] [2024-06-27 22:20:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:39,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:39,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 247 transitions, 2912 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:20:39,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:39,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:39,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:40,611 INFO L124 PetriNetUnfolderBase]: 4170/7071 cut-off events. [2024-06-27 22:20:40,611 INFO L125 PetriNetUnfolderBase]: For 107365/107365 co-relation queries the response was YES. [2024-06-27 22:20:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38177 conditions, 7071 events. 4170/7071 cut-off events. For 107365/107365 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 46450 event pairs, 2013 based on Foata normal form. 1/6852 useless extension candidates. Maximal degree in co-relation 38113. Up to 5938 conditions per place. [2024-06-27 22:20:40,674 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 243 selfloop transitions, 16 changer transitions 0/269 dead transitions. [2024-06-27 22:20:40,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 269 transitions, 3538 flow [2024-06-27 22:20:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:20:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:20:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 22:20:40,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-27 22:20:40,676 INFO L175 Difference]: Start difference. First operand has 149 places, 247 transitions, 2912 flow. Second operand 6 states and 141 transitions. [2024-06-27 22:20:40,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 269 transitions, 3538 flow [2024-06-27 22:20:40,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 269 transitions, 3401 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:40,769 INFO L231 Difference]: Finished difference. Result has 151 places, 250 transitions, 2847 flow [2024-06-27 22:20:40,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2775, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2847, PETRI_PLACES=151, PETRI_TRANSITIONS=250} [2024-06-27 22:20:40,770 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 97 predicate places. [2024-06-27 22:20:40,770 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 250 transitions, 2847 flow [2024-06-27 22:20:40,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:20:40,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:40,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:40,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:20:40,771 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:40,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:40,771 INFO L85 PathProgramCache]: Analyzing trace with hash 658049265, now seen corresponding path program 1 times [2024-06-27 22:20:40,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:40,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845184062] [2024-06-27 22:20:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:40,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:41,960 INFO 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:20:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:41,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845184062] [2024-06-27 22:20:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845184062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:41,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524483763] [2024-06-27 22:20:41,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:41,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:41,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:41,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:42,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:42,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 250 transitions, 2847 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:20:42,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:42,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:43,403 INFO L124 PetriNetUnfolderBase]: 4307/7062 cut-off events. [2024-06-27 22:20:43,403 INFO L125 PetriNetUnfolderBase]: For 132305/132309 co-relation queries the response was YES. [2024-06-27 22:20:43,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41039 conditions, 7062 events. 4307/7062 cut-off events. For 132305/132309 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 45613 event pairs, 1548 based on Foata normal form. 8/6900 useless extension candidates. Maximal degree in co-relation 40973. Up to 5941 conditions per place. [2024-06-27 22:20:43,468 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 237 selfloop transitions, 58 changer transitions 0/317 dead transitions. [2024-06-27 22:20:43,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 317 transitions, 3824 flow [2024-06-27 22:20:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2024-06-27 22:20:43,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145833333333333 [2024-06-27 22:20:43,470 INFO L175 Difference]: Start difference. First operand has 151 places, 250 transitions, 2847 flow. Second operand 10 states and 247 transitions. [2024-06-27 22:20:43,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 317 transitions, 3824 flow [2024-06-27 22:20:43,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 317 transitions, 3780 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:43,568 INFO L231 Difference]: Finished difference. Result has 160 places, 272 transitions, 3246 flow [2024-06-27 22:20:43,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2803, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3246, PETRI_PLACES=160, PETRI_TRANSITIONS=272} [2024-06-27 22:20:43,569 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 106 predicate places. [2024-06-27 22:20:43,569 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 272 transitions, 3246 flow [2024-06-27 22:20:43,569 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:20:43,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:43,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:43,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:20:43,569 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:43,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 11423321, now seen corresponding path program 2 times [2024-06-27 22:20:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480442114] [2024-06-27 22:20:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:44,701 INFO 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:20:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480442114] [2024-06-27 22:20:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480442114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523860060] [2024-06-27 22:20:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:44,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:44,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:44,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 272 transitions, 3246 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:20:44,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:44,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:44,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:46,091 INFO L124 PetriNetUnfolderBase]: 4337/7010 cut-off events. [2024-06-27 22:20:46,091 INFO L125 PetriNetUnfolderBase]: For 144523/144535 co-relation queries the response was YES. [2024-06-27 22:20:46,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43112 conditions, 7010 events. 4337/7010 cut-off events. For 144523/144535 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 44561 event pairs, 1475 based on Foata normal form. 14/6876 useless extension candidates. Maximal degree in co-relation 43042. Up to 5926 conditions per place. [2024-06-27 22:20:46,158 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 209 selfloop transitions, 88 changer transitions 0/319 dead transitions. [2024-06-27 22:20:46,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 319 transitions, 4124 flow [2024-06-27 22:20:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 22:20:46,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-06-27 22:20:46,160 INFO L175 Difference]: Start difference. First operand has 160 places, 272 transitions, 3246 flow. Second operand 8 states and 206 transitions. [2024-06-27 22:20:46,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 319 transitions, 4124 flow [2024-06-27 22:20:46,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 319 transitions, 3981 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:46,306 INFO L231 Difference]: Finished difference. Result has 165 places, 283 transitions, 3501 flow [2024-06-27 22:20:46,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3501, PETRI_PLACES=165, PETRI_TRANSITIONS=283} [2024-06-27 22:20:46,307 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 111 predicate places. [2024-06-27 22:20:46,307 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 283 transitions, 3501 flow [2024-06-27 22:20:46,308 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:20:46,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:46,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:20:46,308 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:46,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash 44632583, now seen corresponding path program 3 times [2024-06-27 22:20:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244995356] [2024-06-27 22:20:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:47,195 INFO 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:20:47,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244995356] [2024-06-27 22:20:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244995356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:47,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:47,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:47,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995112524] [2024-06-27 22:20:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:47,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:47,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:47,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:47,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:47,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:20:47,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 283 transitions, 3501 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:20:47,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:47,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:20:47,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:48,420 INFO L124 PetriNetUnfolderBase]: 3810/6763 cut-off events. [2024-06-27 22:20:48,420 INFO L125 PetriNetUnfolderBase]: For 144830/144981 co-relation queries the response was YES. [2024-06-27 22:20:48,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40140 conditions, 6763 events. 3810/6763 cut-off events. For 144830/144981 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 46945 event pairs, 933 based on Foata normal form. 75/6613 useless extension candidates. Maximal degree in co-relation 40068. Up to 5013 conditions per place. [2024-06-27 22:20:48,489 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 180 selfloop transitions, 93 changer transitions 0/328 dead transitions. [2024-06-27 22:20:48,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 328 transitions, 4439 flow [2024-06-27 22:20:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2024-06-27 22:20:48,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5684523809523809 [2024-06-27 22:20:48,491 INFO L175 Difference]: Start difference. First operand has 165 places, 283 transitions, 3501 flow. Second operand 7 states and 191 transitions. [2024-06-27 22:20:48,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 328 transitions, 4439 flow [2024-06-27 22:20:48,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 328 transitions, 4133 flow, removed 78 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:48,641 INFO L231 Difference]: Finished difference. Result has 169 places, 297 transitions, 3795 flow [2024-06-27 22:20:48,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3279, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3795, PETRI_PLACES=169, PETRI_TRANSITIONS=297} [2024-06-27 22:20:48,642 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places. [2024-06-27 22:20:48,642 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 297 transitions, 3795 flow [2024-06-27 22:20:48,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:20:48,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:48,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:48,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:20:48,643 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:48,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash -247925407, now seen corresponding path program 1 times [2024-06-27 22:20:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:48,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743098408] [2024-06-27 22:20:48,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:50,353 INFO 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:20:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743098408] [2024-06-27 22:20:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743098408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:50,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:50,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:20:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663471122] [2024-06-27 22:20:50,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:50,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:20:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:50,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:20:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:20:50,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:50,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 297 transitions, 3795 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:20:50,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:50,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:50,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:51,933 INFO L124 PetriNetUnfolderBase]: 4846/7680 cut-off events. [2024-06-27 22:20:51,934 INFO L125 PetriNetUnfolderBase]: For 173017/173021 co-relation queries the response was YES. [2024-06-27 22:20:51,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48449 conditions, 7680 events. 4846/7680 cut-off events. For 173017/173021 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 47648 event pairs, 1500 based on Foata normal form. 6/7531 useless extension candidates. Maximal degree in co-relation 48374. Up to 6650 conditions per place. [2024-06-27 22:20:52,011 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 237 selfloop transitions, 103 changer transitions 0/351 dead transitions. [2024-06-27 22:20:52,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 351 transitions, 4846 flow [2024-06-27 22:20:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-06-27 22:20:52,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:20:52,020 INFO L175 Difference]: Start difference. First operand has 169 places, 297 transitions, 3795 flow. Second operand 9 states and 225 transitions. [2024-06-27 22:20:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 351 transitions, 4846 flow [2024-06-27 22:20:52,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 351 transitions, 4653 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:52,353 INFO L231 Difference]: Finished difference. Result has 175 places, 308 transitions, 4077 flow [2024-06-27 22:20:52,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3648, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4077, PETRI_PLACES=175, PETRI_TRANSITIONS=308} [2024-06-27 22:20:52,355 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places. [2024-06-27 22:20:52,355 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 308 transitions, 4077 flow [2024-06-27 22:20:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:20:52,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:52,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:20:52,355 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:52,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash -3078875, now seen corresponding path program 4 times [2024-06-27 22:20:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710089974] [2024-06-27 22:20:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:52,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:53,742 INFO 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:20:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710089974] [2024-06-27 22:20:53,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710089974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:53,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:53,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574707320] [2024-06-27 22:20:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:53,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:53,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:53,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:53,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:53,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:53,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 308 transitions, 4077 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:20:53,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:53,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:53,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:55,493 INFO L124 PetriNetUnfolderBase]: 4703/7681 cut-off events. [2024-06-27 22:20:55,493 INFO L125 PetriNetUnfolderBase]: For 182672/182684 co-relation queries the response was YES. [2024-06-27 22:20:55,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48944 conditions, 7681 events. 4703/7681 cut-off events. For 182672/182684 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 49547 event pairs, 1437 based on Foata normal form. 14/7527 useless extension candidates. Maximal degree in co-relation 48868. Up to 6404 conditions per place. [2024-06-27 22:20:55,574 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 275 selfloop transitions, 95 changer transitions 0/393 dead transitions. [2024-06-27 22:20:55,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 393 transitions, 5566 flow [2024-06-27 22:20:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:20:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:20:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2024-06-27 22:20:55,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-06-27 22:20:55,575 INFO L175 Difference]: Start difference. First operand has 175 places, 308 transitions, 4077 flow. Second operand 11 states and 268 transitions. [2024-06-27 22:20:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 393 transitions, 5566 flow [2024-06-27 22:20:55,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 393 transitions, 5407 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:55,798 INFO L231 Difference]: Finished difference. Result has 184 places, 346 transitions, 4806 flow [2024-06-27 22:20:55,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4806, PETRI_PLACES=184, PETRI_TRANSITIONS=346} [2024-06-27 22:20:55,798 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 130 predicate places. [2024-06-27 22:20:55,799 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 346 transitions, 4806 flow [2024-06-27 22:20:55,799 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:20:55,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:55,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:55,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:20:55,799 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:55,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -192155, now seen corresponding path program 5 times [2024-06-27 22:20:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869181484] [2024-06-27 22:20:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:57,276 INFO 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:20:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:57,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869181484] [2024-06-27 22:20:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869181484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:57,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051249825] [2024-06-27 22:20:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:57,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:57,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:20:57,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 346 transitions, 4806 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:20:57,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:57,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:20:57,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:59,186 INFO L124 PetriNetUnfolderBase]: 4826/7850 cut-off events. [2024-06-27 22:20:59,186 INFO L125 PetriNetUnfolderBase]: For 200543/200555 co-relation queries the response was YES. [2024-06-27 22:20:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51659 conditions, 7850 events. 4826/7850 cut-off events. For 200543/200555 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 50642 event pairs, 1474 based on Foata normal form. 14/7686 useless extension candidates. Maximal degree in co-relation 51579. Up to 6615 conditions per place. [2024-06-27 22:20:59,269 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 282 selfloop transitions, 111 changer transitions 0/416 dead transitions. [2024-06-27 22:20:59,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 416 transitions, 6167 flow [2024-06-27 22:20:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:20:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:20:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2024-06-27 22:20:59,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2024-06-27 22:20:59,271 INFO L175 Difference]: Start difference. First operand has 184 places, 346 transitions, 4806 flow. Second operand 11 states and 267 transitions. [2024-06-27 22:20:59,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 416 transitions, 6167 flow [2024-06-27 22:20:59,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 416 transitions, 5860 flow, removed 87 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:59,609 INFO L231 Difference]: Finished difference. Result has 191 places, 372 transitions, 5272 flow [2024-06-27 22:20:59,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4499, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5272, PETRI_PLACES=191, PETRI_TRANSITIONS=372} [2024-06-27 22:20:59,610 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 137 predicate places. [2024-06-27 22:20:59,610 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 372 transitions, 5272 flow [2024-06-27 22:20:59,610 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:20:59,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:59,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:59,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:20:59,610 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:59,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash -597522861, now seen corresponding path program 2 times [2024-06-27 22:20:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320970803] [2024-06-27 22:20:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320970803] [2024-06-27 22:21:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320970803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:21:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309179270] [2024-06-27 22:21:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:01,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:01,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:01,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 372 transitions, 5272 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:01,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:01,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:03,266 INFO L124 PetriNetUnfolderBase]: 5358/8433 cut-off events. [2024-06-27 22:21:03,267 INFO L125 PetriNetUnfolderBase]: For 216314/216316 co-relation queries the response was YES. [2024-06-27 22:21:03,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55937 conditions, 8433 events. 5358/8433 cut-off events. For 216314/216316 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 52632 event pairs, 1659 based on Foata normal form. 4/8280 useless extension candidates. Maximal degree in co-relation 55855. Up to 7419 conditions per place. [2024-06-27 22:21:03,348 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 330 selfloop transitions, 105 changer transitions 0/446 dead transitions. [2024-06-27 22:21:03,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 446 transitions, 6777 flow [2024-06-27 22:21:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:21:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:21:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2024-06-27 22:21:03,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981060606060606 [2024-06-27 22:21:03,350 INFO L175 Difference]: Start difference. First operand has 191 places, 372 transitions, 5272 flow. Second operand 11 states and 263 transitions. [2024-06-27 22:21:03,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 446 transitions, 6777 flow [2024-06-27 22:21:03,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 446 transitions, 6361 flow, removed 159 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:03,712 INFO L231 Difference]: Finished difference. Result has 197 places, 396 transitions, 5621 flow [2024-06-27 22:21:03,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4984, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5621, PETRI_PLACES=197, PETRI_TRANSITIONS=396} [2024-06-27 22:21:03,713 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 143 predicate places. [2024-06-27 22:21:03,713 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 396 transitions, 5621 flow [2024-06-27 22:21:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:03,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:03,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:03,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:21:03,714 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:03,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 115998697, now seen corresponding path program 3 times [2024-06-27 22:21:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725494233] [2024-06-27 22:21:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:05,562 INFO 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:21:05,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:05,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725494233] [2024-06-27 22:21:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725494233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:05,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632598890] [2024-06-27 22:21:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:05,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:05,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 396 transitions, 5621 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:05,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:05,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:05,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:07,672 INFO L124 PetriNetUnfolderBase]: 5422/8517 cut-off events. [2024-06-27 22:21:07,672 INFO L125 PetriNetUnfolderBase]: For 223329/223329 co-relation queries the response was YES. [2024-06-27 22:21:07,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57573 conditions, 8517 events. 5422/8517 cut-off events. For 223329/223329 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 52983 event pairs, 1631 based on Foata normal form. 2/8366 useless extension candidates. Maximal degree in co-relation 57487. Up to 7388 conditions per place. [2024-06-27 22:21:07,752 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 318 selfloop transitions, 127 changer transitions 0/456 dead transitions. [2024-06-27 22:21:07,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 456 transitions, 6897 flow [2024-06-27 22:21:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-06-27 22:21:07,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-06-27 22:21:07,754 INFO L175 Difference]: Start difference. First operand has 197 places, 396 transitions, 5621 flow. Second operand 10 states and 246 transitions. [2024-06-27 22:21:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 456 transitions, 6897 flow [2024-06-27 22:21:08,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 456 transitions, 6771 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:08,059 INFO L231 Difference]: Finished difference. Result has 204 places, 408 transitions, 5991 flow [2024-06-27 22:21:08,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5503, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5991, PETRI_PLACES=204, PETRI_TRANSITIONS=408} [2024-06-27 22:21:08,060 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places. [2024-06-27 22:21:08,060 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 408 transitions, 5991 flow [2024-06-27 22:21:08,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:08,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:08,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:08,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:21:08,061 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:08,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 116208226, now seen corresponding path program 1 times [2024-06-27 22:21:08,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:08,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835758840] [2024-06-27 22:21:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:09,867 INFO 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:21:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:09,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835758840] [2024-06-27 22:21:09,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835758840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:09,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:09,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:21:09,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949204290] [2024-06-27 22:21:09,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:09,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:09,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:09,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:09,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:10,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:10,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 408 transitions, 5991 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:10,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:10,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:10,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:11,891 INFO L124 PetriNetUnfolderBase]: 5631/8932 cut-off events. [2024-06-27 22:21:11,892 INFO L125 PetriNetUnfolderBase]: For 269434/269434 co-relation queries the response was YES. [2024-06-27 22:21:11,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62446 conditions, 8932 events. 5631/8932 cut-off events. For 269434/269434 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 56623 event pairs, 1638 based on Foata normal form. 20/8768 useless extension candidates. Maximal degree in co-relation 62357. Up to 7467 conditions per place. [2024-06-27 22:21:11,995 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 327 selfloop transitions, 129 changer transitions 0/467 dead transitions. [2024-06-27 22:21:11,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 467 transitions, 7270 flow [2024-06-27 22:21:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2024-06-27 22:21:11,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:21:11,997 INFO L175 Difference]: Start difference. First operand has 204 places, 408 transitions, 5991 flow. Second operand 10 states and 250 transitions. [2024-06-27 22:21:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 467 transitions, 7270 flow [2024-06-27 22:21:12,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 467 transitions, 6734 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-06-27 22:21:12,394 INFO L231 Difference]: Finished difference. Result has 208 places, 414 transitions, 5922 flow [2024-06-27 22:21:12,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5455, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5922, PETRI_PLACES=208, PETRI_TRANSITIONS=414} [2024-06-27 22:21:12,394 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 154 predicate places. [2024-06-27 22:21:12,395 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 414 transitions, 5922 flow [2024-06-27 22:21:12,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:12,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:12,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:12,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:21:12,395 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:12,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash 116207947, now seen corresponding path program 4 times [2024-06-27 22:21:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:12,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329913760] [2024-06-27 22:21:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:14,257 INFO 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:21:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329913760] [2024-06-27 22:21:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329913760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:21:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408979961] [2024-06-27 22:21:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:14,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:14,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 414 transitions, 5922 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:14,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:14,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:14,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:16,368 INFO L124 PetriNetUnfolderBase]: 5656/8932 cut-off events. [2024-06-27 22:21:16,368 INFO L125 PetriNetUnfolderBase]: For 274455/274455 co-relation queries the response was YES. [2024-06-27 22:21:16,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63403 conditions, 8932 events. 5656/8932 cut-off events. For 274455/274455 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 56446 event pairs, 1672 based on Foata normal form. 2/8768 useless extension candidates. Maximal degree in co-relation 63312. Up to 7613 conditions per place. [2024-06-27 22:21:16,460 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 311 selfloop transitions, 155 changer transitions 0/477 dead transitions. [2024-06-27 22:21:16,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 477 transitions, 7419 flow [2024-06-27 22:21:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-06-27 22:21:16,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51875 [2024-06-27 22:21:16,463 INFO L175 Difference]: Start difference. First operand has 208 places, 414 transitions, 5922 flow. Second operand 10 states and 249 transitions. [2024-06-27 22:21:16,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 477 transitions, 7419 flow [2024-06-27 22:21:16,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 477 transitions, 7172 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:16,846 INFO L231 Difference]: Finished difference. Result has 212 places, 426 transitions, 6251 flow [2024-06-27 22:21:16,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5675, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6251, PETRI_PLACES=212, PETRI_TRANSITIONS=426} [2024-06-27 22:21:16,846 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 158 predicate places. [2024-06-27 22:21:16,847 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 426 transitions, 6251 flow [2024-06-27 22:21:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:16,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:16,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:21:16,847 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:16,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 116200507, now seen corresponding path program 5 times [2024-06-27 22:21:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:16,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992187449] [2024-06-27 22:21:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:18,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:21:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992187449] [2024-06-27 22:21:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992187449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:21:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389209022] [2024-06-27 22:21:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:18,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:18,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:18,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:18,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:19,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:19,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 426 transitions, 6251 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:19,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:19,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:19,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:20,999 INFO L124 PetriNetUnfolderBase]: 5640/8877 cut-off events. [2024-06-27 22:21:20,999 INFO L125 PetriNetUnfolderBase]: For 277073/277073 co-relation queries the response was YES. [2024-06-27 22:21:21,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63551 conditions, 8877 events. 5640/8877 cut-off events. For 277073/277073 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 55735 event pairs, 1672 based on Foata normal form. 2/8718 useless extension candidates. Maximal degree in co-relation 63459. Up to 7716 conditions per place. [2024-06-27 22:21:21,095 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 326 selfloop transitions, 136 changer transitions 0/473 dead transitions. [2024-06-27 22:21:21,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 473 transitions, 7341 flow [2024-06-27 22:21:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-06-27 22:21:21,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:21:21,097 INFO L175 Difference]: Start difference. First operand has 212 places, 426 transitions, 6251 flow. Second operand 10 states and 245 transitions. [2024-06-27 22:21:21,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 473 transitions, 7341 flow [2024-06-27 22:21:21,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 473 transitions, 7163 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:21,539 INFO L231 Difference]: Finished difference. Result has 218 places, 426 transitions, 6354 flow [2024-06-27 22:21:21,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6073, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6354, PETRI_PLACES=218, PETRI_TRANSITIONS=426} [2024-06-27 22:21:21,540 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 164 predicate places. [2024-06-27 22:21:21,540 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 426 transitions, 6354 flow [2024-06-27 22:21:21,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:21,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:21,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:21,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:21:21,540 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:21,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash -557124999, now seen corresponding path program 1 times [2024-06-27 22:21:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:21,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327803374] [2024-06-27 22:21:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:21,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:22,645 INFO 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:21:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327803374] [2024-06-27 22:21:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327803374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:21:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787353852] [2024-06-27 22:21:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:22,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:21:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:21:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:21:22,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:22,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 426 transitions, 6354 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:21:22,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:22,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:22,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:24,506 INFO L124 PetriNetUnfolderBase]: 5759/9346 cut-off events. [2024-06-27 22:21:24,506 INFO L125 PetriNetUnfolderBase]: For 282262/282262 co-relation queries the response was YES. [2024-06-27 22:21:24,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65233 conditions, 9346 events. 5759/9346 cut-off events. For 282262/282262 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 60845 event pairs, 1675 based on Foata normal form. 2/9101 useless extension candidates. Maximal degree in co-relation 65139. Up to 7963 conditions per place. [2024-06-27 22:21:24,612 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 382 selfloop transitions, 79 changer transitions 0/472 dead transitions. [2024-06-27 22:21:24,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 472 transitions, 7728 flow [2024-06-27 22:21:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:21:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:21:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-27 22:21:24,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2024-06-27 22:21:24,614 INFO L175 Difference]: Start difference. First operand has 218 places, 426 transitions, 6354 flow. Second operand 7 states and 178 transitions. [2024-06-27 22:21:24,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 472 transitions, 7728 flow [2024-06-27 22:21:25,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 472 transitions, 7360 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-27 22:21:25,024 INFO L231 Difference]: Finished difference. Result has 217 places, 436 transitions, 6320 flow [2024-06-27 22:21:25,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5986, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6320, PETRI_PLACES=217, PETRI_TRANSITIONS=436} [2024-06-27 22:21:25,025 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 163 predicate places. [2024-06-27 22:21:25,025 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 436 transitions, 6320 flow [2024-06-27 22:21:25,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:21:25,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:25,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:25,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:21:25,025 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:25,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:25,026 INFO L85 PathProgramCache]: Analyzing trace with hash 773019701, now seen corresponding path program 6 times [2024-06-27 22:21:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769487648] [2024-06-27 22:21:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:26,411 INFO 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:21:26,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769487648] [2024-06-27 22:21:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769487648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:26,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68179887] [2024-06-27 22:21:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:26,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:26,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:26,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:21:26,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 436 transitions, 6320 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:21:26,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:26,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:21:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:28,541 INFO L124 PetriNetUnfolderBase]: 5348/8651 cut-off events. [2024-06-27 22:21:28,542 INFO L125 PetriNetUnfolderBase]: For 290835/290841 co-relation queries the response was YES. [2024-06-27 22:21:28,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63894 conditions, 8651 events. 5348/8651 cut-off events. For 290835/290841 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 56729 event pairs, 1276 based on Foata normal form. 10/8484 useless extension candidates. Maximal degree in co-relation 63798. Up to 7268 conditions per place. [2024-06-27 22:21:28,642 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 339 selfloop transitions, 121 changer transitions 0/487 dead transitions. [2024-06-27 22:21:28,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 487 transitions, 7563 flow [2024-06-27 22:21:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:21:28,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162037037037037 [2024-06-27 22:21:28,648 INFO L175 Difference]: Start difference. First operand has 217 places, 436 transitions, 6320 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:21:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 487 transitions, 7563 flow [2024-06-27 22:21:29,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 487 transitions, 7504 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-27 22:21:29,069 INFO L231 Difference]: Finished difference. Result has 224 places, 448 transitions, 6748 flow [2024-06-27 22:21:29,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6261, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6748, PETRI_PLACES=224, PETRI_TRANSITIONS=448} [2024-06-27 22:21:29,071 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 170 predicate places. [2024-06-27 22:21:29,071 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 448 transitions, 6748 flow [2024-06-27 22:21:29,071 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:21:29,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:29,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:21:29,072 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:29,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1997115329, now seen corresponding path program 7 times [2024-06-27 22:21:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636173267] [2024-06-27 22:21:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:30,306 INFO 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:21:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636173267] [2024-06-27 22:21:30,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636173267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:30,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:30,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:30,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813038815] [2024-06-27 22:21:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:30,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:30,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:21:30,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 448 transitions, 6748 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:21:30,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:30,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:21:30,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:32,406 INFO L124 PetriNetUnfolderBase]: 5573/9017 cut-off events. [2024-06-27 22:21:32,406 INFO L125 PetriNetUnfolderBase]: For 322780/322780 co-relation queries the response was YES. [2024-06-27 22:21:32,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68030 conditions, 9017 events. 5573/9017 cut-off events. For 322780/322780 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 59561 event pairs, 1320 based on Foata normal form. 4/8842 useless extension candidates. Maximal degree in co-relation 67932. Up to 7595 conditions per place. [2024-06-27 22:21:32,519 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 409 selfloop transitions, 85 changer transitions 0/521 dead transitions. [2024-06-27 22:21:32,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 521 transitions, 8394 flow [2024-06-27 22:21:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-27 22:21:32,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:21:32,521 INFO L175 Difference]: Start difference. First operand has 224 places, 448 transitions, 6748 flow. Second operand 9 states and 219 transitions. [2024-06-27 22:21:32,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 521 transitions, 8394 flow [2024-06-27 22:21:33,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 521 transitions, 8083 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:33,122 INFO L231 Difference]: Finished difference. Result has 227 places, 484 transitions, 7244 flow [2024-06-27 22:21:33,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6437, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7244, PETRI_PLACES=227, PETRI_TRANSITIONS=484} [2024-06-27 22:21:33,122 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 173 predicate places. [2024-06-27 22:21:33,123 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 484 transitions, 7244 flow [2024-06-27 22:21:33,123 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:21:33,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:33,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:33,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:21:33,123 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:33,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -106447149, now seen corresponding path program 8 times [2024-06-27 22:21:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:33,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291466717] [2024-06-27 22:21:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291466717] [2024-06-27 22:21:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291466717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:34,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378898732] [2024-06-27 22:21:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:34,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:34,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:34,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:21:34,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 484 transitions, 7244 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:21:34,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:34,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:21:34,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:36,960 INFO L124 PetriNetUnfolderBase]: 5659/9151 cut-off events. [2024-06-27 22:21:36,961 INFO L125 PetriNetUnfolderBase]: For 347166/347166 co-relation queries the response was YES. [2024-06-27 22:21:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70072 conditions, 9151 events. 5659/9151 cut-off events. For 347166/347166 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 60579 event pairs, 1343 based on Foata normal form. 8/8981 useless extension candidates. Maximal degree in co-relation 69972. Up to 7737 conditions per place. [2024-06-27 22:21:37,074 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 390 selfloop transitions, 107 changer transitions 0/524 dead transitions. [2024-06-27 22:21:37,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 524 transitions, 8503 flow [2024-06-27 22:21:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-27 22:21:37,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:21:37,095 INFO L175 Difference]: Start difference. First operand has 227 places, 484 transitions, 7244 flow. Second operand 9 states and 219 transitions. [2024-06-27 22:21:37,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 524 transitions, 8503 flow [2024-06-27 22:21:37,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 524 transitions, 8294 flow, removed 85 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:37,773 INFO L231 Difference]: Finished difference. Result has 232 places, 490 transitions, 7421 flow [2024-06-27 22:21:37,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7035, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7421, PETRI_PLACES=232, PETRI_TRANSITIONS=490} [2024-06-27 22:21:37,774 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 178 predicate places. [2024-06-27 22:21:37,774 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 490 transitions, 7421 flow [2024-06-27 22:21:37,774 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:21:37,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:37,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:37,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:21:37,775 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:37,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 773025653, now seen corresponding path program 6 times [2024-06-27 22:21:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472865365] [2024-06-27 22:21:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:39,584 INFO 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:21:39,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:39,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472865365] [2024-06-27 22:21:39,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472865365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:39,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:39,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663332852] [2024-06-27 22:21:39,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:39,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:39,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:39,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:39,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:39,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:39,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 490 transitions, 7421 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:39,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:39,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:39,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:42,155 INFO L124 PetriNetUnfolderBase]: 6402/10009 cut-off events. [2024-06-27 22:21:42,155 INFO L125 PetriNetUnfolderBase]: For 363022/363022 co-relation queries the response was YES. [2024-06-27 22:21:42,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75727 conditions, 10009 events. 6402/10009 cut-off events. For 363022/363022 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 63530 event pairs, 1568 based on Foata normal form. 2/9844 useless extension candidates. Maximal degree in co-relation 75625. Up to 8876 conditions per place. [2024-06-27 22:21:42,285 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 404 selfloop transitions, 148 changer transitions 0/563 dead transitions. [2024-06-27 22:21:42,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 563 transitions, 9188 flow [2024-06-27 22:21:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:21:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:21:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2024-06-27 22:21:42,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 22:21:42,293 INFO L175 Difference]: Start difference. First operand has 232 places, 490 transitions, 7421 flow. Second operand 12 states and 276 transitions. [2024-06-27 22:21:42,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 563 transitions, 9188 flow [2024-06-27 22:21:42,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 563 transitions, 8856 flow, removed 61 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:42,956 INFO L231 Difference]: Finished difference. Result has 238 places, 518 transitions, 8000 flow [2024-06-27 22:21:42,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7095, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8000, PETRI_PLACES=238, PETRI_TRANSITIONS=518} [2024-06-27 22:21:42,956 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 184 predicate places. [2024-06-27 22:21:42,956 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 518 transitions, 8000 flow [2024-06-27 22:21:42,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:42,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:42,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:42,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:21:42,957 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:42,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 889419803, now seen corresponding path program 7 times [2024-06-27 22:21:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735919983] [2024-06-27 22:21:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:44,518 INFO 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:21:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:44,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735919983] [2024-06-27 22:21:44,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735919983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:44,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:44,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:44,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465531623] [2024-06-27 22:21:44,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:44,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:44,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:44,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:44,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 518 transitions, 8000 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:44,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:44,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:44,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:47,177 INFO L124 PetriNetUnfolderBase]: 6535/10224 cut-off events. [2024-06-27 22:21:47,177 INFO L125 PetriNetUnfolderBase]: For 389775/389775 co-relation queries the response was YES. [2024-06-27 22:21:47,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79135 conditions, 10224 events. 6535/10224 cut-off events. For 389775/389775 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 65241 event pairs, 1542 based on Foata normal form. 2/10054 useless extension candidates. Maximal degree in co-relation 79031. Up to 8818 conditions per place. [2024-06-27 22:21:47,300 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 377 selfloop transitions, 213 changer transitions 0/601 dead transitions. [2024-06-27 22:21:47,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 601 transitions, 10338 flow [2024-06-27 22:21:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-06-27 22:21:47,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-27 22:21:47,301 INFO L175 Difference]: Start difference. First operand has 238 places, 518 transitions, 8000 flow. Second operand 10 states and 244 transitions. [2024-06-27 22:21:47,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 601 transitions, 10338 flow [2024-06-27 22:21:47,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 601 transitions, 9723 flow, removed 121 selfloop flow, removed 12 redundant places. [2024-06-27 22:21:47,964 INFO L231 Difference]: Finished difference. Result has 239 places, 552 transitions, 8841 flow [2024-06-27 22:21:47,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7385, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8841, PETRI_PLACES=239, PETRI_TRANSITIONS=552} [2024-06-27 22:21:47,965 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 185 predicate places. [2024-06-27 22:21:47,965 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 552 transitions, 8841 flow [2024-06-27 22:21:47,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:47,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:47,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:47,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:21:47,966 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:47,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash -106231668, now seen corresponding path program 2 times [2024-06-27 22:21:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:47,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349924786] [2024-06-27 22:21:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:49,476 INFO 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:21:49,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349924786] [2024-06-27 22:21:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349924786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787504626] [2024-06-27 22:21:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:49,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:49,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:49,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 552 transitions, 8841 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:49,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:49,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:49,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:52,175 INFO L124 PetriNetUnfolderBase]: 6603/10342 cut-off events. [2024-06-27 22:21:52,176 INFO L125 PetriNetUnfolderBase]: For 425732/425734 co-relation queries the response was YES. [2024-06-27 22:21:52,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82312 conditions, 10342 events. 6603/10342 cut-off events. For 425732/425734 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 66367 event pairs, 2134 based on Foata normal form. 6/10181 useless extension candidates. Maximal degree in co-relation 82207. Up to 9220 conditions per place. [2024-06-27 22:21:52,330 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 519 selfloop transitions, 73 changer transitions 0/603 dead transitions. [2024-06-27 22:21:52,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 603 transitions, 10377 flow [2024-06-27 22:21:52,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:21:52,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162037037037037 [2024-06-27 22:21:52,332 INFO L175 Difference]: Start difference. First operand has 239 places, 552 transitions, 8841 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:21:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 603 transitions, 10377 flow [2024-06-27 22:21:53,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 603 transitions, 10082 flow, removed 110 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:53,721 INFO L231 Difference]: Finished difference. Result has 244 places, 556 transitions, 8848 flow [2024-06-27 22:21:53,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8546, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8848, PETRI_PLACES=244, PETRI_TRANSITIONS=556} [2024-06-27 22:21:53,731 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 190 predicate places. [2024-06-27 22:21:53,732 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 556 transitions, 8848 flow [2024-06-27 22:21:53,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:53,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:53,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:53,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:21:53,732 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:53,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -106239387, now seen corresponding path program 8 times [2024-06-27 22:21:53,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617937223] [2024-06-27 22:21:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:55,684 INFO 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:21:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617937223] [2024-06-27 22:21:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617937223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:21:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234875511] [2024-06-27 22:21:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:55,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:55,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:55,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 556 transitions, 8848 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:55,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:55,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:58,320 INFO L124 PetriNetUnfolderBase]: 6644/10383 cut-off events. [2024-06-27 22:21:58,321 INFO L125 PetriNetUnfolderBase]: For 433086/433086 co-relation queries the response was YES. [2024-06-27 22:21:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83567 conditions, 10383 events. 6644/10383 cut-off events. For 433086/433086 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 66260 event pairs, 1601 based on Foata normal form. 2/10214 useless extension candidates. Maximal degree in co-relation 83460. Up to 9176 conditions per place. [2024-06-27 22:21:58,482 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 472 selfloop transitions, 123 changer transitions 0/606 dead transitions. [2024-06-27 22:21:58,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 606 transitions, 10404 flow [2024-06-27 22:21:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-06-27 22:21:58,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-27 22:21:58,484 INFO L175 Difference]: Start difference. First operand has 244 places, 556 transitions, 8848 flow. Second operand 10 states and 236 transitions. [2024-06-27 22:21:58,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 606 transitions, 10404 flow [2024-06-27 22:21:59,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 606 transitions, 10188 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:59,584 INFO L231 Difference]: Finished difference. Result has 248 places, 565 transitions, 9125 flow [2024-06-27 22:21:59,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8632, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9125, PETRI_PLACES=248, PETRI_TRANSITIONS=565} [2024-06-27 22:21:59,585 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 194 predicate places. [2024-06-27 22:21:59,585 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 565 transitions, 9125 flow [2024-06-27 22:21:59,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:21:59,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:59,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:59,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:21:59,586 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:59,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash 889210553, now seen corresponding path program 9 times [2024-06-27 22:21:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496024730] [2024-06-27 22:21:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:01,502 INFO 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:22:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496024730] [2024-06-27 22:22:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496024730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573300092] [2024-06-27 22:22:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:01,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:01,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:01,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 565 transitions, 9125 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:01,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:01,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:01,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:04,282 INFO L124 PetriNetUnfolderBase]: 6644/10385 cut-off events. [2024-06-27 22:22:04,282 INFO L125 PetriNetUnfolderBase]: For 436211/436211 co-relation queries the response was YES. [2024-06-27 22:22:04,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83647 conditions, 10385 events. 6644/10385 cut-off events. For 436211/436211 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 66316 event pairs, 1601 based on Foata normal form. 2/10215 useless extension candidates. Maximal degree in co-relation 83538. Up to 9176 conditions per place. [2024-06-27 22:22:04,410 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 479 selfloop transitions, 119 changer transitions 0/609 dead transitions. [2024-06-27 22:22:04,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 609 transitions, 10619 flow [2024-06-27 22:22:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-27 22:22:04,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-06-27 22:22:04,413 INFO L175 Difference]: Start difference. First operand has 248 places, 565 transitions, 9125 flow. Second operand 10 states and 237 transitions. [2024-06-27 22:22:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 609 transitions, 10619 flow [2024-06-27 22:22:05,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 609 transitions, 10327 flow, removed 70 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:05,353 INFO L231 Difference]: Finished difference. Result has 253 places, 568 transitions, 9210 flow [2024-06-27 22:22:05,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8871, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9210, PETRI_PLACES=253, PETRI_TRANSITIONS=568} [2024-06-27 22:22:05,354 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 199 predicate places. [2024-06-27 22:22:05,354 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 568 transitions, 9210 flow [2024-06-27 22:22:05,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:05,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:05,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:22:05,355 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:05,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:05,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1921193383, now seen corresponding path program 2 times [2024-06-27 22:22:05,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685036660] [2024-06-27 22:22:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685036660] [2024-06-27 22:22:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685036660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:22:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894306880] [2024-06-27 22:22:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:06,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:22:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:22:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:22:06,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:06,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 568 transitions, 9210 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:22:06,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:06,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:06,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:08,875 INFO L124 PetriNetUnfolderBase]: 6757/10816 cut-off events. [2024-06-27 22:22:08,875 INFO L125 PetriNetUnfolderBase]: For 443601/443601 co-relation queries the response was YES. [2024-06-27 22:22:08,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84919 conditions, 10816 events. 6757/10816 cut-off events. For 443601/443601 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 70922 event pairs, 1552 based on Foata normal form. 2/10579 useless extension candidates. Maximal degree in co-relation 84809. Up to 9344 conditions per place. [2024-06-27 22:22:09,020 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 515 selfloop transitions, 80 changer transitions 0/606 dead transitions. [2024-06-27 22:22:09,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 606 transitions, 10844 flow [2024-06-27 22:22:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:22:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:22:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-27 22:22:09,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-27 22:22:09,021 INFO L175 Difference]: Start difference. First operand has 253 places, 568 transitions, 9210 flow. Second operand 6 states and 154 transitions. [2024-06-27 22:22:09,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 606 transitions, 10844 flow [2024-06-27 22:22:10,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 606 transitions, 10582 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:10,080 INFO L231 Difference]: Finished difference. Result has 252 places, 577 transitions, 9230 flow [2024-06-27 22:22:10,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8948, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9230, PETRI_PLACES=252, PETRI_TRANSITIONS=577} [2024-06-27 22:22:10,081 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 198 predicate places. [2024-06-27 22:22:10,081 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 577 transitions, 9230 flow [2024-06-27 22:22:10,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:22:10,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:10,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:22:10,082 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:10,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 200483641, now seen corresponding path program 9 times [2024-06-27 22:22:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883078592] [2024-06-27 22:22:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:11,751 INFO 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:22:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883078592] [2024-06-27 22:22:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883078592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:22:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660064303] [2024-06-27 22:22:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:11,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:22:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:22:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:22:12,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:22:12,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 577 transitions, 9230 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:22:12,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:12,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:22:12,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:14,378 INFO L124 PetriNetUnfolderBase]: 6007/9747 cut-off events. [2024-06-27 22:22:14,379 INFO L125 PetriNetUnfolderBase]: For 446225/446225 co-relation queries the response was YES. [2024-06-27 22:22:14,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79792 conditions, 9747 events. 6007/9747 cut-off events. For 446225/446225 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 65427 event pairs, 1373 based on Foata normal form. 8/9533 useless extension candidates. Maximal degree in co-relation 79680. Up to 8102 conditions per place. [2024-06-27 22:22:14,505 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 409 selfloop transitions, 168 changer transitions 0/613 dead transitions. [2024-06-27 22:22:14,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 613 transitions, 10636 flow [2024-06-27 22:22:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-27 22:22:14,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2024-06-27 22:22:14,506 INFO L175 Difference]: Start difference. First operand has 252 places, 577 transitions, 9230 flow. Second operand 9 states and 218 transitions. [2024-06-27 22:22:14,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 613 transitions, 10636 flow [2024-06-27 22:22:15,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 613 transitions, 10553 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-27 22:22:15,348 INFO L231 Difference]: Finished difference. Result has 259 places, 580 transitions, 9641 flow [2024-06-27 22:22:15,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9147, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9641, PETRI_PLACES=259, PETRI_TRANSITIONS=580} [2024-06-27 22:22:15,349 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 205 predicate places. [2024-06-27 22:22:15,349 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 580 transitions, 9641 flow [2024-06-27 22:22:15,350 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:22:15,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:15,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:15,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:22:15,350 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:15,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1090174156, now seen corresponding path program 3 times [2024-06-27 22:22:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611569446] [2024-06-27 22:22:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:16,986 INFO 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:22:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611569446] [2024-06-27 22:22:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611569446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:22:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645021362] [2024-06-27 22:22:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:16,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:22:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:22:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:22:17,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:17,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 580 transitions, 9641 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:17,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:17,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:17,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:19,728 INFO L124 PetriNetUnfolderBase]: 6755/10583 cut-off events. [2024-06-27 22:22:19,730 INFO L125 PetriNetUnfolderBase]: For 481628/481632 co-relation queries the response was YES. [2024-06-27 22:22:19,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85949 conditions, 10583 events. 6755/10583 cut-off events. For 481628/481632 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 68236 event pairs, 2170 based on Foata normal form. 8/10417 useless extension candidates. Maximal degree in co-relation 85835. Up to 9320 conditions per place. [2024-06-27 22:22:19,893 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 531 selfloop transitions, 85 changer transitions 0/627 dead transitions. [2024-06-27 22:22:19,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 627 transitions, 11223 flow [2024-06-27 22:22:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-06-27 22:22:19,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-27 22:22:19,895 INFO L175 Difference]: Start difference. First operand has 259 places, 580 transitions, 9641 flow. Second operand 10 states and 235 transitions. [2024-06-27 22:22:19,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 627 transitions, 11223 flow [2024-06-27 22:22:20,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 627 transitions, 10753 flow, removed 69 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:20,884 INFO L231 Difference]: Finished difference. Result has 262 places, 582 transitions, 9448 flow [2024-06-27 22:22:20,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9171, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9448, PETRI_PLACES=262, PETRI_TRANSITIONS=582} [2024-06-27 22:22:20,887 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 208 predicate places. [2024-06-27 22:22:20,887 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 582 transitions, 9448 flow [2024-06-27 22:22:20,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:20,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:20,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:20,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:22:20,888 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:20,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 200489593, now seen corresponding path program 10 times [2024-06-27 22:22:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162348309] [2024-06-27 22:22:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:22,517 INFO 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:22:22,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162348309] [2024-06-27 22:22:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162348309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:22,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365178073] [2024-06-27 22:22:22,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:22,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:22,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:22,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:22,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:22,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:22,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 582 transitions, 9448 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:22,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:22,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:22,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:25,259 INFO L124 PetriNetUnfolderBase]: 6796/10629 cut-off events. [2024-06-27 22:22:25,260 INFO L125 PetriNetUnfolderBase]: For 482482/482482 co-relation queries the response was YES. [2024-06-27 22:22:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86177 conditions, 10629 events. 6796/10629 cut-off events. For 482482/482482 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 68130 event pairs, 1620 based on Foata normal form. 2/10450 useless extension candidates. Maximal degree in co-relation 86062. Up to 9151 conditions per place. [2024-06-27 22:22:25,408 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 446 selfloop transitions, 173 changer transitions 0/630 dead transitions. [2024-06-27 22:22:25,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 630 transitions, 11022 flow [2024-06-27 22:22:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-27 22:22:25,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-06-27 22:22:25,410 INFO L175 Difference]: Start difference. First operand has 262 places, 582 transitions, 9448 flow. Second operand 10 states and 237 transitions. [2024-06-27 22:22:25,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 630 transitions, 11022 flow [2024-06-27 22:22:26,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 630 transitions, 10817 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:26,409 INFO L231 Difference]: Finished difference. Result has 266 places, 590 transitions, 9781 flow [2024-06-27 22:22:26,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9243, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9781, PETRI_PLACES=266, PETRI_TRANSITIONS=590} [2024-06-27 22:22:26,410 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 212 predicate places. [2024-06-27 22:22:26,410 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 590 transitions, 9781 flow [2024-06-27 22:22:26,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:26,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:26,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:26,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:22:26,411 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:26,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:26,411 INFO L85 PathProgramCache]: Analyzing trace with hash 200691403, now seen corresponding path program 11 times [2024-06-27 22:22:26,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816613080] [2024-06-27 22:22:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:28,493 INFO 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:22:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:28,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816613080] [2024-06-27 22:22:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816613080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:28,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:22:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74804895] [2024-06-27 22:22:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:28,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:22:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:22:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:22:28,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:28,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 590 transitions, 9781 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:28,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:28,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:28,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:31,183 INFO L124 PetriNetUnfolderBase]: 6837/10697 cut-off events. [2024-06-27 22:22:31,183 INFO L125 PetriNetUnfolderBase]: For 506665/506665 co-relation queries the response was YES. [2024-06-27 22:22:31,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88181 conditions, 10697 events. 6837/10697 cut-off events. For 506665/506665 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 68744 event pairs, 1613 based on Foata normal form. 2/10517 useless extension candidates. Maximal degree in co-relation 88064. Up to 9202 conditions per place. [2024-06-27 22:22:31,322 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 450 selfloop transitions, 176 changer transitions 0/637 dead transitions. [2024-06-27 22:22:31,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 637 transitions, 11367 flow [2024-06-27 22:22:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2024-06-27 22:22:31,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2024-06-27 22:22:31,339 INFO L175 Difference]: Start difference. First operand has 266 places, 590 transitions, 9781 flow. Second operand 10 states and 238 transitions. [2024-06-27 22:22:31,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 637 transitions, 11367 flow [2024-06-27 22:22:32,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 637 transitions, 10909 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:32,362 INFO L231 Difference]: Finished difference. Result has 269 places, 597 transitions, 9855 flow [2024-06-27 22:22:32,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9331, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9855, PETRI_PLACES=269, PETRI_TRANSITIONS=597} [2024-06-27 22:22:32,363 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 215 predicate places. [2024-06-27 22:22:32,363 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 597 transitions, 9855 flow [2024-06-27 22:22:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:32,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:32,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:22:32,364 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:32,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 457191913, now seen corresponding path program 12 times [2024-06-27 22:22:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096201693] [2024-06-27 22:22:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:34,414 INFO 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:22:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096201693] [2024-06-27 22:22:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096201693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:22:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644017272] [2024-06-27 22:22:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:34,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:22:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:22:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:22:34,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:34,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 597 transitions, 9855 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:34,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:34,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:34,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:37,212 INFO L124 PetriNetUnfolderBase]: 6860/10740 cut-off events. [2024-06-27 22:22:37,212 INFO L125 PetriNetUnfolderBase]: For 527355/527355 co-relation queries the response was YES. [2024-06-27 22:22:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89327 conditions, 10740 events. 6860/10740 cut-off events. For 527355/527355 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 69125 event pairs, 1613 based on Foata normal form. 2/10559 useless extension candidates. Maximal degree in co-relation 89209. Up to 9234 conditions per place. [2024-06-27 22:22:37,348 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 440 selfloop transitions, 192 changer transitions 0/643 dead transitions. [2024-06-27 22:22:37,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 643 transitions, 11452 flow [2024-06-27 22:22:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-06-27 22:22:37,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-27 22:22:37,350 INFO L175 Difference]: Start difference. First operand has 269 places, 597 transitions, 9855 flow. Second operand 10 states and 236 transitions. [2024-06-27 22:22:37,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 643 transitions, 11452 flow [2024-06-27 22:22:38,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 643 transitions, 11031 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:38,264 INFO L231 Difference]: Finished difference. Result has 274 places, 603 transitions, 9997 flow [2024-06-27 22:22:38,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9437, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9997, PETRI_PLACES=274, PETRI_TRANSITIONS=603} [2024-06-27 22:22:38,265 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 220 predicate places. [2024-06-27 22:22:38,265 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 603 transitions, 9997 flow [2024-06-27 22:22:38,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:38,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:38,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:38,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:22:38,265 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:38,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 457199353, now seen corresponding path program 13 times [2024-06-27 22:22:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448928365] [2024-06-27 22:22:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:39,839 INFO 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:22:39,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:39,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448928365] [2024-06-27 22:22:39,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448928365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:39,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:39,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:39,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883461048] [2024-06-27 22:22:39,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:39,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:39,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:39,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:39,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:39,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:39,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 603 transitions, 9997 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:39,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:39,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:39,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:42,837 INFO L124 PetriNetUnfolderBase]: 6903/10811 cut-off events. [2024-06-27 22:22:42,837 INFO L125 PetriNetUnfolderBase]: For 555301/555301 co-relation queries the response was YES. [2024-06-27 22:22:42,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91267 conditions, 10811 events. 6903/10811 cut-off events. For 555301/555301 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 69614 event pairs, 1565 based on Foata normal form. 2/10630 useless extension candidates. Maximal degree in co-relation 91148. Up to 9127 conditions per place. [2024-06-27 22:22:42,987 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 365 selfloop transitions, 290 changer transitions 0/666 dead transitions. [2024-06-27 22:22:42,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 666 transitions, 12286 flow [2024-06-27 22:22:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 243 transitions. [2024-06-27 22:22:42,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-06-27 22:22:42,989 INFO L175 Difference]: Start difference. First operand has 274 places, 603 transitions, 9997 flow. Second operand 10 states and 243 transitions. [2024-06-27 22:22:42,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 666 transitions, 12286 flow [2024-06-27 22:22:43,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 666 transitions, 11882 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:43,928 INFO L231 Difference]: Finished difference. Result has 280 places, 620 transitions, 11064 flow [2024-06-27 22:22:43,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9593, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11064, PETRI_PLACES=280, PETRI_TRANSITIONS=620} [2024-06-27 22:22:43,929 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 226 predicate places. [2024-06-27 22:22:43,929 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 620 transitions, 11064 flow [2024-06-27 22:22:43,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:43,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:43,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:43,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:22:43,930 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:43,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash 200698843, now seen corresponding path program 14 times [2024-06-27 22:22:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987035311] [2024-06-27 22:22:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:45,530 INFO 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:22:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987035311] [2024-06-27 22:22:45,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987035311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:45,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:45,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929499118] [2024-06-27 22:22:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:45,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:45,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:45,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:45,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:45,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 620 transitions, 11064 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:45,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:45,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:45,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:48,412 INFO L124 PetriNetUnfolderBase]: 6941/10881 cut-off events. [2024-06-27 22:22:48,412 INFO L125 PetriNetUnfolderBase]: For 593363/593363 co-relation queries the response was YES. [2024-06-27 22:22:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94316 conditions, 10881 events. 6941/10881 cut-off events. For 593363/593363 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 70320 event pairs, 1560 based on Foata normal form. 2/10699 useless extension candidates. Maximal degree in co-relation 94195. Up to 9161 conditions per place. [2024-06-27 22:22:48,787 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 389 selfloop transitions, 278 changer transitions 0/678 dead transitions. [2024-06-27 22:22:48,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 678 transitions, 13227 flow [2024-06-27 22:22:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-06-27 22:22:48,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-27 22:22:48,789 INFO L175 Difference]: Start difference. First operand has 280 places, 620 transitions, 11064 flow. Second operand 10 states and 244 transitions. [2024-06-27 22:22:48,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 678 transitions, 13227 flow [2024-06-27 22:22:50,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 678 transitions, 12512 flow, removed 322 selfloop flow, removed 3 redundant places. [2024-06-27 22:22:50,312 INFO L231 Difference]: Finished difference. Result has 288 places, 632 transitions, 11561 flow [2024-06-27 22:22:50,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10493, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11561, PETRI_PLACES=288, PETRI_TRANSITIONS=632} [2024-06-27 22:22:50,313 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 234 predicate places. [2024-06-27 22:22:50,313 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 632 transitions, 11561 flow [2024-06-27 22:22:50,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:50,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:50,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:50,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:22:50,314 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:50,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 200699122, now seen corresponding path program 4 times [2024-06-27 22:22:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554091908] [2024-06-27 22:22:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554091908] [2024-06-27 22:22:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554091908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:51,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:51,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:22:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134399324] [2024-06-27 22:22:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:51,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:22:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:22:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:22:52,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:52,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 632 transitions, 11561 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:52,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:52,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:52,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:54,934 INFO L124 PetriNetUnfolderBase]: 6978/10944 cut-off events. [2024-06-27 22:22:54,934 INFO L125 PetriNetUnfolderBase]: For 583807/583807 co-relation queries the response was YES. [2024-06-27 22:22:55,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92251 conditions, 10944 events. 6978/10944 cut-off events. For 583807/583807 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 70755 event pairs, 1632 based on Foata normal form. 4/10761 useless extension candidates. Maximal degree in co-relation 92127. Up to 9525 conditions per place. [2024-06-27 22:22:55,099 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 526 selfloop transitions, 140 changer transitions 0/677 dead transitions. [2024-06-27 22:22:55,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 677 transitions, 13215 flow [2024-06-27 22:22:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-27 22:22:55,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-06-27 22:22:55,101 INFO L175 Difference]: Start difference. First operand has 288 places, 632 transitions, 11561 flow. Second operand 10 states and 237 transitions. [2024-06-27 22:22:55,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 677 transitions, 13215 flow [2024-06-27 22:22:56,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 677 transitions, 12806 flow, removed 169 selfloop flow, removed 3 redundant places. [2024-06-27 22:22:56,771 INFO L231 Difference]: Finished difference. Result has 295 places, 634 transitions, 11553 flow [2024-06-27 22:22:56,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11152, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11553, PETRI_PLACES=295, PETRI_TRANSITIONS=634} [2024-06-27 22:22:56,772 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 241 predicate places. [2024-06-27 22:22:56,772 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 634 transitions, 11553 flow [2024-06-27 22:22:56,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:56,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:56,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:56,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:22:56,773 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:56,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1420889278, now seen corresponding path program 5 times [2024-06-27 22:22:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559632382] [2024-06-27 22:22:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:58,421 INFO 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:22:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559632382] [2024-06-27 22:22:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559632382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:22:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852583898] [2024-06-27 22:22:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:22:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:22:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:22:58,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:58,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 634 transitions, 11553 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:22:58,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:58,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:58,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:01,831 INFO L124 PetriNetUnfolderBase]: 7036/11054 cut-off events. [2024-06-27 22:23:01,831 INFO L125 PetriNetUnfolderBase]: For 615107/615111 co-relation queries the response was YES. [2024-06-27 22:23:01,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94253 conditions, 11054 events. 7036/11054 cut-off events. For 615107/615111 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 71964 event pairs, 2034 based on Foata normal form. 8/10882 useless extension candidates. Maximal degree in co-relation 94127. Up to 9397 conditions per place. [2024-06-27 22:23:02,012 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 526 selfloop transitions, 156 changer transitions 0/693 dead transitions. [2024-06-27 22:23:02,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 693 transitions, 13787 flow [2024-06-27 22:23:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:23:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:23:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2024-06-27 22:23:02,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020833333333333 [2024-06-27 22:23:02,014 INFO L175 Difference]: Start difference. First operand has 295 places, 634 transitions, 11553 flow. Second operand 10 states and 241 transitions. [2024-06-27 22:23:02,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 693 transitions, 13787 flow [2024-06-27 22:23:03,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 693 transitions, 13426 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-27 22:23:03,344 INFO L231 Difference]: Finished difference. Result has 300 places, 642 transitions, 12015 flow [2024-06-27 22:23:03,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11192, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12015, PETRI_PLACES=300, PETRI_TRANSITIONS=642} [2024-06-27 22:23:03,345 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 246 predicate places. [2024-06-27 22:23:03,345 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 642 transitions, 12015 flow [2024-06-27 22:23:03,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:23:03,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:03,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:03,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:23:03,345 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:03,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1430412478, now seen corresponding path program 6 times [2024-06-27 22:23:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073580524] [2024-06-27 22:23:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073580524] [2024-06-27 22:23:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073580524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:05,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:05,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:23:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231096118] [2024-06-27 22:23:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:05,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:23:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:05,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:23:05,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:23:05,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:05,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 642 transitions, 12015 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:23:05,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:05,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:05,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:08,281 INFO L124 PetriNetUnfolderBase]: 7028/11026 cut-off events. [2024-06-27 22:23:08,281 INFO L125 PetriNetUnfolderBase]: For 623701/623701 co-relation queries the response was YES. [2024-06-27 22:23:08,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95120 conditions, 11026 events. 7028/11026 cut-off events. For 623701/623701 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 71397 event pairs, 1647 based on Foata normal form. 4/10841 useless extension candidates. Maximal degree in co-relation 94991. Up to 9599 conditions per place. [2024-06-27 22:23:08,437 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 526 selfloop transitions, 150 changer transitions 0/687 dead transitions. [2024-06-27 22:23:08,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 687 transitions, 13699 flow [2024-06-27 22:23:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:23:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:23:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-27 22:23:08,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-06-27 22:23:08,439 INFO L175 Difference]: Start difference. First operand has 300 places, 642 transitions, 12015 flow. Second operand 10 states and 237 transitions. [2024-06-27 22:23:08,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 687 transitions, 13699 flow [2024-06-27 22:23:09,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 687 transitions, 13280 flow, removed 149 selfloop flow, removed 5 redundant places. [2024-06-27 22:23:09,840 INFO L231 Difference]: Finished difference. Result has 305 places, 644 transitions, 12027 flow [2024-06-27 22:23:09,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11662, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12027, PETRI_PLACES=305, PETRI_TRANSITIONS=644} [2024-06-27 22:23:09,841 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 251 predicate places. [2024-06-27 22:23:09,841 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 644 transitions, 12027 flow [2024-06-27 22:23:09,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:23:09,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:09,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:09,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:23:09,851 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:09,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1725718157, now seen corresponding path program 15 times [2024-06-27 22:23:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909382751] [2024-06-27 22:23:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:11,462 INFO 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:23:11,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:11,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909382751] [2024-06-27 22:23:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909382751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:11,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:23:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317733160] [2024-06-27 22:23:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:11,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:23:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:23:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:23:11,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:11,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 644 transitions, 12027 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:23:11,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:11,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:11,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:14,519 INFO L124 PetriNetUnfolderBase]: 7038/11062 cut-off events. [2024-06-27 22:23:14,519 INFO L125 PetriNetUnfolderBase]: For 606773/606773 co-relation queries the response was YES. [2024-06-27 22:23:14,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94551 conditions, 11062 events. 7038/11062 cut-off events. For 606773/606773 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 71960 event pairs, 1568 based on Foata normal form. 2/10870 useless extension candidates. Maximal degree in co-relation 94420. Up to 8906 conditions per place. [2024-06-27 22:23:14,735 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 282 selfloop transitions, 404 changer transitions 0/697 dead transitions. [2024-06-27 22:23:14,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 697 transitions, 13981 flow [2024-06-27 22:23:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:23:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:23:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 243 transitions. [2024-06-27 22:23:14,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-06-27 22:23:14,737 INFO L175 Difference]: Start difference. First operand has 305 places, 644 transitions, 12027 flow. Second operand 10 states and 243 transitions. [2024-06-27 22:23:14,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 697 transitions, 13981 flow [2024-06-27 22:23:16,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 697 transitions, 13793 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:16,293 INFO L231 Difference]: Finished difference. Result has 311 places, 650 transitions, 12986 flow [2024-06-27 22:23:16,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11839, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=401, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12986, PETRI_PLACES=311, PETRI_TRANSITIONS=650} [2024-06-27 22:23:16,294 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 257 predicate places. [2024-06-27 22:23:16,294 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 650 transitions, 12986 flow [2024-06-27 22:23:16,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:23:16,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:16,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:16,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:23:16,295 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:16,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1933573543, now seen corresponding path program 3 times [2024-06-27 22:23:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256793564] [2024-06-27 22:23:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256793564] [2024-06-27 22:23:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256793564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611588573] [2024-06-27 22:23:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:17,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:17,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:17,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 650 transitions, 12986 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:23:17,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:17,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:17,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:20,418 INFO L124 PetriNetUnfolderBase]: 7049/11336 cut-off events. [2024-06-27 22:23:20,418 INFO L125 PetriNetUnfolderBase]: For 629921/629921 co-relation queries the response was YES. [2024-06-27 22:23:20,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96684 conditions, 11336 events. 7049/11336 cut-off events. For 629921/629921 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 75469 event pairs, 1571 based on Foata normal form. 2/11073 useless extension candidates. Maximal degree in co-relation 96552. Up to 9764 conditions per place. [2024-06-27 22:23:20,657 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 572 selfloop transitions, 88 changer transitions 0/671 dead transitions. [2024-06-27 22:23:20,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 671 transitions, 14499 flow [2024-06-27 22:23:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:23:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:23:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 22:23:20,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:23:20,659 INFO L175 Difference]: Start difference. First operand has 311 places, 650 transitions, 12986 flow. Second operand 6 states and 148 transitions. [2024-06-27 22:23:20,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 671 transitions, 14499 flow [2024-06-27 22:23:22,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 671 transitions, 13852 flow, removed 127 selfloop flow, removed 7 redundant places. [2024-06-27 22:23:22,970 INFO L231 Difference]: Finished difference. Result has 310 places, 650 transitions, 12526 flow [2024-06-27 22:23:22,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12339, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12526, PETRI_PLACES=310, PETRI_TRANSITIONS=650} [2024-06-27 22:23:22,971 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 256 predicate places. [2024-06-27 22:23:22,971 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 650 transitions, 12526 flow [2024-06-27 22:23:22,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:23:22,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:22,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:22,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:23:22,972 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:22,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1670856326, now seen corresponding path program 1 times [2024-06-27 22:23:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392721904] [2024-06-27 22:23:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:24,059 INFO 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:23:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:24,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392721904] [2024-06-27 22:23:24,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392721904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:24,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:24,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802303080] [2024-06-27 22:23:24,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:24,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:24,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:24,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:23:24,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 650 transitions, 12526 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:23:24,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:24,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:23:24,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:26,757 INFO L124 PetriNetUnfolderBase]: 6549/10670 cut-off events. [2024-06-27 22:23:26,757 INFO L125 PetriNetUnfolderBase]: For 540397/540397 co-relation queries the response was YES. [2024-06-27 22:23:26,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88218 conditions, 10670 events. 6549/10670 cut-off events. For 540397/540397 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 71998 event pairs, 2340 based on Foata normal form. 1/10417 useless extension candidates. Maximal degree in co-relation 88084. Up to 9308 conditions per place. [2024-06-27 22:23:26,899 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 645 selfloop transitions, 23 changer transitions 0/680 dead transitions. [2024-06-27 22:23:26,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 680 transitions, 14235 flow [2024-06-27 22:23:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:23:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:23:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 22:23:26,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-27 22:23:26,901 INFO L175 Difference]: Start difference. First operand has 310 places, 650 transitions, 12526 flow. Second operand 6 states and 149 transitions. [2024-06-27 22:23:26,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 680 transitions, 14235 flow [2024-06-27 22:23:28,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 680 transitions, 14092 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:28,068 INFO L231 Difference]: Finished difference. Result has 314 places, 662 transitions, 12669 flow [2024-06-27 22:23:28,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12385, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12669, PETRI_PLACES=314, PETRI_TRANSITIONS=662} [2024-06-27 22:23:28,069 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 260 predicate places. [2024-06-27 22:23:28,069 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 662 transitions, 12669 flow [2024-06-27 22:23:28,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:23:28,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:28,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:28,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:23:28,070 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:28,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1273718360, now seen corresponding path program 2 times [2024-06-27 22:23:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184107097] [2024-06-27 22:23:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:28,990 INFO 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:23:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184107097] [2024-06-27 22:23:28,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184107097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:28,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225506153] [2024-06-27 22:23:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:28,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:28,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:29,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:23:29,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 662 transitions, 12669 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:23:29,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:29,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:23:29,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:31,648 INFO L124 PetriNetUnfolderBase]: 6546/10665 cut-off events. [2024-06-27 22:23:31,649 INFO L125 PetriNetUnfolderBase]: For 553368/553368 co-relation queries the response was YES. [2024-06-27 22:23:31,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89199 conditions, 10665 events. 6546/10665 cut-off events. For 553368/553368 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 71997 event pairs, 2337 based on Foata normal form. 1/10412 useless extension candidates. Maximal degree in co-relation 89061. Up to 9325 conditions per place. [2024-06-27 22:23:31,814 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 648 selfloop transitions, 16 changer transitions 0/676 dead transitions. [2024-06-27 22:23:31,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 676 transitions, 14043 flow [2024-06-27 22:23:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-06-27 22:23:31,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-27 22:23:31,816 INFO L175 Difference]: Start difference. First operand has 314 places, 662 transitions, 12669 flow. Second operand 7 states and 157 transitions. [2024-06-27 22:23:31,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 676 transitions, 14043 flow [2024-06-27 22:23:33,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 676 transitions, 13898 flow, removed 71 selfloop flow, removed 1 redundant places. [2024-06-27 22:23:33,226 INFO L231 Difference]: Finished difference. Result has 320 places, 662 transitions, 12563 flow [2024-06-27 22:23:33,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12524, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12563, PETRI_PLACES=320, PETRI_TRANSITIONS=662} [2024-06-27 22:23:33,227 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 266 predicate places. [2024-06-27 22:23:33,227 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 662 transitions, 12563 flow [2024-06-27 22:23:33,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:23:33,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:33,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:33,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:23:33,228 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:33,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1308564933, now seen corresponding path program 1 times [2024-06-27 22:23:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834468964] [2024-06-27 22:23:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:34,588 INFO 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:23:34,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834468964] [2024-06-27 22:23:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834468964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:34,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332780761] [2024-06-27 22:23:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:34,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:34,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:34,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:34,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:34,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:34,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 662 transitions, 12563 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:34,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:34,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:34,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:37,499 INFO L124 PetriNetUnfolderBase]: 6810/10957 cut-off events. [2024-06-27 22:23:37,499 INFO L125 PetriNetUnfolderBase]: For 576968/576968 co-relation queries the response was YES. [2024-06-27 22:23:37,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92070 conditions, 10957 events. 6810/10957 cut-off events. For 576968/576968 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 73051 event pairs, 2507 based on Foata normal form. 2/10742 useless extension candidates. Maximal degree in co-relation 91929. Up to 9710 conditions per place. [2024-06-27 22:23:37,685 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 657 selfloop transitions, 22 changer transitions 0/689 dead transitions. [2024-06-27 22:23:37,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 689 transitions, 14105 flow [2024-06-27 22:23:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-27 22:23:37,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2024-06-27 22:23:37,687 INFO L175 Difference]: Start difference. First operand has 320 places, 662 transitions, 12563 flow. Second operand 7 states and 163 transitions. [2024-06-27 22:23:37,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 689 transitions, 14105 flow [2024-06-27 22:23:39,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 689 transitions, 14043 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:23:39,389 INFO L231 Difference]: Finished difference. Result has 321 places, 665 transitions, 12593 flow [2024-06-27 22:23:39,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12501, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12593, PETRI_PLACES=321, PETRI_TRANSITIONS=665} [2024-06-27 22:23:39,390 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 267 predicate places. [2024-06-27 22:23:39,390 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 665 transitions, 12593 flow [2024-06-27 22:23:39,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:39,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:39,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:39,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:23:39,390 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:39,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash -733495900, now seen corresponding path program 1 times [2024-06-27 22:23:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249678689] [2024-06-27 22:23:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:41,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:41,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249678689] [2024-06-27 22:23:41,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249678689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:41,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:23:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088207523] [2024-06-27 22:23:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:23:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:23:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:23:41,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:41,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 665 transitions, 12593 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:23:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:41,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:45,137 INFO L124 PetriNetUnfolderBase]: 7196/11432 cut-off events. [2024-06-27 22:23:45,137 INFO L125 PetriNetUnfolderBase]: For 695186/695190 co-relation queries the response was YES. [2024-06-27 22:23:45,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100120 conditions, 11432 events. 7196/11432 cut-off events. For 695186/695190 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 75199 event pairs, 1881 based on Foata normal form. 20/11221 useless extension candidates. Maximal degree in co-relation 99978. Up to 9747 conditions per place. [2024-06-27 22:23:45,309 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 576 selfloop transitions, 138 changer transitions 0/725 dead transitions. [2024-06-27 22:23:45,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 725 transitions, 14433 flow [2024-06-27 22:23:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:23:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:23:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2024-06-27 22:23:45,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-06-27 22:23:45,311 INFO L175 Difference]: Start difference. First operand has 321 places, 665 transitions, 12593 flow. Second operand 11 states and 272 transitions. [2024-06-27 22:23:45,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 725 transitions, 14433 flow [2024-06-27 22:23:46,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 725 transitions, 14373 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 22:23:46,832 INFO L231 Difference]: Finished difference. Result has 327 places, 666 transitions, 12906 flow [2024-06-27 22:23:46,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12533, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12906, PETRI_PLACES=327, PETRI_TRANSITIONS=666} [2024-06-27 22:23:46,833 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 273 predicate places. [2024-06-27 22:23:46,833 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 666 transitions, 12906 flow [2024-06-27 22:23:46,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:23:46,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:46,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:23:46,834 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:46,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2030317536, now seen corresponding path program 2 times [2024-06-27 22:23:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187302148] [2024-06-27 22:23:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187302148] [2024-06-27 22:23:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187302148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:23:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12316449] [2024-06-27 22:23:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:49,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:23:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:49,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:23:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:23:49,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:49,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 666 transitions, 12906 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:23:49,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:49,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:52,758 INFO L124 PetriNetUnfolderBase]: 7326/11690 cut-off events. [2024-06-27 22:23:52,759 INFO L125 PetriNetUnfolderBase]: For 759866/759870 co-relation queries the response was YES. [2024-06-27 22:23:52,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104132 conditions, 11690 events. 7326/11690 cut-off events. For 759866/759870 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 77824 event pairs, 1915 based on Foata normal form. 20/11463 useless extension candidates. Maximal degree in co-relation 103989. Up to 9949 conditions per place. [2024-06-27 22:23:52,970 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 571 selfloop transitions, 144 changer transitions 0/726 dead transitions. [2024-06-27 22:23:52,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 726 transitions, 14750 flow [2024-06-27 22:23:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:23:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:23:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2024-06-27 22:23:52,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132575757575758 [2024-06-27 22:23:52,972 INFO L175 Difference]: Start difference. First operand has 327 places, 666 transitions, 12906 flow. Second operand 11 states and 271 transitions. [2024-06-27 22:23:52,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 726 transitions, 14750 flow [2024-06-27 22:23:55,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 726 transitions, 14445 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-27 22:23:55,060 INFO L231 Difference]: Finished difference. Result has 329 places, 667 transitions, 12988 flow [2024-06-27 22:23:55,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12601, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12988, PETRI_PLACES=329, PETRI_TRANSITIONS=667} [2024-06-27 22:23:55,061 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 275 predicate places. [2024-06-27 22:23:55,061 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 667 transitions, 12988 flow [2024-06-27 22:23:55,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:23:55,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:55,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:23:55,062 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:55,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2030086896, now seen corresponding path program 3 times [2024-06-27 22:23:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:55,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541690195] [2024-06-27 22:23:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:57,319 INFO 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:23:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541690195] [2024-06-27 22:23:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541690195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:23:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784813616] [2024-06-27 22:23:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:57,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:23:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:57,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:23:57,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:23:57,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:57,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 667 transitions, 12988 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:23:57,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:57,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:57,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:01,059 INFO L124 PetriNetUnfolderBase]: 7506/12079 cut-off events. [2024-06-27 22:24:01,059 INFO L125 PetriNetUnfolderBase]: For 794336/794340 co-relation queries the response was YES. [2024-06-27 22:24:01,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107969 conditions, 12079 events. 7506/12079 cut-off events. For 794336/794340 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 81737 event pairs, 1905 based on Foata normal form. 20/11826 useless extension candidates. Maximal degree in co-relation 107825. Up to 9969 conditions per place. [2024-06-27 22:24:01,276 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 504 selfloop transitions, 284 changer transitions 0/799 dead transitions. [2024-06-27 22:24:01,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 799 transitions, 16442 flow [2024-06-27 22:24:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:24:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:24:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 295 transitions. [2024-06-27 22:24:01,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121527777777778 [2024-06-27 22:24:01,279 INFO L175 Difference]: Start difference. First operand has 329 places, 667 transitions, 12988 flow. Second operand 12 states and 295 transitions. [2024-06-27 22:24:01,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 799 transitions, 16442 flow [2024-06-27 22:24:03,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 799 transitions, 16129 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-27 22:24:03,560 INFO L231 Difference]: Finished difference. Result has 337 places, 734 transitions, 15218 flow [2024-06-27 22:24:03,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12677, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15218, PETRI_PLACES=337, PETRI_TRANSITIONS=734} [2024-06-27 22:24:03,562 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 283 predicate places. [2024-06-27 22:24:03,562 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 734 transitions, 15218 flow [2024-06-27 22:24:03,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:24:03,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:03,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:03,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:24:03,563 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:03,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -692511312, now seen corresponding path program 4 times [2024-06-27 22:24:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521250781] [2024-06-27 22:24:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:05,516 INFO 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:24:05,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:05,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521250781] [2024-06-27 22:24:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521250781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:24:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946414687] [2024-06-27 22:24:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:05,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:24:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:24:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:24:05,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:24:05,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 734 transitions, 15218 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:24:05,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:05,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:24:05,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:09,381 INFO L124 PetriNetUnfolderBase]: 7651/12334 cut-off events. [2024-06-27 22:24:09,382 INFO L125 PetriNetUnfolderBase]: For 841516/841520 co-relation queries the response was YES. [2024-06-27 22:24:09,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112924 conditions, 12334 events. 7651/12334 cut-off events. For 841516/841520 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 83913 event pairs, 1853 based on Foata normal form. 16/12071 useless extension candidates. Maximal degree in co-relation 112775. Up to 9275 conditions per place. [2024-06-27 22:24:09,618 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 467 selfloop transitions, 330 changer transitions 0/808 dead transitions. [2024-06-27 22:24:09,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 808 transitions, 17480 flow [2024-06-27 22:24:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:24:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:24:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 280 transitions. [2024-06-27 22:24:09,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-06-27 22:24:09,619 INFO L175 Difference]: Start difference. First operand has 337 places, 734 transitions, 15218 flow. Second operand 11 states and 280 transitions. [2024-06-27 22:24:09,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 808 transitions, 17480 flow [2024-06-27 22:24:12,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 808 transitions, 15917 flow, removed 333 selfloop flow, removed 10 redundant places. [2024-06-27 22:24:12,353 INFO L231 Difference]: Finished difference. Result has 339 places, 740 transitions, 14703 flow [2024-06-27 22:24:12,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13655, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14703, PETRI_PLACES=339, PETRI_TRANSITIONS=740} [2024-06-27 22:24:12,354 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 285 predicate places. [2024-06-27 22:24:12,355 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 740 transitions, 14703 flow [2024-06-27 22:24:12,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:24:12,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:12,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:12,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:24:12,355 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:12,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -91003834, now seen corresponding path program 1 times [2024-06-27 22:24:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803635363] [2024-06-27 22:24:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:13,661 INFO 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:24:13,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803635363] [2024-06-27 22:24:13,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803635363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:13,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:13,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:24:13,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893680803] [2024-06-27 22:24:13,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:13,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:24:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:13,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:24:13,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:24:13,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:13,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 740 transitions, 14703 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:24:13,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:13,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:13,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:17,881 INFO L124 PetriNetUnfolderBase]: 7963/13025 cut-off events. [2024-06-27 22:24:17,882 INFO L125 PetriNetUnfolderBase]: For 843615/843615 co-relation queries the response was YES. [2024-06-27 22:24:18,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115428 conditions, 13025 events. 7963/13025 cut-off events. For 843615/843615 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 89907 event pairs, 2166 based on Foata normal form. 2/12675 useless extension candidates. Maximal degree in co-relation 115280. Up to 11045 conditions per place. [2024-06-27 22:24:18,168 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 685 selfloop transitions, 98 changer transitions 0/792 dead transitions. [2024-06-27 22:24:18,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 792 transitions, 17011 flow [2024-06-27 22:24:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:24:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:24:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 22:24:18,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:24:18,169 INFO L175 Difference]: Start difference. First operand has 339 places, 740 transitions, 14703 flow. Second operand 8 states and 196 transitions. [2024-06-27 22:24:18,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 792 transitions, 17011 flow [2024-06-27 22:24:20,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 792 transitions, 16275 flow, removed 178 selfloop flow, removed 7 redundant places. [2024-06-27 22:24:20,324 INFO L231 Difference]: Finished difference. Result has 341 places, 750 transitions, 14382 flow [2024-06-27 22:24:20,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13967, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14382, PETRI_PLACES=341, PETRI_TRANSITIONS=750} [2024-06-27 22:24:20,332 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 287 predicate places. [2024-06-27 22:24:20,332 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 750 transitions, 14382 flow [2024-06-27 22:24:20,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:24:20,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:20,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:20,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:24:20,333 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:20,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1337011442, now seen corresponding path program 5 times [2024-06-27 22:24:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271596553] [2024-06-27 22:24:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:22,555 INFO 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:24:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271596553] [2024-06-27 22:24:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271596553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:22,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:24:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173629659] [2024-06-27 22:24:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:22,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:24:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:24:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:24:22,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:24:22,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 750 transitions, 14382 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:24:22,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:22,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:24:22,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:26,978 INFO L124 PetriNetUnfolderBase]: 8012/12914 cut-off events. [2024-06-27 22:24:26,978 INFO L125 PetriNetUnfolderBase]: For 901920/901940 co-relation queries the response was YES. [2024-06-27 22:24:27,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119688 conditions, 12914 events. 8012/12914 cut-off events. For 901920/901940 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 88871 event pairs, 1867 based on Foata normal form. 20/12646 useless extension candidates. Maximal degree in co-relation 119537. Up to 10891 conditions per place. [2024-06-27 22:24:27,283 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 669 selfloop transitions, 141 changer transitions 0/824 dead transitions. [2024-06-27 22:24:27,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 824 transitions, 16844 flow [2024-06-27 22:24:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:24:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:24:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 279 transitions. [2024-06-27 22:24:27,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-06-27 22:24:27,284 INFO L175 Difference]: Start difference. First operand has 341 places, 750 transitions, 14382 flow. Second operand 12 states and 279 transitions. [2024-06-27 22:24:27,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 824 transitions, 16844 flow [2024-06-27 22:24:29,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 824 transitions, 16711 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-27 22:24:29,239 INFO L231 Difference]: Finished difference. Result has 352 places, 769 transitions, 15252 flow [2024-06-27 22:24:29,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=14263, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15252, PETRI_PLACES=352, PETRI_TRANSITIONS=769} [2024-06-27 22:24:29,240 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 298 predicate places. [2024-06-27 22:24:29,240 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 769 transitions, 15252 flow [2024-06-27 22:24:29,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:24:29,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:29,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:29,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:24:29,241 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:29,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1001547556, now seen corresponding path program 6 times [2024-06-27 22:24:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082525142] [2024-06-27 22:24:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:31,606 INFO 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:24:31,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:31,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082525142] [2024-06-27 22:24:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082525142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:24:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159615694] [2024-06-27 22:24:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:31,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:24:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:31,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:24:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:24:31,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:24:31,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 769 transitions, 15252 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:24:31,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:31,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:24:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:36,454 INFO L124 PetriNetUnfolderBase]: 8252/13309 cut-off events. [2024-06-27 22:24:36,454 INFO L125 PetriNetUnfolderBase]: For 990699/990711 co-relation queries the response was YES. [2024-06-27 22:24:36,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126139 conditions, 13309 events. 8252/13309 cut-off events. For 990699/990711 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 92264 event pairs, 1914 based on Foata normal form. 20/13032 useless extension candidates. Maximal degree in co-relation 125983. Up to 11261 conditions per place. [2024-06-27 22:24:36,660 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 683 selfloop transitions, 128 changer transitions 0/825 dead transitions. [2024-06-27 22:24:36,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 825 transitions, 17361 flow [2024-06-27 22:24:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:24:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:24:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2024-06-27 22:24:36,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2024-06-27 22:24:36,661 INFO L175 Difference]: Start difference. First operand has 352 places, 769 transitions, 15252 flow. Second operand 11 states and 262 transitions. [2024-06-27 22:24:36,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 825 transitions, 17361 flow [2024-06-27 22:24:39,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 825 transitions, 17115 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-27 22:24:39,193 INFO L231 Difference]: Finished difference. Result has 358 places, 771 transitions, 15431 flow [2024-06-27 22:24:39,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=15006, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15431, PETRI_PLACES=358, PETRI_TRANSITIONS=771} [2024-06-27 22:24:39,194 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 304 predicate places. [2024-06-27 22:24:39,194 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 771 transitions, 15431 flow [2024-06-27 22:24:39,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:24:39,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:39,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:39,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:24:39,195 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:39,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1802211374, now seen corresponding path program 7 times [2024-06-27 22:24:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660964741] [2024-06-27 22:24:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:41,319 INFO 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:24:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660964741] [2024-06-27 22:24:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660964741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:41,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:24:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964829327] [2024-06-27 22:24:41,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:41,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:24:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:24:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:24:41,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:24:41,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 771 transitions, 15431 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:24:41,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:41,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:24:41,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:46,058 INFO L124 PetriNetUnfolderBase]: 8525/13786 cut-off events. [2024-06-27 22:24:46,059 INFO L125 PetriNetUnfolderBase]: For 1059231/1059243 co-relation queries the response was YES. [2024-06-27 22:24:46,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132432 conditions, 13786 events. 8525/13786 cut-off events. For 1059231/1059243 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 96434 event pairs, 1959 based on Foata normal form. 20/13500 useless extension candidates. Maximal degree in co-relation 132275. Up to 11523 conditions per place. [2024-06-27 22:24:46,270 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 642 selfloop transitions, 181 changer transitions 0/837 dead transitions. [2024-06-27 22:24:46,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 837 transitions, 17807 flow [2024-06-27 22:24:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:24:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:24:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2024-06-27 22:24:46,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2024-06-27 22:24:46,271 INFO L175 Difference]: Start difference. First operand has 358 places, 771 transitions, 15431 flow. Second operand 10 states and 251 transitions. [2024-06-27 22:24:46,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 837 transitions, 17807 flow [2024-06-27 22:24:48,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 837 transitions, 17519 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-27 22:24:48,923 INFO L231 Difference]: Finished difference. Result has 361 places, 780 transitions, 15957 flow [2024-06-27 22:24:48,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=15143, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15957, PETRI_PLACES=361, PETRI_TRANSITIONS=780} [2024-06-27 22:24:48,924 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 307 predicate places. [2024-06-27 22:24:48,924 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 780 transitions, 15957 flow [2024-06-27 22:24:48,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:24:48,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:48,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:48,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:24:48,924 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:48,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1802219744, now seen corresponding path program 8 times [2024-06-27 22:24:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528698519] [2024-06-27 22:24:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:50,949 INFO 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:24:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528698519] [2024-06-27 22:24:50,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528698519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:50,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:24:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707555397] [2024-06-27 22:24:50,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:50,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:24:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:24:50,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:24:51,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:24:51,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 780 transitions, 15957 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:24:51,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:51,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:24:51,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand