./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix038_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix038_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:23:00,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:23:00,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:23:00,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:23:00,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:23:00,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:23:00,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:23:00,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:23:00,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:23:00,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:23:00,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:23:00,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:23:00,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:23:00,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:23:00,964 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:23:00,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:23:00,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:23:00,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:23:00,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:23:00,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:23:00,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:23:00,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:23:00,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:23:00,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:23:00,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:23:00,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:23:00,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:23:00,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:23:00,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:23:00,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:23:00,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:23:00,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:23:00,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:23:00,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:23:00,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:23:00,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:23:00,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:23:00,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:23:00,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:23:00,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:23:00,974 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:23:00,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:23:00,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:23:00,975 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:23:01,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:23:01,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:23:01,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:23:01,227 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:23:01,227 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:23:01,228 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/mix038_tso.oepc.yml/witness.yml [2024-06-27 22:23:01,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:23:01,336 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:23:01,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2024-06-27 22:23:02,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:23:02,588 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:23:02,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2024-06-27 22:23:02,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babba2647/8479ee8bdde64aab93b4a62c586b78e7/FLAG933fe9c10 [2024-06-27 22:23:02,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/babba2647/8479ee8bdde64aab93b4a62c586b78e7 [2024-06-27 22:23:02,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:23:02,612 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:23:02,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:23:02,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:23:02,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:23:02,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:23:01" (1/2) ... [2024-06-27 22:23:02,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767d31b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:23:02, skipping insertion in model container [2024-06-27 22:23:02,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:23:01" (1/2) ... [2024-06-27 22:23:02,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b7f528f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:23:02, skipping insertion in model container [2024-06-27 22:23:02,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:23:02" (2/2) ... [2024-06-27 22:23:02,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767d31b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:02, skipping insertion in model container [2024-06-27 22:23:02,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:23:02" (2/2) ... [2024-06-27 22:23:02,620 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:23:02,638 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:23:02,639 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((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$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 )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (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) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 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_used >= 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:23:02,639 INFO L97 edCorrectnessWitness]: Location invariant before [L833-L833] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((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$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 )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (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) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 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_used >= 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:23:02,639 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((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$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 )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (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) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 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_used >= 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:23:02,640 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:23:02,640 INFO L106 edCorrectnessWitness]: ghost_update [L831-L831] multithreaded = 1; [2024-06-27 22:23:02,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:23:02,827 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/mix038_tso.oepc.i[949,962] [2024-06-27 22:23:02,985 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:23:02,993 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:23:03,019 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/mix038_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:23:03,136 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:23:03,180 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:23:03,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03 WrapperNode [2024-06-27 22:23:03,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:23:03,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:23:03,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:23:03,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:23:03,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,260 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2024-06-27 22:23:03,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:23:03,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:23:03,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:23:03,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:23:03,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,290 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:23:03,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:23:03,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:23:03,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:23:03,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:23:03,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (1/1) ... [2024-06-27 22:23:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:23:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:23:03,367 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:23:03,388 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:23:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:23:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:23:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:23:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:23:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:23:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:23:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:23:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:23:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:23:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:23:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:23:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:23:03,400 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:23:03,552 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:23:03,554 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:23:03,899 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:23:03,900 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:23:04,032 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:23:04,032 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:23:04,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:23:04 BoogieIcfgContainer [2024-06-27 22:23:04,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:23:04,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:23:04,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:23:04,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:23:04,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:23:01" (1/4) ... [2024-06-27 22:23:04,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f202e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:23:04, skipping insertion in model container [2024-06-27 22:23:04,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:23:02" (2/4) ... [2024-06-27 22:23:04,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f202e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:23:04, skipping insertion in model container [2024-06-27 22:23:04,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:23:03" (3/4) ... [2024-06-27 22:23:04,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f202e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:23:04, skipping insertion in model container [2024-06-27 22:23:04,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:23:04" (4/4) ... [2024-06-27 22:23:04,044 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2024-06-27 22:23:04,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:23:04,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:23:04,056 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:23:04,121 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:23:04,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:23:04,181 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 22:23:04,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:23:04,184 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 80 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:23:04,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:23:04,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-06-27 22:23:04,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:23:04,206 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;@3ec705a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:23:04,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:23:04,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:23:04,210 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:23:04,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:23:04,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:04,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:23:04,211 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:23:04,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash 361586064, now seen corresponding path program 1 times [2024-06-27 22:23:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062677813] [2024-06-27 22:23:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:05,311 INFO 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,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062677813] [2024-06-27 22:23:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062677813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:23:05,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698725046] [2024-06-27 22:23:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:05,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:23:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:23:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:23:05,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-06-27 22:23:05,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:05,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-06-27 22:23:05,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:06,134 INFO L124 PetriNetUnfolderBase]: 4328/7100 cut-off events. [2024-06-27 22:23:06,135 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-27 22:23:06,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13399 conditions, 7100 events. 4328/7100 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 46569 event pairs, 3654 based on Foata normal form. 216/6690 useless extension candidates. Maximal degree in co-relation 13387. Up to 6197 conditions per place. [2024-06-27 22:23:06,168 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 43 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-06-27 22:23:06,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 227 flow [2024-06-27 22:23:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:23:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:23:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 22:23:06,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-06-27 22:23:06,179 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 98 transitions. [2024-06-27 22:23:06,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 227 flow [2024-06-27 22:23:06,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:06,186 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 126 flow [2024-06-27 22:23:06,187 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:23:06,190 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-06-27 22:23:06,190 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 126 flow [2024-06-27 22:23:06,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:06,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:06,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:06,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:23:06,191 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:23:06,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -408109137, now seen corresponding path program 1 times [2024-06-27 22:23:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135974417] [2024-06-27 22:23:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:06,958 INFO 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:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135974417] [2024-06-27 22:23:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135974417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:06,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:06,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:23:06,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846690471] [2024-06-27 22:23:06,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:06,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:23:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:23:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:23:07,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:23:07,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:07,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:07,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:23:07,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:07,665 INFO L124 PetriNetUnfolderBase]: 5023/7467 cut-off events. [2024-06-27 22:23:07,665 INFO L125 PetriNetUnfolderBase]: For 977/977 co-relation queries the response was YES. [2024-06-27 22:23:07,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16357 conditions, 7467 events. 5023/7467 cut-off events. For 977/977 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 43135 event pairs, 2852 based on Foata normal form. 3/7094 useless extension candidates. Maximal degree in co-relation 16345. Up to 7140 conditions per place. [2024-06-27 22:23:07,698 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 56 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2024-06-27 22:23:07,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 318 flow [2024-06-27 22:23:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:23:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:23:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-06-27 22:23:07,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-06-27 22:23:07,702 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 126 flow. Second operand 4 states and 123 transitions. [2024-06-27 22:23:07,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 318 flow [2024-06-27 22:23:07,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:23:07,708 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 164 flow [2024-06-27 22:23:07,708 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:23:07,709 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-06-27 22:23:07,709 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 164 flow [2024-06-27 22:23:07,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:07,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:07,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:07,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:23:07,712 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:23:07,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 233519775, now seen corresponding path program 1 times [2024-06-27 22:23:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962258339] [2024-06-27 22:23:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:08,475 INFO 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:08,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962258339] [2024-06-27 22:23:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962258339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:08,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:23:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817971912] [2024-06-27 22:23:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:08,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:23:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:23:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:23:08,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:23:08,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 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:08,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:08,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:23:08,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:09,213 INFO L124 PetriNetUnfolderBase]: 4965/7855 cut-off events. [2024-06-27 22:23:09,213 INFO L125 PetriNetUnfolderBase]: For 2919/2919 co-relation queries the response was YES. [2024-06-27 22:23:09,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18181 conditions, 7855 events. 4965/7855 cut-off events. For 2919/2919 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 49674 event pairs, 2990 based on Foata normal form. 6/7255 useless extension candidates. Maximal degree in co-relation 18167. Up to 7029 conditions per place. [2024-06-27 22:23:09,248 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 66 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-06-27 22:23:09,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 448 flow [2024-06-27 22:23:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:23:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:23:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-06-27 22:23:09,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6125 [2024-06-27 22:23:09,250 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 164 flow. Second operand 5 states and 147 transitions. [2024-06-27 22:23:09,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 448 flow [2024-06-27 22:23:09,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 422 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:23:09,252 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 265 flow [2024-06-27 22:23:09,253 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-06-27 22:23:09,253 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2024-06-27 22:23:09,253 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 265 flow [2024-06-27 22:23:09,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:09,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:09,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:09,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:23:09,254 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:23:09,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1072457756, now seen corresponding path program 1 times [2024-06-27 22:23:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:09,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106058312] [2024-06-27 22:23:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:10,163 INFO 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:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106058312] [2024-06-27 22:23:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106058312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184408505] [2024-06-27 22:23:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:10,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:10,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:23:10,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:10,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:10,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:23:10,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:11,098 INFO L124 PetriNetUnfolderBase]: 4919/7770 cut-off events. [2024-06-27 22:23:11,099 INFO L125 PetriNetUnfolderBase]: For 5277/5277 co-relation queries the response was YES. [2024-06-27 22:23:11,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19733 conditions, 7770 events. 4919/7770 cut-off events. For 5277/5277 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 49069 event pairs, 2474 based on Foata normal form. 6/7194 useless extension candidates. Maximal degree in co-relation 19716. Up to 6921 conditions per place. [2024-06-27 22:23:11,148 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 72 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2024-06-27 22:23:11,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 537 flow [2024-06-27 22:23:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:23:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:23:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:23:11,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 22:23:11,152 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 265 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:23:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 537 flow [2024-06-27 22:23:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 529 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 22:23:11,161 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 317 flow [2024-06-27 22:23:11,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-06-27 22:23:11,163 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2024-06-27 22:23:11,163 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 317 flow [2024-06-27 22:23:11,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:11,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:11,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:23:11,164 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:23:11,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash 438057911, now seen corresponding path program 1 times [2024-06-27 22:23:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284178929] [2024-06-27 22:23:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284178929] [2024-06-27 22:23:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284178929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:23:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329758202] [2024-06-27 22:23:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:12,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:23:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:23:12,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:23:12,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:12,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:23:12,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:12,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:12,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:13,009 INFO L124 PetriNetUnfolderBase]: 5533/8720 cut-off events. [2024-06-27 22:23:13,009 INFO L125 PetriNetUnfolderBase]: For 8827/8827 co-relation queries the response was YES. [2024-06-27 22:23:13,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23497 conditions, 8720 events. 5533/8720 cut-off events. For 8827/8827 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 55579 event pairs, 3109 based on Foata normal form. 2/8128 useless extension candidates. Maximal degree in co-relation 23476. Up to 7861 conditions per place. [2024-06-27 22:23:13,047 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 67 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-06-27 22:23:13,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 573 flow [2024-06-27 22:23:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:23:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:23:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-27 22:23:13,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:23:13,048 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 317 flow. Second operand 6 states and 132 transitions. [2024-06-27 22:23:13,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 573 flow [2024-06-27 22:23:13,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 523 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:13,057 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 388 flow [2024-06-27 22:23:13,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-06-27 22:23:13,058 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2024-06-27 22:23:13,058 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 388 flow [2024-06-27 22:23:13,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:23:13,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:13,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:13,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:23:13,059 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:23:13,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 675692608, now seen corresponding path program 1 times [2024-06-27 22:23:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136759237] [2024-06-27 22:23:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:13,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:13,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136759237] [2024-06-27 22:23:13,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136759237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:13,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:13,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027150177] [2024-06-27 22:23:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:13,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:13,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:13,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:23:13,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:13,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:13,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:14,803 INFO L124 PetriNetUnfolderBase]: 5570/8771 cut-off events. [2024-06-27 22:23:14,804 INFO L125 PetriNetUnfolderBase]: For 12039/12039 co-relation queries the response was YES. [2024-06-27 22:23:14,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25110 conditions, 8771 events. 5570/8771 cut-off events. For 12039/12039 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 55541 event pairs, 3070 based on Foata normal form. 2/8175 useless extension candidates. Maximal degree in co-relation 25085. Up to 7887 conditions per place. [2024-06-27 22:23:14,859 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 79 selfloop transitions, 21 changer transitions 0/109 dead transitions. [2024-06-27 22:23:14,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 728 flow [2024-06-27 22:23:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-06-27 22:23:14,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-27 22:23:14,861 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 388 flow. Second operand 7 states and 157 transitions. [2024-06-27 22:23:14,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 728 flow [2024-06-27 22:23:14,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 716 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:23:14,869 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 535 flow [2024-06-27 22:23:14,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=535, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2024-06-27 22:23:14,871 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2024-06-27 22:23:14,871 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 535 flow [2024-06-27 22:23:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:23:14,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:14,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:14,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:23:14,872 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:23:14,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 66877398, now seen corresponding path program 2 times [2024-06-27 22:23:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240063246] [2024-06-27 22:23:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:15,810 INFO 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:15,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240063246] [2024-06-27 22:23:15,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240063246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307854230] [2024-06-27 22:23:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:15,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:15,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:15,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:23:15,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:15,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:15,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:16,867 INFO L124 PetriNetUnfolderBase]: 5588/8808 cut-off events. [2024-06-27 22:23:16,867 INFO L125 PetriNetUnfolderBase]: For 16625/16633 co-relation queries the response was YES. [2024-06-27 22:23:16,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26831 conditions, 8808 events. 5588/8808 cut-off events. For 16625/16633 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 55832 event pairs, 3049 based on Foata normal form. 10/8223 useless extension candidates. Maximal degree in co-relation 26802. Up to 7871 conditions per place. [2024-06-27 22:23:16,913 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 77 selfloop transitions, 32 changer transitions 0/118 dead transitions. [2024-06-27 22:23:16,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 118 transitions, 893 flow [2024-06-27 22:23:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-27 22:23:16,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-06-27 22:23:16,915 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 535 flow. Second operand 7 states and 159 transitions. [2024-06-27 22:23:16,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 118 transitions, 893 flow [2024-06-27 22:23:16,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 871 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-27 22:23:16,924 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 658 flow [2024-06-27 22:23:16,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=658, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2024-06-27 22:23:16,925 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2024-06-27 22:23:16,925 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 658 flow [2024-06-27 22:23:16,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:23:16,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:16,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:16,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:23:16,926 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:23:16,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash -55554346, now seen corresponding path program 3 times [2024-06-27 22:23:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:16,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325221194] [2024-06-27 22:23:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:17,628 INFO 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,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325221194] [2024-06-27 22:23:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325221194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164545974] [2024-06-27 22:23:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:17,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:17,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:23:17,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:17,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:17,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:18,853 INFO L124 PetriNetUnfolderBase]: 5611/8844 cut-off events. [2024-06-27 22:23:18,853 INFO L125 PetriNetUnfolderBase]: For 21998/21998 co-relation queries the response was YES. [2024-06-27 22:23:18,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28590 conditions, 8844 events. 5611/8844 cut-off events. For 21998/21998 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 55980 event pairs, 3041 based on Foata normal form. 2/8251 useless extension candidates. Maximal degree in co-relation 28558. Up to 7930 conditions per place. [2024-06-27 22:23:18,911 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 93 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2024-06-27 22:23:18,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 133 transitions, 1047 flow [2024-06-27 22:23:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 22:23:18,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2024-06-27 22:23:18,913 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 658 flow. Second operand 7 states and 167 transitions. [2024-06-27 22:23:18,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 133 transitions, 1047 flow [2024-06-27 22:23:18,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 133 transitions, 990 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:18,938 INFO L231 Difference]: Finished difference. Result has 89 places, 106 transitions, 772 flow [2024-06-27 22:23:18,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=89, PETRI_TRANSITIONS=106} [2024-06-27 22:23:18,939 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2024-06-27 22:23:18,939 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 106 transitions, 772 flow [2024-06-27 22:23:18,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:23:18,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:18,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:18,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:23:18,940 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:23:18,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 925760856, now seen corresponding path program 1 times [2024-06-27 22:23:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:18,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892811347] [2024-06-27 22:23:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892811347] [2024-06-27 22:23:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892811347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:20,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929555206] [2024-06-27 22:23:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:20,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:20,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:20,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 106 transitions, 772 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:20,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:20,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:21,324 INFO L124 PetriNetUnfolderBase]: 5699/9104 cut-off events. [2024-06-27 22:23:21,324 INFO L125 PetriNetUnfolderBase]: For 24422/24422 co-relation queries the response was YES. [2024-06-27 22:23:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29590 conditions, 9104 events. 5699/9104 cut-off events. For 24422/24422 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 58554 event pairs, 3030 based on Foata normal form. 2/8498 useless extension candidates. Maximal degree in co-relation 29555. Up to 8066 conditions per place. [2024-06-27 22:23:21,379 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 109 selfloop transitions, 30 changer transitions 0/148 dead transitions. [2024-06-27 22:23:21,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 148 transitions, 1254 flow [2024-06-27 22:23:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-27 22:23:21,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-27 22:23:21,381 INFO L175 Difference]: Start difference. First operand has 89 places, 106 transitions, 772 flow. Second operand 8 states and 180 transitions. [2024-06-27 22:23:21,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 148 transitions, 1254 flow [2024-06-27 22:23:21,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 148 transitions, 1187 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 22:23:21,403 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 923 flow [2024-06-27 22:23:21,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=923, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2024-06-27 22:23:21,404 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 40 predicate places. [2024-06-27 22:23:21,404 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 923 flow [2024-06-27 22:23:21,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:21,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:21,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:21,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:23:21,405 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:23:21,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1895025042, now seen corresponding path program 1 times [2024-06-27 22:23:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080125340] [2024-06-27 22:23:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:22,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:22,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080125340] [2024-06-27 22:23:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080125340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:22,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:22,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:22,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527478323] [2024-06-27 22:23:22,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:22,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:22,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:22,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 923 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:22,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:22,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:22,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:23,657 INFO L124 PetriNetUnfolderBase]: 6535/10262 cut-off events. [2024-06-27 22:23:23,657 INFO L125 PetriNetUnfolderBase]: For 36847/36847 co-relation queries the response was YES. [2024-06-27 22:23:23,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36511 conditions, 10262 events. 6535/10262 cut-off events. For 36847/36847 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 66114 event pairs, 2971 based on Foata normal form. 2/9614 useless extension candidates. Maximal degree in co-relation 36474. Up to 9146 conditions per place. [2024-06-27 22:23:23,732 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 118 selfloop transitions, 46 changer transitions 0/174 dead transitions. [2024-06-27 22:23:23,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 174 transitions, 1496 flow [2024-06-27 22:23:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:23:23,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-27 22:23:23,734 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 923 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:23:23,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 174 transitions, 1496 flow [2024-06-27 22:23:23,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 174 transitions, 1428 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:23,783 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1143 flow [2024-06-27 22:23:23,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1143, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2024-06-27 22:23:23,784 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2024-06-27 22:23:23,784 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1143 flow [2024-06-27 22:23:23,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:23,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:23,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:23,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:23:23,785 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:23:23,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1895145942, now seen corresponding path program 2 times [2024-06-27 22:23:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33232787] [2024-06-27 22:23:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:24,733 INFO 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,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33232787] [2024-06-27 22:23:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33232787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:24,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:24,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167469792] [2024-06-27 22:23:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:24,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:24,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:24,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1143 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:24,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:24,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:24,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:26,180 INFO L124 PetriNetUnfolderBase]: 6588/10326 cut-off events. [2024-06-27 22:23:26,180 INFO L125 PetriNetUnfolderBase]: For 48122/48122 co-relation queries the response was YES. [2024-06-27 22:23:26,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40162 conditions, 10326 events. 6588/10326 cut-off events. For 48122/48122 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 66379 event pairs, 2938 based on Foata normal form. 2/9672 useless extension candidates. Maximal degree in co-relation 40121. Up to 9160 conditions per place. [2024-06-27 22:23:26,234 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 116 selfloop transitions, 61 changer transitions 0/187 dead transitions. [2024-06-27 22:23:26,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 187 transitions, 1797 flow [2024-06-27 22:23:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 22:23:26,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2024-06-27 22:23:26,237 INFO L175 Difference]: Start difference. First operand has 102 places, 141 transitions, 1143 flow. Second operand 8 states and 193 transitions. [2024-06-27 22:23:26,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 187 transitions, 1797 flow [2024-06-27 22:23:26,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 187 transitions, 1717 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-27 22:23:26,275 INFO L231 Difference]: Finished difference. Result has 109 places, 153 transitions, 1372 flow [2024-06-27 22:23:26,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1372, PETRI_PLACES=109, PETRI_TRANSITIONS=153} [2024-06-27 22:23:26,276 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 55 predicate places. [2024-06-27 22:23:26,276 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 153 transitions, 1372 flow [2024-06-27 22:23:26,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:26,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:26,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:26,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:23:26,277 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:23:26,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2073200022, now seen corresponding path program 3 times [2024-06-27 22:23:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921905956] [2024-06-27 22:23:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:27,327 INFO 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:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921905956] [2024-06-27 22:23:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921905956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:27,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127133709] [2024-06-27 22:23:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:27,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:27,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 153 transitions, 1372 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:27,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:27,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:27,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:28,666 INFO L124 PetriNetUnfolderBase]: 6649/10443 cut-off events. [2024-06-27 22:23:28,667 INFO L125 PetriNetUnfolderBase]: For 67484/67488 co-relation queries the response was YES. [2024-06-27 22:23:28,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44795 conditions, 10443 events. 6649/10443 cut-off events. For 67484/67488 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 67189 event pairs, 2900 based on Foata normal form. 6/9803 useless extension candidates. Maximal degree in co-relation 44751. Up to 9138 conditions per place. [2024-06-27 22:23:28,746 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 98 selfloop transitions, 92 changer transitions 0/200 dead transitions. [2024-06-27 22:23:28,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 200 transitions, 2136 flow [2024-06-27 22:23:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 22:23:28,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327380952380952 [2024-06-27 22:23:28,748 INFO L175 Difference]: Start difference. First operand has 109 places, 153 transitions, 1372 flow. Second operand 7 states and 179 transitions. [2024-06-27 22:23:28,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 200 transitions, 2136 flow [2024-06-27 22:23:28,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 200 transitions, 1992 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-27 22:23:28,826 INFO L231 Difference]: Finished difference. Result has 113 places, 168 transitions, 1720 flow [2024-06-27 22:23:28,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1720, PETRI_PLACES=113, PETRI_TRANSITIONS=168} [2024-06-27 22:23:28,827 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-06-27 22:23:28,827 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 168 transitions, 1720 flow [2024-06-27 22:23:28,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:28,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:28,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:28,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:23:28,828 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:23:28,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1928884714, now seen corresponding path program 4 times [2024-06-27 22:23:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980665057] [2024-06-27 22:23:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:29,636 INFO 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:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980665057] [2024-06-27 22:23:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980665057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:29,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190971336] [2024-06-27 22:23:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:29,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:29,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:29,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 168 transitions, 1720 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:29,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:29,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:29,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:31,032 INFO L124 PetriNetUnfolderBase]: 6717/10543 cut-off events. [2024-06-27 22:23:31,032 INFO L125 PetriNetUnfolderBase]: For 88643/88649 co-relation queries the response was YES. [2024-06-27 22:23:31,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49296 conditions, 10543 events. 6717/10543 cut-off events. For 88643/88649 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 67824 event pairs, 2910 based on Foata normal form. 8/9906 useless extension candidates. Maximal degree in co-relation 49249. Up to 9361 conditions per place. [2024-06-27 22:23:31,104 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 153 selfloop transitions, 66 changer transitions 0/229 dead transitions. [2024-06-27 22:23:31,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 229 transitions, 2571 flow [2024-06-27 22:23:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 22:23:31,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130208333333334 [2024-06-27 22:23:31,106 INFO L175 Difference]: Start difference. First operand has 113 places, 168 transitions, 1720 flow. Second operand 8 states and 197 transitions. [2024-06-27 22:23:31,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 229 transitions, 2571 flow [2024-06-27 22:23:31,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 229 transitions, 2404 flow, removed 60 selfloop flow, removed 2 redundant places. [2024-06-27 22:23:31,251 INFO L231 Difference]: Finished difference. Result has 121 places, 192 transitions, 2034 flow [2024-06-27 22:23:31,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2034, PETRI_PLACES=121, PETRI_TRANSITIONS=192} [2024-06-27 22:23:31,252 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2024-06-27 22:23:31,252 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 192 transitions, 2034 flow [2024-06-27 22:23:31,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:31,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:31,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:31,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:23:31,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:31,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 853046384, now seen corresponding path program 5 times [2024-06-27 22:23:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567473346] [2024-06-27 22:23:31,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:32,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:23:32,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:32,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567473346] [2024-06-27 22:23:32,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567473346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437574907] [2024-06-27 22:23:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:32,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:32,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:32,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:32,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 192 transitions, 2034 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:32,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:32,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:32,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:33,654 INFO L124 PetriNetUnfolderBase]: 6835/10717 cut-off events. [2024-06-27 22:23:33,654 INFO L125 PetriNetUnfolderBase]: For 95916/95924 co-relation queries the response was YES. [2024-06-27 22:23:33,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51013 conditions, 10717 events. 6835/10717 cut-off events. For 95916/95924 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 68870 event pairs, 2911 based on Foata normal form. 10/10082 useless extension candidates. Maximal degree in co-relation 50962. Up to 9475 conditions per place. [2024-06-27 22:23:33,743 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 169 selfloop transitions, 94 changer transitions 0/273 dead transitions. [2024-06-27 22:23:33,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 273 transitions, 3347 flow [2024-06-27 22:23:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:23:33,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2024-06-27 22:23:33,745 INFO L175 Difference]: Start difference. First operand has 121 places, 192 transitions, 2034 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:23:33,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 273 transitions, 3347 flow [2024-06-27 22:23:33,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 273 transitions, 3107 flow, removed 83 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:33,899 INFO L231 Difference]: Finished difference. Result has 129 places, 236 transitions, 2749 flow [2024-06-27 22:23:33,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2749, PETRI_PLACES=129, PETRI_TRANSITIONS=236} [2024-06-27 22:23:33,899 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 75 predicate places. [2024-06-27 22:23:33,899 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 236 transitions, 2749 flow [2024-06-27 22:23:33,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:33,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:33,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:33,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:23:33,900 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:23:33,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash 853167284, now seen corresponding path program 6 times [2024-06-27 22:23:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:33,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600897334] [2024-06-27 22:23:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:34,750 INFO 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,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600897334] [2024-06-27 22:23:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600897334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254065617] [2024-06-27 22:23:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:34,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:34,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:34,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 236 transitions, 2749 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:34,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:34,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:34,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:36,461 INFO L124 PetriNetUnfolderBase]: 7013/10976 cut-off events. [2024-06-27 22:23:36,461 INFO L125 PetriNetUnfolderBase]: For 103956/103956 co-relation queries the response was YES. [2024-06-27 22:23:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53680 conditions, 10976 events. 7013/10976 cut-off events. For 103956/103956 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 70470 event pairs, 2920 based on Foata normal form. 4/10333 useless extension candidates. Maximal degree in co-relation 53625. Up to 9391 conditions per place. [2024-06-27 22:23:36,545 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 192 selfloop transitions, 104 changer transitions 0/306 dead transitions. [2024-06-27 22:23:36,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 306 transitions, 4054 flow [2024-06-27 22:23:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 22:23:36,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 22:23:36,547 INFO L175 Difference]: Start difference. First operand has 129 places, 236 transitions, 2749 flow. Second operand 8 states and 204 transitions. [2024-06-27 22:23:36,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 306 transitions, 4054 flow [2024-06-27 22:23:36,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 306 transitions, 3920 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:36,699 INFO L231 Difference]: Finished difference. Result has 135 places, 261 transitions, 3293 flow [2024-06-27 22:23:36,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3293, PETRI_PLACES=135, PETRI_TRANSITIONS=261} [2024-06-27 22:23:36,700 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 81 predicate places. [2024-06-27 22:23:36,700 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 261 transitions, 3293 flow [2024-06-27 22:23:36,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:36,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:36,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:36,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:23:36,701 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:36,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1366183573, now seen corresponding path program 1 times [2024-06-27 22:23:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627489192] [2024-06-27 22:23:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627489192] [2024-06-27 22:23:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627489192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:38,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641700548] [2024-06-27 22:23:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:38,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:38,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:38,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 261 transitions, 3293 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:38,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:38,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:38,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:39,759 INFO L124 PetriNetUnfolderBase]: 6536/10264 cut-off events. [2024-06-27 22:23:39,759 INFO L125 PetriNetUnfolderBase]: For 114754/114754 co-relation queries the response was YES. [2024-06-27 22:23:39,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53401 conditions, 10264 events. 6536/10264 cut-off events. For 114754/114754 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 64587 event pairs, 2639 based on Foata normal form. 4/9658 useless extension candidates. Maximal degree in co-relation 53344. Up to 9184 conditions per place. [2024-06-27 22:23:39,851 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 257 selfloop transitions, 33 changer transitions 0/299 dead transitions. [2024-06-27 22:23:39,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 299 transitions, 4087 flow [2024-06-27 22:23:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 22:23:39,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2024-06-27 22:23:39,853 INFO L175 Difference]: Start difference. First operand has 135 places, 261 transitions, 3293 flow. Second operand 8 states and 191 transitions. [2024-06-27 22:23:39,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 299 transitions, 4087 flow [2024-06-27 22:23:40,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 299 transitions, 3874 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:40,095 INFO L231 Difference]: Finished difference. Result has 139 places, 264 transitions, 3204 flow [2024-06-27 22:23:40,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3080, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3204, PETRI_PLACES=139, PETRI_TRANSITIONS=264} [2024-06-27 22:23:40,095 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 85 predicate places. [2024-06-27 22:23:40,095 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 264 transitions, 3204 flow [2024-06-27 22:23:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:40,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:40,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:40,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:23:40,096 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:40,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1687568160, now seen corresponding path program 1 times [2024-06-27 22:23:40,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:40,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953622179] [2024-06-27 22:23:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:40,152 INFO 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:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:40,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953622179] [2024-06-27 22:23:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953622179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:23:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232957744] [2024-06-27 22:23:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:40,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:23:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:40,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:23:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:23:40,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2024-06-27 22:23:40,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 264 transitions, 3204 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:40,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:40,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2024-06-27 22:23:40,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:40,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L780-->L787: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0))) (.cse2 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_66 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24) v_~x$r_buff1_thd2~0_23) (= (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_67) v_~x$w_buff1_used~0_66) (= v_~x~0_31 (ite .cse4 v_~x$w_buff0~0_29 (ite .cse3 v_~x$w_buff1~0_24 v_~x~0_32))) (= (ite .cse4 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][93], [Black: 124#(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) (= ~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: 126#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~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) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 133#true, 84#true, 237#true, Black: 139#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= 2 ~x~0) (<= ~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) (= 2 ~x$w_buff0~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) (= ~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 0)), Black: 137#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~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)) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))), Black: 138#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 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) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~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))) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))), 181#true, 96#true, 48#L758true, Black: 161#(and (= ~__unbuffered_cnt~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)) (= ~a~0 1) (= ~x~0 1)) (= |#ghost~multithreaded| 0)) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 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) (= ~x$mem_tmp~0 0)), 248#true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 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) (= ~x$mem_tmp~0 0)), Black: 153#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~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)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~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$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 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) (or (= |#ghost~multithreaded| 0) (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)) (= ~a~0 1))) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 43#L787true, Black: 171#(and (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~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) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 172#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~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) (= ~x~0 1) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0)), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 28#L840true, P2Thread1of1ForFork1InUse, Black: 185#(and (= 2 ~x$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 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) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 186#(and (= 2 ~x$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__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) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~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) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~a~0 0) (= 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)), Black: 187#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__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) (= ~x~0 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$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~x$w_buff0~0)), 42#L797true, 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) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 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)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~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) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 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)), 166#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~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) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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)), Black: 199#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~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) (= ~x~0 1) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~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) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 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)), Black: 197#(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) (= ~x~0 1) (= 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: 203#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (or (= |#ghost~multithreaded| 0) (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)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x~0 1) (= 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: 82#(and (= 0 ~x$w_buff1~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) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 210#(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) (= ~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) (= ~x$mem_tmp~0 0)), Black: 213#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~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)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~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$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 88#(and (= ~x$r_buff1_thd3~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~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) (= ~a~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$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 219#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (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 1))) (= 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) (= ~x$mem_tmp~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (or (= |#ghost~multithreaded| 0) (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)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 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) (= ~x$mem_tmp~0 0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (or (= |#ghost~multithreaded| 0) (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)))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~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)), 224#true, 110#true, Black: 229#(and (= ~x$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~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)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~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$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0)), Black: 101#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~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) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 230#(and (= ~x$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~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)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~x~0 1) (= ~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$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0)), Black: 98#(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) (= ~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: 244#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~x$w_buff0_used~0 0) (or (and (= 0 ~x$w_buff1~0) (<= ~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$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~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) (= ~a~0 0) (<= 1 ~__unbuffered_cnt~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))), Black: 115#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 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)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~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) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0))]) [2024-06-27 22:23:40,538 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-27 22:23:40,538 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 22:23:40,538 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 22:23:40,538 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 22:23:40,858 INFO L124 PetriNetUnfolderBase]: 2573/4973 cut-off events. [2024-06-27 22:23:40,858 INFO L125 PetriNetUnfolderBase]: For 52926/53424 co-relation queries the response was YES. [2024-06-27 22:23:40,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24978 conditions, 4973 events. 2573/4973 cut-off events. For 52926/53424 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 37169 event pairs, 850 based on Foata normal form. 133/4723 useless extension candidates. Maximal degree in co-relation 24920. Up to 2827 conditions per place. [2024-06-27 22:23:40,897 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 142 selfloop transitions, 23 changer transitions 0/276 dead transitions. [2024-06-27 22:23:40,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 276 transitions, 3610 flow [2024-06-27 22:23:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:23:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:23:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-06-27 22:23:40,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2024-06-27 22:23:40,898 INFO L175 Difference]: Start difference. First operand has 139 places, 264 transitions, 3204 flow. Second operand 3 states and 110 transitions. [2024-06-27 22:23:40,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 276 transitions, 3610 flow [2024-06-27 22:23:40,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 276 transitions, 3516 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 22:23:40,957 INFO L231 Difference]: Finished difference. Result has 134 places, 263 transitions, 3146 flow [2024-06-27 22:23:40,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3146, PETRI_PLACES=134, PETRI_TRANSITIONS=263} [2024-06-27 22:23:40,958 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 80 predicate places. [2024-06-27 22:23:40,958 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 263 transitions, 3146 flow [2024-06-27 22:23:40,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:40,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:40,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:40,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:23:40,959 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:40,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1687567790, now seen corresponding path program 1 times [2024-06-27 22:23:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840083888] [2024-06-27 22:23:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:41,734 INFO 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,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:41,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840083888] [2024-06-27 22:23:41,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840083888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:41,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:23:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765418149] [2024-06-27 22:23:41,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:41,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:23:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:41,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:23:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:23:41,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:41,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 263 transitions, 3146 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:41,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:41,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:43,038 INFO L124 PetriNetUnfolderBase]: 5823/9294 cut-off events. [2024-06-27 22:23:43,038 INFO L125 PetriNetUnfolderBase]: For 108808/108808 co-relation queries the response was YES. [2024-06-27 22:23:43,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48857 conditions, 9294 events. 5823/9294 cut-off events. For 108808/108808 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 57468 event pairs, 2262 based on Foata normal form. 1/9025 useless extension candidates. Maximal degree in co-relation 48799. Up to 8243 conditions per place. [2024-06-27 22:23:43,121 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 255 selfloop transitions, 16 changer transitions 3/283 dead transitions. [2024-06-27 22:23:43,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 283 transitions, 3804 flow [2024-06-27 22:23:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:23:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:23:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-27 22:23:43,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2024-06-27 22:23:43,123 INFO L175 Difference]: Start difference. First operand has 134 places, 263 transitions, 3146 flow. Second operand 5 states and 121 transitions. [2024-06-27 22:23:43,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 283 transitions, 3804 flow [2024-06-27 22:23:43,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 283 transitions, 3756 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:23:43,307 INFO L231 Difference]: Finished difference. Result has 137 places, 265 transitions, 3168 flow [2024-06-27 22:23:43,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3168, PETRI_PLACES=137, PETRI_TRANSITIONS=265} [2024-06-27 22:23:43,307 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 83 predicate places. [2024-06-27 22:23:43,308 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 265 transitions, 3168 flow [2024-06-27 22:23:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:43,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:43,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:43,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:23:43,308 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:23:43,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 636545135, now seen corresponding path program 1 times [2024-06-27 22:23:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919660907] [2024-06-27 22:23:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:43,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:44,388 INFO 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:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919660907] [2024-06-27 22:23:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919660907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:44,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684600229] [2024-06-27 22:23:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:44,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:44,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:44,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 265 transitions, 3168 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:44,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:44,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:44,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:46,008 INFO L124 PetriNetUnfolderBase]: 5551/8855 cut-off events. [2024-06-27 22:23:46,008 INFO L125 PetriNetUnfolderBase]: For 118548/118548 co-relation queries the response was YES. [2024-06-27 22:23:46,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48988 conditions, 8855 events. 5551/8855 cut-off events. For 118548/118548 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 55444 event pairs, 2036 based on Foata normal form. 6/8643 useless extension candidates. Maximal degree in co-relation 48927. Up to 7619 conditions per place. [2024-06-27 22:23:46,066 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 207 selfloop transitions, 92 changer transitions 0/309 dead transitions. [2024-06-27 22:23:46,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 309 transitions, 4189 flow [2024-06-27 22:23:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 22:23:46,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-27 22:23:46,067 INFO L175 Difference]: Start difference. First operand has 137 places, 265 transitions, 3168 flow. Second operand 8 states and 188 transitions. [2024-06-27 22:23:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 309 transitions, 4189 flow [2024-06-27 22:23:46,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 309 transitions, 4098 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:23:46,203 INFO L231 Difference]: Finished difference. Result has 141 places, 278 transitions, 3560 flow [2024-06-27 22:23:46,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3560, PETRI_PLACES=141, PETRI_TRANSITIONS=278} [2024-06-27 22:23:46,203 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 87 predicate places. [2024-06-27 22:23:46,203 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 278 transitions, 3560 flow [2024-06-27 22:23:46,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:46,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:46,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:46,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:23:46,204 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:23:46,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1380010283, now seen corresponding path program 1 times [2024-06-27 22:23:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402858761] [2024-06-27 22:23:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402858761] [2024-06-27 22:23:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402858761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:47,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:47,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911002476] [2024-06-27 22:23:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:47,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:47,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:23:47,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 278 transitions, 3560 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:47,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:47,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:23:47,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:48,925 INFO L124 PetriNetUnfolderBase]: 6189/9607 cut-off events. [2024-06-27 22:23:48,925 INFO L125 PetriNetUnfolderBase]: For 136189/136189 co-relation queries the response was YES. [2024-06-27 22:23:48,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55159 conditions, 9607 events. 6189/9607 cut-off events. For 136189/136189 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 57161 event pairs, 1805 based on Foata normal form. 9/9397 useless extension candidates. Maximal degree in co-relation 55097. Up to 8239 conditions per place. [2024-06-27 22:23:49,006 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 207 selfloop transitions, 155 changer transitions 0/370 dead transitions. [2024-06-27 22:23:49,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 370 transitions, 5325 flow [2024-06-27 22:23:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 22:23:49,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130208333333334 [2024-06-27 22:23:49,008 INFO L175 Difference]: Start difference. First operand has 141 places, 278 transitions, 3560 flow. Second operand 8 states and 197 transitions. [2024-06-27 22:23:49,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 370 transitions, 5325 flow [2024-06-27 22:23:49,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 370 transitions, 5102 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:49,244 INFO L231 Difference]: Finished difference. Result has 146 places, 327 transitions, 4463 flow [2024-06-27 22:23:49,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3366, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4463, PETRI_PLACES=146, PETRI_TRANSITIONS=327} [2024-06-27 22:23:49,244 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 92 predicate places. [2024-06-27 22:23:49,244 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 327 transitions, 4463 flow [2024-06-27 22:23:49,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:49,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:49,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:49,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:23:49,245 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:23:49,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 800556511, now seen corresponding path program 2 times [2024-06-27 22:23:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:49,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718702105] [2024-06-27 22:23:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:50,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:50,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:50,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718702105] [2024-06-27 22:23:50,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718702105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:50,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:50,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:50,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475223551] [2024-06-27 22:23:50,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:50,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:50,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:50,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:50,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 327 transitions, 4463 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:50,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:50,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:51,871 INFO L124 PetriNetUnfolderBase]: 5771/9165 cut-off events. [2024-06-27 22:23:51,871 INFO L125 PetriNetUnfolderBase]: For 149345/149436 co-relation queries the response was YES. [2024-06-27 22:23:51,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55781 conditions, 9165 events. 5771/9165 cut-off events. For 149345/149436 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 56909 event pairs, 1745 based on Foata normal form. 73/9019 useless extension candidates. Maximal degree in co-relation 55717. Up to 7752 conditions per place. [2024-06-27 22:23:51,951 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 205 selfloop transitions, 150 changer transitions 0/366 dead transitions. [2024-06-27 22:23:51,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 366 transitions, 5532 flow [2024-06-27 22:23:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:23:51,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-27 22:23:51,952 INFO L175 Difference]: Start difference. First operand has 146 places, 327 transitions, 4463 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:23:51,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 366 transitions, 5532 flow [2024-06-27 22:23:52,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 366 transitions, 5276 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:52,178 INFO L231 Difference]: Finished difference. Result has 150 places, 335 transitions, 4716 flow [2024-06-27 22:23:52,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4207, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4716, PETRI_PLACES=150, PETRI_TRANSITIONS=335} [2024-06-27 22:23:52,178 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 96 predicate places. [2024-06-27 22:23:52,178 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 335 transitions, 4716 flow [2024-06-27 22:23:52,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:52,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:52,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:52,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:23:52,179 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:52,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash 589401399, now seen corresponding path program 2 times [2024-06-27 22:23:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:52,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004824838] [2024-06-27 22:23:52,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:53,400 INFO 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:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004824838] [2024-06-27 22:23:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004824838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736208185] [2024-06-27 22:23:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:53,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:53,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:53,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:53,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:23:53,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 335 transitions, 4716 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:53,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:53,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:23:53,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:54,954 INFO L124 PetriNetUnfolderBase]: 6304/9766 cut-off events. [2024-06-27 22:23:54,954 INFO L125 PetriNetUnfolderBase]: For 167709/167725 co-relation queries the response was YES. [2024-06-27 22:23:55,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60482 conditions, 9766 events. 6304/9766 cut-off events. For 167709/167725 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 57954 event pairs, 1847 based on Foata normal form. 18/9567 useless extension candidates. Maximal degree in co-relation 60417. Up to 8743 conditions per place. [2024-06-27 22:23:55,046 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 316 selfloop transitions, 56 changer transitions 0/380 dead transitions. [2024-06-27 22:23:55,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 380 transitions, 5738 flow [2024-06-27 22:23:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:23:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:23:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2024-06-27 22:23:55,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765625 [2024-06-27 22:23:55,047 INFO L175 Difference]: Start difference. First operand has 150 places, 335 transitions, 4716 flow. Second operand 8 states and 183 transitions. [2024-06-27 22:23:55,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 380 transitions, 5738 flow [2024-06-27 22:23:55,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 380 transitions, 5356 flow, removed 54 selfloop flow, removed 6 redundant places. [2024-06-27 22:23:55,312 INFO L231 Difference]: Finished difference. Result has 153 places, 344 transitions, 4587 flow [2024-06-27 22:23:55,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4334, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4587, PETRI_PLACES=153, PETRI_TRANSITIONS=344} [2024-06-27 22:23:55,312 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 99 predicate places. [2024-06-27 22:23:55,313 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 344 transitions, 4587 flow [2024-06-27 22:23:55,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:55,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:55,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:55,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:23:55,313 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:23:55,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 589394455, now seen corresponding path program 3 times [2024-06-27 22:23:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016365488] [2024-06-27 22:23:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:56,573 INFO 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:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:56,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016365488] [2024-06-27 22:23:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016365488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:56,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665567489] [2024-06-27 22:23:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:56,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:56,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:23:56,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 344 transitions, 4587 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:56,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:56,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:23:56,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:58,071 INFO L124 PetriNetUnfolderBase]: 5854/9272 cut-off events. [2024-06-27 22:23:58,071 INFO L125 PetriNetUnfolderBase]: For 174788/174883 co-relation queries the response was YES. [2024-06-27 22:23:58,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58856 conditions, 9272 events. 5854/9272 cut-off events. For 174788/174883 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 57310 event pairs, 1697 based on Foata normal form. 26/9079 useless extension candidates. Maximal degree in co-relation 58789. Up to 7635 conditions per place. [2024-06-27 22:23:58,170 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 167 selfloop transitions, 206 changer transitions 0/385 dead transitions. [2024-06-27 22:23:58,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 385 transitions, 5810 flow [2024-06-27 22:23:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-27 22:23:58,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2024-06-27 22:23:58,171 INFO L175 Difference]: Start difference. First operand has 153 places, 344 transitions, 4587 flow. Second operand 7 states and 178 transitions. [2024-06-27 22:23:58,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 385 transitions, 5810 flow [2024-06-27 22:23:58,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 385 transitions, 5651 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-27 22:23:58,444 INFO L231 Difference]: Finished difference. Result has 156 places, 354 transitions, 5252 flow [2024-06-27 22:23:58,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4428, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5252, PETRI_PLACES=156, PETRI_TRANSITIONS=354} [2024-06-27 22:23:58,444 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 102 predicate places. [2024-06-27 22:23:58,444 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 354 transitions, 5252 flow [2024-06-27 22:23:58,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:58,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:58,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:23:58,445 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:23:58,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 597675609, now seen corresponding path program 3 times [2024-06-27 22:23:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217734247] [2024-06-27 22:23:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:59,644 INFO 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:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217734247] [2024-06-27 22:23:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217734247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:59,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:59,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908663486] [2024-06-27 22:23:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:59,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:59,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:59,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:23:59,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 354 transitions, 5252 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:59,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:59,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:23:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:01,386 INFO L124 PetriNetUnfolderBase]: 6324/9793 cut-off events. [2024-06-27 22:24:01,386 INFO L125 PetriNetUnfolderBase]: For 201663/201679 co-relation queries the response was YES. [2024-06-27 22:24:01,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64925 conditions, 9793 events. 6324/9793 cut-off events. For 201663/201679 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 58148 event pairs, 1849 based on Foata normal form. 18/9594 useless extension candidates. Maximal degree in co-relation 64856. Up to 8771 conditions per place. [2024-06-27 22:24:01,471 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 327 selfloop transitions, 66 changer transitions 0/401 dead transitions. [2024-06-27 22:24:01,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 401 transitions, 6378 flow [2024-06-27 22:24:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:24:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:24:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-06-27 22:24:01,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713541666666667 [2024-06-27 22:24:01,472 INFO L175 Difference]: Start difference. First operand has 156 places, 354 transitions, 5252 flow. Second operand 8 states and 181 transitions. [2024-06-27 22:24:01,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 401 transitions, 6378 flow [2024-06-27 22:24:01,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 401 transitions, 6194 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-06-27 22:24:01,747 INFO L231 Difference]: Finished difference. Result has 162 places, 369 transitions, 5469 flow [2024-06-27 22:24:01,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5071, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5469, PETRI_PLACES=162, PETRI_TRANSITIONS=369} [2024-06-27 22:24:01,747 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 108 predicate places. [2024-06-27 22:24:01,747 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 369 transitions, 5469 flow [2024-06-27 22:24:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:01,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:01,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:24:01,748 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:24:01,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash 597972279, now seen corresponding path program 4 times [2024-06-27 22:24:01,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:01,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381148412] [2024-06-27 22:24:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:02,975 INFO 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:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381148412] [2024-06-27 22:24:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381148412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:24:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331368163] [2024-06-27 22:24:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:02,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:24:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:24:02,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:24:03,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:03,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 369 transitions, 5469 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:03,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:03,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:03,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:04,838 INFO L124 PetriNetUnfolderBase]: 6319/9763 cut-off events. [2024-06-27 22:24:04,838 INFO L125 PetriNetUnfolderBase]: For 218045/218061 co-relation queries the response was YES. [2024-06-27 22:24:04,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66674 conditions, 9763 events. 6319/9763 cut-off events. For 218045/218061 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 57746 event pairs, 1850 based on Foata normal form. 18/9579 useless extension candidates. Maximal degree in co-relation 66602. Up to 8688 conditions per place. [2024-06-27 22:24:04,936 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 330 selfloop transitions, 85 changer transitions 0/423 dead transitions. [2024-06-27 22:24:04,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 423 transitions, 6810 flow [2024-06-27 22:24:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:24:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:24:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 22:24:04,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 22:24:04,937 INFO L175 Difference]: Start difference. First operand has 162 places, 369 transitions, 5469 flow. Second operand 8 states and 184 transitions. [2024-06-27 22:24:04,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 423 transitions, 6810 flow [2024-06-27 22:24:05,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 423 transitions, 6646 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-27 22:24:05,287 INFO L231 Difference]: Finished difference. Result has 168 places, 389 transitions, 5849 flow [2024-06-27 22:24:05,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5305, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5849, PETRI_PLACES=168, PETRI_TRANSITIONS=389} [2024-06-27 22:24:05,288 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 114 predicate places. [2024-06-27 22:24:05,288 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 389 transitions, 5849 flow [2024-06-27 22:24:05,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:05,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:05,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:05,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:24:05,288 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:24:05,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1851936075, now seen corresponding path program 4 times [2024-06-27 22:24:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:05,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853792863] [2024-06-27 22:24:05,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:24:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853792863] [2024-06-27 22:24:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853792863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:06,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:06,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:24:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499675099] [2024-06-27 22:24:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:06,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:24:06,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:06,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:24:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:24:06,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:06,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 389 transitions, 5849 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:06,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:06,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:08,139 INFO L124 PetriNetUnfolderBase]: 6057/9546 cut-off events. [2024-06-27 22:24:08,140 INFO L125 PetriNetUnfolderBase]: For 234579/234587 co-relation queries the response was YES. [2024-06-27 22:24:08,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67600 conditions, 9546 events. 6057/9546 cut-off events. For 234579/234587 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 58666 event pairs, 1678 based on Foata normal form. 12/9351 useless extension candidates. Maximal degree in co-relation 67526. Up to 8217 conditions per place. [2024-06-27 22:24:08,240 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 330 selfloop transitions, 119 changer transitions 0/464 dead transitions. [2024-06-27 22:24:08,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 464 transitions, 7671 flow [2024-06-27 22:24:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:24:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:24:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:24:08,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2024-06-27 22:24:08,241 INFO L175 Difference]: Start difference. First operand has 168 places, 389 transitions, 5849 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:24:08,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 464 transitions, 7671 flow [2024-06-27 22:24:08,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 464 transitions, 7457 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-27 22:24:08,643 INFO L231 Difference]: Finished difference. Result has 172 places, 421 transitions, 6566 flow [2024-06-27 22:24:08,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5635, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6566, PETRI_PLACES=172, PETRI_TRANSITIONS=421} [2024-06-27 22:24:08,644 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 118 predicate places. [2024-06-27 22:24:08,644 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 421 transitions, 6566 flow [2024-06-27 22:24:08,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:08,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:08,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:08,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:24:08,645 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:24:08,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1858997703, now seen corresponding path program 5 times [2024-06-27 22:24:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:08,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215650843] [2024-06-27 22:24:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:09,409 INFO 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:09,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:09,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215650843] [2024-06-27 22:24:09,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215650843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:09,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:09,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:24:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013140649] [2024-06-27 22:24:09,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:09,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:24:09,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:24:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:24:09,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:24:09,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 421 transitions, 6566 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:09,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:09,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:24:09,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:11,139 INFO L124 PetriNetUnfolderBase]: 5896/9440 cut-off events. [2024-06-27 22:24:11,139 INFO L125 PetriNetUnfolderBase]: For 238017/238121 co-relation queries the response was YES. [2024-06-27 22:24:11,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67002 conditions, 9440 events. 5896/9440 cut-off events. For 238017/238121 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 59410 event pairs, 1662 based on Foata normal form. 96/9324 useless extension candidates. Maximal degree in co-relation 66926. Up to 7751 conditions per place. [2024-06-27 22:24:11,237 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 291 selfloop transitions, 189 changer transitions 0/526 dead transitions. [2024-06-27 22:24:11,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 526 transitions, 9154 flow [2024-06-27 22:24:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:24:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:24:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-27 22:24:11,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-27 22:24:11,238 INFO L175 Difference]: Start difference. First operand has 172 places, 421 transitions, 6566 flow. Second operand 7 states and 176 transitions. [2024-06-27 22:24:11,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 526 transitions, 9154 flow [2024-06-27 22:24:11,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 526 transitions, 8838 flow, removed 75 selfloop flow, removed 4 redundant places. [2024-06-27 22:24:11,699 INFO L231 Difference]: Finished difference. Result has 177 places, 491 transitions, 8356 flow [2024-06-27 22:24:11,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6346, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8356, PETRI_PLACES=177, PETRI_TRANSITIONS=491} [2024-06-27 22:24:11,699 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 123 predicate places. [2024-06-27 22:24:11,699 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 491 transitions, 8356 flow [2024-06-27 22:24:11,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:11,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:11,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:11,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:24:11,700 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:24:11,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1580068293, now seen corresponding path program 6 times [2024-06-27 22:24:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59685779] [2024-06-27 22:24:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:12,623 INFO 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:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59685779] [2024-06-27 22:24:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59685779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:12,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:12,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:24:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659749422] [2024-06-27 22:24:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:12,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:24:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:12,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:24:12,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:24:12,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:12,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 491 transitions, 8356 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:12,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:12,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:12,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:14,569 INFO L124 PetriNetUnfolderBase]: 6367/10013 cut-off events. [2024-06-27 22:24:14,569 INFO L125 PetriNetUnfolderBase]: For 267324/267350 co-relation queries the response was YES. [2024-06-27 22:24:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74880 conditions, 10013 events. 6367/10013 cut-off events. For 267324/267350 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 61607 event pairs, 1670 based on Foata normal form. 14/9820 useless extension candidates. Maximal degree in co-relation 74801. Up to 8545 conditions per place. [2024-06-27 22:24:14,685 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 395 selfloop transitions, 224 changer transitions 0/634 dead transitions. [2024-06-27 22:24:14,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 634 transitions, 11963 flow [2024-06-27 22:24:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:24:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:24:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 22:24:14,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:24:14,686 INFO L175 Difference]: Start difference. First operand has 177 places, 491 transitions, 8356 flow. Second operand 9 states and 222 transitions. [2024-06-27 22:24:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 634 transitions, 11963 flow [2024-06-27 22:24:15,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 634 transitions, 11588 flow, removed 84 selfloop flow, removed 3 redundant places. [2024-06-27 22:24:15,354 INFO L231 Difference]: Finished difference. Result has 183 places, 583 transitions, 10682 flow [2024-06-27 22:24:15,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8114, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10682, PETRI_PLACES=183, PETRI_TRANSITIONS=583} [2024-06-27 22:24:15,355 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 129 predicate places. [2024-06-27 22:24:15,355 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 583 transitions, 10682 flow [2024-06-27 22:24:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:15,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:15,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:15,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:24:15,356 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:24:15,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1537264217, now seen corresponding path program 5 times [2024-06-27 22:24:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283363015] [2024-06-27 22:24:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:16,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:24:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283363015] [2024-06-27 22:24:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283363015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:24:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996118058] [2024-06-27 22:24:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:16,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:24:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:24:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:24:16,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:16,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 583 transitions, 10682 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:16,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:16,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:18,652 INFO L124 PetriNetUnfolderBase]: 6949/10637 cut-off events. [2024-06-27 22:24:18,652 INFO L125 PetriNetUnfolderBase]: For 285669/285677 co-relation queries the response was YES. [2024-06-27 22:24:18,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79908 conditions, 10637 events. 6949/10637 cut-off events. For 285669/285677 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 62684 event pairs, 1968 based on Foata normal form. 10/10442 useless extension candidates. Maximal degree in co-relation 79828. Up to 9699 conditions per place. [2024-06-27 22:24:18,780 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 571 selfloop transitions, 53 changer transitions 0/632 dead transitions. [2024-06-27 22:24:18,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 632 transitions, 12247 flow [2024-06-27 22:24:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:24:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:24:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2024-06-27 22:24:18,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2024-06-27 22:24:18,781 INFO L175 Difference]: Start difference. First operand has 183 places, 583 transitions, 10682 flow. Second operand 9 states and 202 transitions. [2024-06-27 22:24:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 632 transitions, 12247 flow [2024-06-27 22:24:19,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 632 transitions, 11755 flow, removed 73 selfloop flow, removed 6 redundant places. [2024-06-27 22:24:19,531 INFO L231 Difference]: Finished difference. Result has 187 places, 592 transitions, 10496 flow [2024-06-27 22:24:19,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10204, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10496, PETRI_PLACES=187, PETRI_TRANSITIONS=592} [2024-06-27 22:24:19,532 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 133 predicate places. [2024-06-27 22:24:19,532 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 592 transitions, 10496 flow [2024-06-27 22:24:19,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:19,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:19,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:19,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:24:19,533 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:19,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash 758360505, now seen corresponding path program 1 times [2024-06-27 22:24:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247068229] [2024-06-27 22:24:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:20,504 INFO 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:20,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247068229] [2024-06-27 22:24:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247068229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:24:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744699566] [2024-06-27 22:24:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:20,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:24:20,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:20,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:24:20,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:24:20,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:20,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 592 transitions, 10496 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:20,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:20,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:22,572 INFO L124 PetriNetUnfolderBase]: 6946/10799 cut-off events. [2024-06-27 22:24:22,572 INFO L125 PetriNetUnfolderBase]: For 280558/280558 co-relation queries the response was YES. [2024-06-27 22:24:22,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79539 conditions, 10799 events. 6946/10799 cut-off events. For 280558/280558 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 65102 event pairs, 2083 based on Foata normal form. 1/10543 useless extension candidates. Maximal degree in co-relation 79457. Up to 9764 conditions per place. [2024-06-27 22:24:22,704 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 589 selfloop transitions, 19 changer transitions 0/616 dead transitions. [2024-06-27 22:24:22,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 616 transitions, 11928 flow [2024-06-27 22:24:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:24:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:24:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-27 22:24:22,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-06-27 22:24:22,705 INFO L175 Difference]: Start difference. First operand has 187 places, 592 transitions, 10496 flow. Second operand 6 states and 134 transitions. [2024-06-27 22:24:22,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 616 transitions, 11928 flow [2024-06-27 22:24:23,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 616 transitions, 11764 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-27 22:24:23,444 INFO L231 Difference]: Finished difference. Result has 187 places, 595 transitions, 10410 flow [2024-06-27 22:24:23,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10332, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10410, PETRI_PLACES=187, PETRI_TRANSITIONS=595} [2024-06-27 22:24:23,445 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 133 predicate places. [2024-06-27 22:24:23,445 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 595 transitions, 10410 flow [2024-06-27 22:24:23,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:23,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:23,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:23,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:24:23,446 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:24:23,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 50068049, now seen corresponding path program 1 times [2024-06-27 22:24:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:23,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885364460] [2024-06-27 22:24:23,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:23,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:24,546 INFO 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:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885364460] [2024-06-27 22:24:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885364460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:24,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010408957] [2024-06-27 22:24:24,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:24,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:24,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:24,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:24,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:24,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:24,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 595 transitions, 10410 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:24,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:24,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:24,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:26,822 INFO L124 PetriNetUnfolderBase]: 6753/10649 cut-off events. [2024-06-27 22:24:26,822 INFO L125 PetriNetUnfolderBase]: For 319166/319184 co-relation queries the response was YES. [2024-06-27 22:24:26,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80423 conditions, 10649 events. 6753/10649 cut-off events. For 319166/319184 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 66898 event pairs, 1647 based on Foata normal form. 8/10378 useless extension candidates. Maximal degree in co-relation 80339. Up to 9106 conditions per place. [2024-06-27 22:24:26,957 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 503 selfloop transitions, 139 changer transitions 0/659 dead transitions. [2024-06-27 22:24:26,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 659 transitions, 12443 flow [2024-06-27 22:24:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:24:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:24:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 22:24:26,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-06-27 22:24:26,958 INFO L175 Difference]: Start difference. First operand has 187 places, 595 transitions, 10410 flow. Second operand 9 states and 213 transitions. [2024-06-27 22:24:26,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 659 transitions, 12443 flow [2024-06-27 22:24:27,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 659 transitions, 12399 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 22:24:27,675 INFO L231 Difference]: Finished difference. Result has 194 places, 620 transitions, 11282 flow [2024-06-27 22:24:27,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10366, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11282, PETRI_PLACES=194, PETRI_TRANSITIONS=620} [2024-06-27 22:24:27,676 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 140 predicate places. [2024-06-27 22:24:27,676 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 620 transitions, 11282 flow [2024-06-27 22:24:27,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:27,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:27,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:27,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:24:27,677 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:24:27,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash 52810619, now seen corresponding path program 2 times [2024-06-27 22:24:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:27,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806544486] [2024-06-27 22:24:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:28,908 INFO 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:28,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806544486] [2024-06-27 22:24:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806544486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:28,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432193390] [2024-06-27 22:24:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:28,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:29,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:29,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 620 transitions, 11282 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:29,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:29,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:31,451 INFO L124 PetriNetUnfolderBase]: 6821/10795 cut-off events. [2024-06-27 22:24:31,451 INFO L125 PetriNetUnfolderBase]: For 348177/348195 co-relation queries the response was YES. [2024-06-27 22:24:31,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83546 conditions, 10795 events. 6821/10795 cut-off events. For 348177/348195 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 68150 event pairs, 1654 based on Foata normal form. 12/10522 useless extension candidates. Maximal degree in co-relation 83459. Up to 8972 conditions per place. [2024-06-27 22:24:31,558 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 396 selfloop transitions, 248 changer transitions 0/661 dead transitions. [2024-06-27 22:24:31,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 661 transitions, 12890 flow [2024-06-27 22:24:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:24:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:24:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2024-06-27 22:24:31,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48842592592592593 [2024-06-27 22:24:31,559 INFO L175 Difference]: Start difference. First operand has 194 places, 620 transitions, 11282 flow. Second operand 9 states and 211 transitions. [2024-06-27 22:24:31,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 661 transitions, 12890 flow [2024-06-27 22:24:32,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 661 transitions, 12629 flow, removed 100 selfloop flow, removed 3 redundant places. [2024-06-27 22:24:32,315 INFO L231 Difference]: Finished difference. Result has 200 places, 624 transitions, 11688 flow [2024-06-27 22:24:32,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11023, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11688, PETRI_PLACES=200, PETRI_TRANSITIONS=624} [2024-06-27 22:24:32,315 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 146 predicate places. [2024-06-27 22:24:32,316 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 624 transitions, 11688 flow [2024-06-27 22:24:32,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:32,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:32,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:32,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:24:32,316 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:24:32,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 169139669, now seen corresponding path program 3 times [2024-06-27 22:24:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805292846] [2024-06-27 22:24:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:33,598 INFO 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:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805292846] [2024-06-27 22:24:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805292846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954118947] [2024-06-27 22:24:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:33,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:33,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:33,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:33,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 624 transitions, 11688 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:33,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:33,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:33,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:36,032 INFO L124 PetriNetUnfolderBase]: 6904/10883 cut-off events. [2024-06-27 22:24:36,032 INFO L125 PetriNetUnfolderBase]: For 372951/372969 co-relation queries the response was YES. [2024-06-27 22:24:36,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86328 conditions, 10883 events. 6904/10883 cut-off events. For 372951/372969 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 68528 event pairs, 1722 based on Foata normal form. 12/10603 useless extension candidates. Maximal degree in co-relation 86239. Up to 9069 conditions per place. [2024-06-27 22:24:36,176 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 350 selfloop transitions, 298 changer transitions 0/665 dead transitions. [2024-06-27 22:24:36,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 665 transitions, 13314 flow [2024-06-27 22:24:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:24:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:24:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 22:24:36,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-06-27 22:24:36,177 INFO L175 Difference]: Start difference. First operand has 200 places, 624 transitions, 11688 flow. Second operand 9 states and 213 transitions. [2024-06-27 22:24:36,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 665 transitions, 13314 flow [2024-06-27 22:24:37,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 665 transitions, 12784 flow, removed 60 selfloop flow, removed 6 redundant places. [2024-06-27 22:24:37,116 INFO L231 Difference]: Finished difference. Result has 203 places, 628 transitions, 11911 flow [2024-06-27 22:24:37,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11158, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11911, PETRI_PLACES=203, PETRI_TRANSITIONS=628} [2024-06-27 22:24:37,117 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 149 predicate places. [2024-06-27 22:24:37,117 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 628 transitions, 11911 flow [2024-06-27 22:24:37,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:37,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:37,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:37,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:24:37,118 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:37,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash 169355150, now seen corresponding path program 1 times [2024-06-27 22:24:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778996627] [2024-06-27 22:24:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:38,388 INFO 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:38,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778996627] [2024-06-27 22:24:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778996627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:38,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938236524] [2024-06-27 22:24:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:38,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:38,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 628 transitions, 11911 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:38,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:38,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:38,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:41,000 INFO L124 PetriNetUnfolderBase]: 7742/11882 cut-off events. [2024-06-27 22:24:41,000 INFO L125 PetriNetUnfolderBase]: For 422523/422527 co-relation queries the response was YES. [2024-06-27 22:24:41,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94577 conditions, 11882 events. 7742/11882 cut-off events. For 422523/422527 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 71892 event pairs, 1818 based on Foata normal form. 28/11623 useless extension candidates. Maximal degree in co-relation 94487. Up to 9983 conditions per place. [2024-06-27 22:24:41,145 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 388 selfloop transitions, 287 changer transitions 0/684 dead transitions. [2024-06-27 22:24:41,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 684 transitions, 13782 flow [2024-06-27 22:24:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:24:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:24:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2024-06-27 22:24:41,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-06-27 22:24:41,147 INFO L175 Difference]: Start difference. First operand has 203 places, 628 transitions, 11911 flow. Second operand 10 states and 234 transitions. [2024-06-27 22:24:41,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 684 transitions, 13782 flow [2024-06-27 22:24:42,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 684 transitions, 13061 flow, removed 64 selfloop flow, removed 7 redundant places. [2024-06-27 22:24:42,278 INFO L231 Difference]: Finished difference. Result has 206 places, 631 transitions, 11886 flow [2024-06-27 22:24:42,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11194, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11886, PETRI_PLACES=206, PETRI_TRANSITIONS=631} [2024-06-27 22:24:42,279 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 152 predicate places. [2024-06-27 22:24:42,279 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 631 transitions, 11886 flow [2024-06-27 22:24:42,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:42,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:42,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:42,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:24:42,279 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:24:42,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash 169354871, now seen corresponding path program 1 times [2024-06-27 22:24:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:42,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28625841] [2024-06-27 22:24:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:43,571 INFO 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:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28625841] [2024-06-27 22:24:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28625841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:43,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:43,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330381314] [2024-06-27 22:24:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:43,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:43,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 631 transitions, 11886 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:43,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:43,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:43,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:46,292 INFO L124 PetriNetUnfolderBase]: 7806/11975 cut-off events. [2024-06-27 22:24:46,292 INFO L125 PetriNetUnfolderBase]: For 422989/422993 co-relation queries the response was YES. [2024-06-27 22:24:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96074 conditions, 11975 events. 7806/11975 cut-off events. For 422989/422993 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 72498 event pairs, 1848 based on Foata normal form. 9/11697 useless extension candidates. Maximal degree in co-relation 95983. Up to 10269 conditions per place. [2024-06-27 22:24:46,419 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 389 selfloop transitions, 295 changer transitions 0/693 dead transitions. [2024-06-27 22:24:46,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 693 transitions, 13880 flow [2024-06-27 22:24:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:24:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:24:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-06-27 22:24:46,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-27 22:24:46,421 INFO L175 Difference]: Start difference. First operand has 206 places, 631 transitions, 11886 flow. Second operand 10 states and 231 transitions. [2024-06-27 22:24:46,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 693 transitions, 13880 flow [2024-06-27 22:24:47,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 693 transitions, 13282 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-27 22:24:47,401 INFO L231 Difference]: Finished difference. Result has 208 places, 642 transitions, 12139 flow [2024-06-27 22:24:47,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11288, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12139, PETRI_PLACES=208, PETRI_TRANSITIONS=642} [2024-06-27 22:24:47,402 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 154 predicate places. [2024-06-27 22:24:47,402 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 642 transitions, 12139 flow [2024-06-27 22:24:47,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:47,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:47,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:47,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:24:47,402 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:47,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:47,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2021945643, now seen corresponding path program 1 times [2024-06-27 22:24:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649110474] [2024-06-27 22:24:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:48,350 INFO 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:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649110474] [2024-06-27 22:24:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649110474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:24:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531406654] [2024-06-27 22:24:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:48,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:24:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:24:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:24:48,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:48,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 642 transitions, 12139 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:48,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:50,858 INFO L124 PetriNetUnfolderBase]: 7923/12191 cut-off events. [2024-06-27 22:24:50,858 INFO L125 PetriNetUnfolderBase]: For 431358/431366 co-relation queries the response was YES. [2024-06-27 22:24:50,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98408 conditions, 12191 events. 7923/12191 cut-off events. For 431358/431366 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 73920 event pairs, 1958 based on Foata normal form. 9/11892 useless extension candidates. Maximal degree in co-relation 98316. Up to 11031 conditions per place. [2024-06-27 22:24:51,004 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 629 selfloop transitions, 44 changer transitions 0/682 dead transitions. [2024-06-27 22:24:51,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 682 transitions, 14075 flow [2024-06-27 22:24:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:24:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:24:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-06-27 22:24:51,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:24:51,005 INFO L175 Difference]: Start difference. First operand has 208 places, 642 transitions, 12139 flow. Second operand 6 states and 144 transitions. [2024-06-27 22:24:51,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 682 transitions, 14075 flow [2024-06-27 22:24:52,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 682 transitions, 13486 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-27 22:24:52,109 INFO L231 Difference]: Finished difference. Result has 208 places, 654 transitions, 11824 flow [2024-06-27 22:24:52,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11550, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11824, PETRI_PLACES=208, PETRI_TRANSITIONS=654} [2024-06-27 22:24:52,110 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 154 predicate places. [2024-06-27 22:24:52,110 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 654 transitions, 11824 flow [2024-06-27 22:24:52,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:52,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:52,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:52,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:24:52,110 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:24:52,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1091359667, now seen corresponding path program 4 times [2024-06-27 22:24:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235992429] [2024-06-27 22:24:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:53,638 INFO 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:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235992429] [2024-06-27 22:24:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235992429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227612143] [2024-06-27 22:24:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:53,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:53,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:24:53,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 654 transitions, 11824 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:53,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:53,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:24:53,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:56,357 INFO L124 PetriNetUnfolderBase]: 7222/11391 cut-off events. [2024-06-27 22:24:56,357 INFO L125 PetriNetUnfolderBase]: For 445704/445728 co-relation queries the response was YES. [2024-06-27 22:24:56,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93838 conditions, 11391 events. 7222/11391 cut-off events. For 445704/445728 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 72171 event pairs, 1708 based on Foata normal form. 14/11116 useless extension candidates. Maximal degree in co-relation 93743. Up to 9264 conditions per place. [2024-06-27 22:24:56,495 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 258 selfloop transitions, 418 changer transitions 0/693 dead transitions. [2024-06-27 22:24:56,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 693 transitions, 13508 flow [2024-06-27 22:24:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:24:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:24:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:24:56,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2024-06-27 22:24:56,497 INFO L175 Difference]: Start difference. First operand has 208 places, 654 transitions, 11824 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:24:56,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 693 transitions, 13508 flow [2024-06-27 22:24:57,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 693 transitions, 13412 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 22:24:57,641 INFO L231 Difference]: Finished difference. Result has 214 places, 658 transitions, 12735 flow [2024-06-27 22:24:57,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11728, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=414, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12735, PETRI_PLACES=214, PETRI_TRANSITIONS=658} [2024-06-27 22:24:57,641 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 160 predicate places. [2024-06-27 22:24:57,641 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 658 transitions, 12735 flow [2024-06-27 22:24:57,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:57,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:57,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:24:57,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:24:57,642 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:24:57,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1091365619, now seen corresponding path program 2 times [2024-06-27 22:24:57,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:57,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470375603] [2024-06-27 22:24:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:59,078 INFO 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:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470375603] [2024-06-27 22:24:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470375603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:59,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92938481] [2024-06-27 22:24:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:59,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:59,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:59,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:59,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:24:59,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 658 transitions, 12735 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:59,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:24:59,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:02,026 INFO L124 PetriNetUnfolderBase]: 8020/12274 cut-off events. [2024-06-27 22:25:02,026 INFO L125 PetriNetUnfolderBase]: For 493874/493884 co-relation queries the response was YES. [2024-06-27 22:25:02,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102826 conditions, 12274 events. 8020/12274 cut-off events. For 493874/493884 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 74178 event pairs, 1849 based on Foata normal form. 14/11998 useless extension candidates. Maximal degree in co-relation 102729. Up to 10307 conditions per place. [2024-06-27 22:25:02,306 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 337 selfloop transitions, 366 changer transitions 0/712 dead transitions. [2024-06-27 22:25:02,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 712 transitions, 14608 flow [2024-06-27 22:25:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:25:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:25:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-06-27 22:25:02,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023148148148148 [2024-06-27 22:25:02,308 INFO L175 Difference]: Start difference. First operand has 214 places, 658 transitions, 12735 flow. Second operand 9 states and 217 transitions. [2024-06-27 22:25:02,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 712 transitions, 14608 flow [2024-06-27 22:25:03,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 712 transitions, 13625 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-27 22:25:03,387 INFO L231 Difference]: Finished difference. Result has 218 places, 668 transitions, 12692 flow [2024-06-27 22:25:03,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11760, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12692, PETRI_PLACES=218, PETRI_TRANSITIONS=668} [2024-06-27 22:25:03,388 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 164 predicate places. [2024-06-27 22:25:03,388 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 668 transitions, 12692 flow [2024-06-27 22:25:03,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:03,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:03,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:03,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:25:03,389 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:25:03,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1091574869, now seen corresponding path program 3 times [2024-06-27 22:25:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607003415] [2024-06-27 22:25:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:04,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:25:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607003415] [2024-06-27 22:25:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607003415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:04,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:04,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471228991] [2024-06-27 22:25:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:04,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:04,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:04,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:25:04,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 668 transitions, 12692 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:04,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:04,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:25:04,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:07,873 INFO L124 PetriNetUnfolderBase]: 8141/12441 cut-off events. [2024-06-27 22:25:07,873 INFO L125 PetriNetUnfolderBase]: For 519591/519601 co-relation queries the response was YES. [2024-06-27 22:25:07,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106041 conditions, 12441 events. 8141/12441 cut-off events. For 519591/519601 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 75136 event pairs, 1851 based on Foata normal form. 14/12165 useless extension candidates. Maximal degree in co-relation 105942. Up to 10385 conditions per place. [2024-06-27 22:25:08,015 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 338 selfloop transitions, 388 changer transitions 0/735 dead transitions. [2024-06-27 22:25:08,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 735 transitions, 15040 flow [2024-06-27 22:25:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:25:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:25:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 22:25:08,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:25:08,017 INFO L175 Difference]: Start difference. First operand has 218 places, 668 transitions, 12692 flow. Second operand 9 states and 222 transitions. [2024-06-27 22:25:08,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 735 transitions, 15040 flow [2024-06-27 22:25:09,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 735 transitions, 14217 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 22:25:09,332 INFO L231 Difference]: Finished difference. Result has 223 places, 686 transitions, 13092 flow [2024-06-27 22:25:09,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11887, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13092, PETRI_PLACES=223, PETRI_TRANSITIONS=686} [2024-06-27 22:25:09,333 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 169 predicate places. [2024-06-27 22:25:09,333 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 686 transitions, 13092 flow [2024-06-27 22:25:09,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:09,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:09,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:09,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:25:09,334 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:25:09,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1091575148, now seen corresponding path program 2 times [2024-06-27 22:25:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:09,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310214258] [2024-06-27 22:25:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:09,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:10,915 INFO 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:25:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310214258] [2024-06-27 22:25:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310214258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:10,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289812436] [2024-06-27 22:25:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:10,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:10,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:11,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:25:11,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 686 transitions, 13092 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:11,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:11,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:25:11,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:14,141 INFO L124 PetriNetUnfolderBase]: 8210/12542 cut-off events. [2024-06-27 22:25:14,141 INFO L125 PetriNetUnfolderBase]: For 562041/562051 co-relation queries the response was YES. [2024-06-27 22:25:14,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109678 conditions, 12542 events. 8210/12542 cut-off events. For 562041/562051 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 75729 event pairs, 1863 based on Foata normal form. 20/12272 useless extension candidates. Maximal degree in co-relation 109576. Up to 10492 conditions per place. [2024-06-27 22:25:14,370 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 348 selfloop transitions, 386 changer transitions 0/743 dead transitions. [2024-06-27 22:25:14,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 743 transitions, 15228 flow [2024-06-27 22:25:14,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:25:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:25:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2024-06-27 22:25:14,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115740740740741 [2024-06-27 22:25:14,373 INFO L175 Difference]: Start difference. First operand has 223 places, 686 transitions, 13092 flow. Second operand 9 states and 221 transitions. [2024-06-27 22:25:14,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 743 transitions, 15228 flow [2024-06-27 22:25:15,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 743 transitions, 14726 flow, removed 62 selfloop flow, removed 3 redundant places. [2024-06-27 22:25:15,680 INFO L231 Difference]: Finished difference. Result has 230 places, 700 transitions, 13862 flow [2024-06-27 22:25:15,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12606, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13862, PETRI_PLACES=230, PETRI_TRANSITIONS=700} [2024-06-27 22:25:15,681 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 176 predicate places. [2024-06-27 22:25:15,681 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 700 transitions, 13862 flow [2024-06-27 22:25:15,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:15,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:15,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:25:15,682 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:25:15,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1348067939, now seen corresponding path program 4 times [2024-06-27 22:25:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:15,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632452772] [2024-06-27 22:25:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:25:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:17,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632452772] [2024-06-27 22:25:17,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632452772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:17,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:17,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591358523] [2024-06-27 22:25:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:17,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:17,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:17,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:17,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:17,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:25:17,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 700 transitions, 13862 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:17,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:17,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:25:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:20,104 INFO L124 PetriNetUnfolderBase]: 8255/12604 cut-off events. [2024-06-27 22:25:20,104 INFO L125 PetriNetUnfolderBase]: For 603157/603167 co-relation queries the response was YES. [2024-06-27 22:25:20,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113572 conditions, 12604 events. 8255/12604 cut-off events. For 603157/603167 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 76077 event pairs, 1868 based on Foata normal form. 14/12328 useless extension candidates. Maximal degree in co-relation 113467. Up to 10615 conditions per place. [2024-06-27 22:25:20,438 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 361 selfloop transitions, 433 changer transitions 0/803 dead transitions. [2024-06-27 22:25:20,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 803 transitions, 17130 flow [2024-06-27 22:25:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:25:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:25:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-27 22:25:20,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2024-06-27 22:25:20,440 INFO L175 Difference]: Start difference. First operand has 230 places, 700 transitions, 13862 flow. Second operand 9 states and 218 transitions. [2024-06-27 22:25:20,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 803 transitions, 17130 flow [2024-06-27 22:25:21,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 803 transitions, 16297 flow, removed 183 selfloop flow, removed 5 redundant places. [2024-06-27 22:25:21,728 INFO L231 Difference]: Finished difference. Result has 236 places, 757 transitions, 15443 flow [2024-06-27 22:25:21,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13081, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=376, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15443, PETRI_PLACES=236, PETRI_TRANSITIONS=757} [2024-06-27 22:25:21,730 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 182 predicate places. [2024-06-27 22:25:21,730 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 757 transitions, 15443 flow [2024-06-27 22:25:21,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:21,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:21,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:21,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:25:21,731 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:25:21,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1357598858, now seen corresponding path program 3 times [2024-06-27 22:25:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435289703] [2024-06-27 22:25:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:23,132 INFO 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:25:23,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:23,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435289703] [2024-06-27 22:25:23,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435289703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:23,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:23,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844109684] [2024-06-27 22:25:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:23,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:25:23,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 757 transitions, 15443 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:23,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:23,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:25:23,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:26,590 INFO L124 PetriNetUnfolderBase]: 8540/13020 cut-off events. [2024-06-27 22:25:26,590 INFO L125 PetriNetUnfolderBase]: For 662259/662269 co-relation queries the response was YES. [2024-06-27 22:25:26,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122335 conditions, 13020 events. 8540/13020 cut-off events. For 662259/662269 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 78761 event pairs, 1686 based on Foata normal form. 14/12744 useless extension candidates. Maximal degree in co-relation 122226. Up to 9907 conditions per place. [2024-06-27 22:25:26,770 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 311 selfloop transitions, 510 changer transitions 0/830 dead transitions. [2024-06-27 22:25:26,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 830 transitions, 18464 flow [2024-06-27 22:25:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:25:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:25:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-27 22:25:26,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:25:26,773 INFO L175 Difference]: Start difference. First operand has 236 places, 757 transitions, 15443 flow. Second operand 9 states and 228 transitions. [2024-06-27 22:25:26,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 830 transitions, 18464 flow [2024-06-27 22:25:28,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 830 transitions, 17852 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-27 22:25:28,201 INFO L231 Difference]: Finished difference. Result has 243 places, 772 transitions, 16539 flow [2024-06-27 22:25:28,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=14831, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=498, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16539, PETRI_PLACES=243, PETRI_TRANSITIONS=772} [2024-06-27 22:25:28,202 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 189 predicate places. [2024-06-27 22:25:28,202 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 772 transitions, 16539 flow [2024-06-27 22:25:28,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:28,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:28,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:28,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:25:28,202 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:25:28,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1357272149, now seen corresponding path program 5 times [2024-06-27 22:25:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:28,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268202809] [2024-06-27 22:25:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:29,797 INFO 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:25:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268202809] [2024-06-27 22:25:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268202809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567596452] [2024-06-27 22:25:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:29,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:29,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:29,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:29,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:25:29,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 772 transitions, 16539 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:29,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:29,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:25:29,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:33,349 INFO L124 PetriNetUnfolderBase]: 8628/13147 cut-off events. [2024-06-27 22:25:33,349 INFO L125 PetriNetUnfolderBase]: For 702907/702917 co-relation queries the response was YES. [2024-06-27 22:25:33,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125279 conditions, 13147 events. 8628/13147 cut-off events. For 702907/702917 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 79732 event pairs, 1908 based on Foata normal form. 14/12871 useless extension candidates. Maximal degree in co-relation 125168. Up to 10614 conditions per place. [2024-06-27 22:25:33,542 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 315 selfloop transitions, 514 changer transitions 0/838 dead transitions. [2024-06-27 22:25:33,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 838 transitions, 19233 flow [2024-06-27 22:25:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:25:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:25:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2024-06-27 22:25:33,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48541666666666666 [2024-06-27 22:25:33,543 INFO L175 Difference]: Start difference. First operand has 243 places, 772 transitions, 16539 flow. Second operand 10 states and 233 transitions. [2024-06-27 22:25:33,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 838 transitions, 19233 flow [2024-06-27 22:25:35,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 838 transitions, 18764 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-06-27 22:25:35,414 INFO L231 Difference]: Finished difference. Result has 250 places, 787 transitions, 17704 flow [2024-06-27 22:25:35,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=16079, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=503, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17704, PETRI_PLACES=250, PETRI_TRANSITIONS=787} [2024-06-27 22:25:35,415 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 196 predicate places. [2024-06-27 22:25:35,415 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 787 transitions, 17704 flow [2024-06-27 22:25:35,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:35,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:35,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:35,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:25:35,416 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:25:35,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1357272428, now seen corresponding path program 4 times [2024-06-27 22:25:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:35,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934646088] [2024-06-27 22:25:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:36,786 INFO 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:25:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934646088] [2024-06-27 22:25:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934646088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126406990] [2024-06-27 22:25:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:36,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:36,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:25:36,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 787 transitions, 17704 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:25:36,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:36,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:25:36,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand