./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe009_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe009_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:15:42,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:15:43,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:15:43,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:15:43,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:15:43,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:15:43,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:15:43,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:15:43,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:15:43,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:15:43,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:15:43,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:15:43,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:15:43,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:15:43,090 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:15:43,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:15:43,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:15:43,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:15:43,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:15:43,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:15:43,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:15:43,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:15:43,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:15:43,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:15:43,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:15:43,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:15:43,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:15:43,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:15:43,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:15:43,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:15:43,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:15:43,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:15:43,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:15:43,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:15:43,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:15:43,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:15:43,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:15:43,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:15:43,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:15:43,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:15:43,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:15:43,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:15:43,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:15:43,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 00:15:43,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:15:43,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:15:43,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:15:43,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:15:43,353 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:15:43,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2024-06-28 00:15:44,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:15:44,818 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:15:44,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2024-06-28 00:15:44,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2f4c0f8/89162bb2b9214026abb5e36cd997ec90/FLAG65f83f761 [2024-06-28 00:15:44,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2f4c0f8/89162bb2b9214026abb5e36cd997ec90 [2024-06-28 00:15:44,851 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:15:44,851 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:15:44,852 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/safe009_power.opt.yml/witness.yml [2024-06-28 00:15:44,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:15:44,949 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:15:44,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:15:44,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:15:44,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:15:44,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:15:44" (1/2) ... [2024-06-28 00:15:44,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae1f260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:15:44, skipping insertion in model container [2024-06-28 00:15:44,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:15:44" (1/2) ... [2024-06-28 00:15:44,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@315d45e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:15:44, skipping insertion in model container [2024-06-28 00:15:44,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:15:44" (2/2) ... [2024-06-28 00:15:44,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae1f260 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:44, skipping insertion in model container [2024-06-28 00:15:44,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:15:44" (2/2) ... [2024-06-28 00:15:44,963 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:15:45,001 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:15:45,003 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$read_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x) - (long long )x$mem_tmp >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (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_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-28 00:15:45,003 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$read_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x) - (long long )x$mem_tmp >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (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_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-28 00:15:45,004 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$read_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x) - (long long )x$mem_tmp >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (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_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-28 00:15:45,004 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:15:45,004 INFO L106 edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1; [2024-06-28 00:15:45,055 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:15:45,455 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:15:45,480 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:15:45,804 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:15:45,848 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:15:45,848 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45 WrapperNode [2024-06-28 00:15:45,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:15:45,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:15:45,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:15:45,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:15:45,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:45,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:45,996 INFO L138 Inliner]: procedures = 175, calls = 261, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 784 [2024-06-28 00:15:45,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:15:45,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:15:45,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:15:45,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:15:46,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,087 INFO L175 MemorySlicer]: Split 221 memory accesses to 2 slices as follows [2, 219]. 99 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-06-28 00:15:46,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:15:46,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:15:46,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:15:46,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:15:46,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (1/1) ... [2024-06-28 00:15:46,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:15:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:15:46,262 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-28 00:15:46,327 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-28 00:15:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:15:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:15:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:15:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:15:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:15:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:15:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:15:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:15:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:15:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:15:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 00:15:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 00:15:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:15:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:15:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:15:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:15:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:15:46,369 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:15:46,577 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:15:46,578 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:15:47,725 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:15:47,725 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:15:50,760 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:15:50,761 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:15:50,762 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:15:50 BoogieIcfgContainer [2024-06-28 00:15:50,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:15:50,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:15:50,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:15:50,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:15:50,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:15:44" (1/4) ... [2024-06-28 00:15:50,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a62c9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:15:50, skipping insertion in model container [2024-06-28 00:15:50,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:15:44" (2/4) ... [2024-06-28 00:15:50,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a62c9fc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:15:50, skipping insertion in model container [2024-06-28 00:15:50,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:15:45" (3/4) ... [2024-06-28 00:15:50,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a62c9fc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:15:50, skipping insertion in model container [2024-06-28 00:15:50,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:15:50" (4/4) ... [2024-06-28 00:15:50,774 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2024-06-28 00:15:50,792 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:15:50,792 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 00:15:50,793 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:15:50,884 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:15:50,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-28 00:15:51,009 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-28 00:15:51,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:15:51,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:15:51,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-28 00:15:51,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-28 00:15:51,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:15:51,039 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;@1107fa62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:15:51,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 00:15:51,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:15:51,051 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:15:51,051 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:15:51,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:51,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:15:51,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:51,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1859932952, now seen corresponding path program 1 times [2024-06-28 00:15:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079101913] [2024-06-28 00:15:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079101913] [2024-06-28 00:15:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079101913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:58,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:15:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768917833] [2024-06-28 00:15:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:58,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:15:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:15:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:15:58,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:15:58,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:58,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:58,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:15:58,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:00,107 INFO L124 PetriNetUnfolderBase]: 1205/1833 cut-off events. [2024-06-28 00:16:00,107 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-28 00:16:00,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 1833 events. 1205/1833 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8323 event pairs, 800 based on Foata normal form. 1/1799 useless extension candidates. Maximal degree in co-relation 3726. Up to 1818 conditions per place. [2024-06-28 00:16:00,128 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 35 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 00:16:00,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 181 flow [2024-06-28 00:16:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:16:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:16:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-06-28 00:16:00,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2024-06-28 00:16:00,143 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 66 transitions. [2024-06-28 00:16:00,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 181 flow [2024-06-28 00:16:00,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:16:00,149 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-28 00:16:00,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-28 00:16:00,154 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-28 00:16:00,155 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-28 00:16:00,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:00,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:00,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:16:00,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:00,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -81937262, now seen corresponding path program 1 times [2024-06-28 00:16:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858896605] [2024-06-28 00:16:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858896605] [2024-06-28 00:16:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858896605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:16:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334886958] [2024-06-28 00:16:06,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:06,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:16:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:16:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:16:06,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-28 00:16:06,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:06,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:06,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-28 00:16:06,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:07,571 INFO L124 PetriNetUnfolderBase]: 1460/2208 cut-off events. [2024-06-28 00:16:07,572 INFO L125 PetriNetUnfolderBase]: For 387/391 co-relation queries the response was YES. [2024-06-28 00:16:07,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5081 conditions, 2208 events. 1460/2208 cut-off events. For 387/391 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9954 event pairs, 758 based on Foata normal form. 7/2214 useless extension candidates. Maximal degree in co-relation 5069. Up to 2154 conditions per place. [2024-06-28 00:16:07,589 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 46 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2024-06-28 00:16:07,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 262 flow [2024-06-28 00:16:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:16:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:16:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-06-28 00:16:07,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-28 00:16:07,596 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 84 transitions. [2024-06-28 00:16:07,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 262 flow [2024-06-28 00:16:07,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:16:07,600 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-28 00:16:07,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-28 00:16:07,603 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-28 00:16:07,603 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-28 00:16:07,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:07,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:07,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:07,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:16:07,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:07,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1754915000, now seen corresponding path program 1 times [2024-06-28 00:16:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167978571] [2024-06-28 00:16:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:13,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167978571] [2024-06-28 00:16:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167978571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:16:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258207341] [2024-06-28 00:16:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:16:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:16:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:16:13,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:16:13,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:13,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:13,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:16:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:15,328 INFO L124 PetriNetUnfolderBase]: 1454/2197 cut-off events. [2024-06-28 00:16:15,329 INFO L125 PetriNetUnfolderBase]: For 1075/1075 co-relation queries the response was YES. [2024-06-28 00:16:15,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 2197 events. 1454/2197 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9845 event pairs, 619 based on Foata normal form. 3/2199 useless extension candidates. Maximal degree in co-relation 5593. Up to 2126 conditions per place. [2024-06-28 00:16:15,341 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 63 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-28 00:16:15,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 406 flow [2024-06-28 00:16:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:16:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:16:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 00:16:15,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-28 00:16:15,349 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 7 states and 122 transitions. [2024-06-28 00:16:15,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 406 flow [2024-06-28 00:16:15,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 388 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 00:16:15,354 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 196 flow [2024-06-28 00:16:15,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-28 00:16:15,355 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-28 00:16:15,355 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 196 flow [2024-06-28 00:16:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:15,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:15,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:15,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:16:15,356 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:15,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -514353325, now seen corresponding path program 1 times [2024-06-28 00:16:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205959726] [2024-06-28 00:16:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:21,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205959726] [2024-06-28 00:16:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205959726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423088104] [2024-06-28 00:16:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:21,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:21,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:21,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:16:21,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:21,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:21,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:16:21,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:23,271 INFO L124 PetriNetUnfolderBase]: 1445/2182 cut-off events. [2024-06-28 00:16:23,271 INFO L125 PetriNetUnfolderBase]: For 2063/2063 co-relation queries the response was YES. [2024-06-28 00:16:23,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 2182 events. 1445/2182 cut-off events. For 2063/2063 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9713 event pairs, 474 based on Foata normal form. 6/2187 useless extension candidates. Maximal degree in co-relation 6211. Up to 2073 conditions per place. [2024-06-28 00:16:23,285 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 68 selfloop transitions, 16 changer transitions 0/87 dead transitions. [2024-06-28 00:16:23,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 474 flow [2024-06-28 00:16:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:16:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:16:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 00:16:23,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-28 00:16:23,291 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 196 flow. Second operand 8 states and 135 transitions. [2024-06-28 00:16:23,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 474 flow [2024-06-28 00:16:23,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 444 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 00:16:23,295 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 217 flow [2024-06-28 00:16:23,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-28 00:16:23,297 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-28 00:16:23,297 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 217 flow [2024-06-28 00:16:23,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:23,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:23,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:23,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:16:23,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:23,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash -604828100, now seen corresponding path program 1 times [2024-06-28 00:16:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770206032] [2024-06-28 00:16:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770206032] [2024-06-28 00:16:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770206032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:16:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996084866] [2024-06-28 00:16:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:30,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:16:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:16:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:16:30,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-28 00:16:30,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:30,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:30,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-28 00:16:30,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:32,244 INFO L124 PetriNetUnfolderBase]: 1324/2048 cut-off events. [2024-06-28 00:16:32,244 INFO L125 PetriNetUnfolderBase]: For 3112/3112 co-relation queries the response was YES. [2024-06-28 00:16:32,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6194 conditions, 2048 events. 1324/2048 cut-off events. For 3112/3112 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9199 event pairs, 556 based on Foata normal form. 4/2051 useless extension candidates. Maximal degree in co-relation 6175. Up to 2003 conditions per place. [2024-06-28 00:16:32,266 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 46 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-06-28 00:16:32,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 391 flow [2024-06-28 00:16:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:16:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:16:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-28 00:16:32,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-28 00:16:32,273 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 217 flow. Second operand 5 states and 85 transitions. [2024-06-28 00:16:32,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 391 flow [2024-06-28 00:16:32,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 348 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:32,282 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 246 flow [2024-06-28 00:16:32,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-06-28 00:16:32,285 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-28 00:16:32,285 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 246 flow [2024-06-28 00:16:32,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:32,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:32,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:32,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:16:32,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:32,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1558180265, now seen corresponding path program 1 times [2024-06-28 00:16:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674002562] [2024-06-28 00:16:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674002562] [2024-06-28 00:16:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674002562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:16:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751370440] [2024-06-28 00:16:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:16:39,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:16:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:16:39,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:16:39,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:39,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:39,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:16:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:40,681 INFO L124 PetriNetUnfolderBase]: 1453/2194 cut-off events. [2024-06-28 00:16:40,681 INFO L125 PetriNetUnfolderBase]: For 4402/4402 co-relation queries the response was YES. [2024-06-28 00:16:40,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 2194 events. 1453/2194 cut-off events. For 4402/4402 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9793 event pairs, 523 based on Foata normal form. 8/2201 useless extension candidates. Maximal degree in co-relation 7033. Up to 2077 conditions per place. [2024-06-28 00:16:40,693 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 18 changer transitions 0/90 dead transitions. [2024-06-28 00:16:40,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 574 flow [2024-06-28 00:16:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:16:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:16:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 00:16:40,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-28 00:16:40,695 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 246 flow. Second operand 6 states and 106 transitions. [2024-06-28 00:16:40,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 574 flow [2024-06-28 00:16:40,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 552 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 00:16:40,699 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 375 flow [2024-06-28 00:16:40,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-06-28 00:16:40,700 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-06-28 00:16:40,700 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 375 flow [2024-06-28 00:16:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:40,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:40,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:40,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:16:40,701 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:40,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1889623952, now seen corresponding path program 1 times [2024-06-28 00:16:40,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788532619] [2024-06-28 00:16:40,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788532619] [2024-06-28 00:16:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788532619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:49,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:49,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566108915] [2024-06-28 00:16:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:49,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:49,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:16:49,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 375 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:49,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:49,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:16:49,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:51,063 INFO L124 PetriNetUnfolderBase]: 1466/2214 cut-off events. [2024-06-28 00:16:51,063 INFO L125 PetriNetUnfolderBase]: For 6473/6477 co-relation queries the response was YES. [2024-06-28 00:16:51,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 2214 events. 1466/2214 cut-off events. For 6473/6477 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9886 event pairs, 534 based on Foata normal form. 6/2219 useless extension candidates. Maximal degree in co-relation 8025. Up to 2109 conditions per place. [2024-06-28 00:16:51,078 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 78 selfloop transitions, 23 changer transitions 0/104 dead transitions. [2024-06-28 00:16:51,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 742 flow [2024-06-28 00:16:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:16:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:16:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-28 00:16:51,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-28 00:16:51,080 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 375 flow. Second operand 7 states and 121 transitions. [2024-06-28 00:16:51,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 742 flow [2024-06-28 00:16:51,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 728 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-28 00:16:51,088 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 491 flow [2024-06-28 00:16:51,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=491, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2024-06-28 00:16:51,089 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-28 00:16:51,089 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 491 flow [2024-06-28 00:16:51,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:51,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:51,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:51,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:16:51,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:51,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1220358268, now seen corresponding path program 2 times [2024-06-28 00:16:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162118483] [2024-06-28 00:16:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162118483] [2024-06-28 00:16:56,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162118483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:56,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:56,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:16:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426814031] [2024-06-28 00:16:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:56,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:16:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:16:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:16:56,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:16:56,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:56,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:56,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:16:56,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:58,157 INFO L124 PetriNetUnfolderBase]: 1520/2295 cut-off events. [2024-06-28 00:16:58,157 INFO L125 PetriNetUnfolderBase]: For 8298/8298 co-relation queries the response was YES. [2024-06-28 00:16:58,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8900 conditions, 2295 events. 1520/2295 cut-off events. For 8298/8298 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10243 event pairs, 530 based on Foata normal form. 2/2296 useless extension candidates. Maximal degree in co-relation 8866. Up to 2198 conditions per place. [2024-06-28 00:16:58,173 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 87 selfloop transitions, 29 changer transitions 0/119 dead transitions. [2024-06-28 00:16:58,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 910 flow [2024-06-28 00:16:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:16:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:16:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2024-06-28 00:16:58,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36097560975609755 [2024-06-28 00:16:58,179 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 491 flow. Second operand 10 states and 148 transitions. [2024-06-28 00:16:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 910 flow [2024-06-28 00:16:58,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 880 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-06-28 00:16:58,193 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 634 flow [2024-06-28 00:16:58,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=634, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2024-06-28 00:16:58,193 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-28 00:16:58,194 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 634 flow [2024-06-28 00:16:58,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:58,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:58,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:58,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:16:58,195 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:58,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1889744108, now seen corresponding path program 1 times [2024-06-28 00:16:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488911994] [2024-06-28 00:16:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488911994] [2024-06-28 00:17:07,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488911994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:07,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:07,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:17:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017335537] [2024-06-28 00:17:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:07,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:17:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:17:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:17:07,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:17:07,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 634 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:07,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:07,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:17:07,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:10,495 INFO L124 PetriNetUnfolderBase]: 1722/2579 cut-off events. [2024-06-28 00:17:10,495 INFO L125 PetriNetUnfolderBase]: For 10900/10900 co-relation queries the response was YES. [2024-06-28 00:17:10,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10271 conditions, 2579 events. 1722/2579 cut-off events. For 10900/10900 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11599 event pairs, 541 based on Foata normal form. 8/2586 useless extension candidates. Maximal degree in co-relation 10234. Up to 2332 conditions per place. [2024-06-28 00:17:10,512 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 107 selfloop transitions, 38 changer transitions 0/148 dead transitions. [2024-06-28 00:17:10,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 148 transitions, 1192 flow [2024-06-28 00:17:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:17:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:17:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-06-28 00:17:10,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2024-06-28 00:17:10,515 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 634 flow. Second operand 12 states and 186 transitions. [2024-06-28 00:17:10,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 148 transitions, 1192 flow [2024-06-28 00:17:10,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 148 transitions, 1110 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:10,532 INFO L231 Difference]: Finished difference. Result has 88 places, 96 transitions, 742 flow [2024-06-28 00:17:10,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=742, PETRI_PLACES=88, PETRI_TRANSITIONS=96} [2024-06-28 00:17:10,533 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-28 00:17:10,533 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 96 transitions, 742 flow [2024-06-28 00:17:10,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:10,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:10,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:10,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:17:10,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:10,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2040401858, now seen corresponding path program 2 times [2024-06-28 00:17:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144278138] [2024-06-28 00:17:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:17,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144278138] [2024-06-28 00:17:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144278138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:17:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092802697] [2024-06-28 00:17:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:17:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:17:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:17:17,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:17:17,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 96 transitions, 742 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:17,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:17,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:17:17,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:19,647 INFO L124 PetriNetUnfolderBase]: 1840/2747 cut-off events. [2024-06-28 00:17:19,647 INFO L125 PetriNetUnfolderBase]: For 15321/15329 co-relation queries the response was YES. [2024-06-28 00:17:19,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12000 conditions, 2747 events. 1840/2747 cut-off events. For 15321/15329 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12517 event pairs, 498 based on Foata normal form. 16/2762 useless extension candidates. Maximal degree in co-relation 11961. Up to 2198 conditions per place. [2024-06-28 00:17:19,664 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 89 selfloop transitions, 58 changer transitions 0/150 dead transitions. [2024-06-28 00:17:19,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 150 transitions, 1359 flow [2024-06-28 00:17:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:17:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:17:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-28 00:17:19,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-28 00:17:19,666 INFO L175 Difference]: Start difference. First operand has 88 places, 96 transitions, 742 flow. Second operand 7 states and 129 transitions. [2024-06-28 00:17:19,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 150 transitions, 1359 flow [2024-06-28 00:17:19,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 150 transitions, 1283 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-28 00:17:19,692 INFO L231 Difference]: Finished difference. Result has 90 places, 116 transitions, 1024 flow [2024-06-28 00:17:19,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1024, PETRI_PLACES=90, PETRI_TRANSITIONS=116} [2024-06-28 00:17:19,693 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-28 00:17:19,693 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 1024 flow [2024-06-28 00:17:19,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:19,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:19,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:19,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:17:19,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:19,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1532207550, now seen corresponding path program 3 times [2024-06-28 00:17:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:19,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865288390] [2024-06-28 00:17:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865288390] [2024-06-28 00:17:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865288390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:25,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:17:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966360435] [2024-06-28 00:17:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:25,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:17:25,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:17:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:17:25,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:17:25,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 1024 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:25,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:25,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:17:25,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:26,866 INFO L124 PetriNetUnfolderBase]: 1853/2766 cut-off events. [2024-06-28 00:17:26,866 INFO L125 PetriNetUnfolderBase]: For 19562/19572 co-relation queries the response was YES. [2024-06-28 00:17:26,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13375 conditions, 2766 events. 1853/2766 cut-off events. For 19562/19572 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12579 event pairs, 596 based on Foata normal form. 12/2777 useless extension candidates. Maximal degree in co-relation 13331. Up to 2667 conditions per place. [2024-06-28 00:17:26,883 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 28 changer transitions 0/142 dead transitions. [2024-06-28 00:17:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 142 transitions, 1392 flow [2024-06-28 00:17:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:17:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:17:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-28 00:17:26,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3597560975609756 [2024-06-28 00:17:26,887 INFO L175 Difference]: Start difference. First operand has 90 places, 116 transitions, 1024 flow. Second operand 8 states and 118 transitions. [2024-06-28 00:17:26,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 142 transitions, 1392 flow [2024-06-28 00:17:26,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 142 transitions, 1366 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-28 00:17:26,915 INFO L231 Difference]: Finished difference. Result has 97 places, 119 transitions, 1102 flow [2024-06-28 00:17:26,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1102, PETRI_PLACES=97, PETRI_TRANSITIONS=119} [2024-06-28 00:17:26,916 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-28 00:17:26,916 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 119 transitions, 1102 flow [2024-06-28 00:17:26,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:26,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:26,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:26,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:17:26,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:26,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1043226562, now seen corresponding path program 3 times [2024-06-28 00:17:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221034037] [2024-06-28 00:17:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:33,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:33,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221034037] [2024-06-28 00:17:33,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221034037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:33,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:33,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:17:33,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499840457] [2024-06-28 00:17:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:17:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:33,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:17:33,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:17:33,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:17:33,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 119 transitions, 1102 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:33,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:33,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:17:33,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:35,166 INFO L124 PetriNetUnfolderBase]: 1839/2748 cut-off events. [2024-06-28 00:17:35,166 INFO L125 PetriNetUnfolderBase]: For 20314/20324 co-relation queries the response was YES. [2024-06-28 00:17:35,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13085 conditions, 2748 events. 1839/2748 cut-off events. For 20314/20324 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12484 event pairs, 576 based on Foata normal form. 18/2765 useless extension candidates. Maximal degree in co-relation 13038. Up to 2583 conditions per place. [2024-06-28 00:17:35,181 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 114 selfloop transitions, 33 changer transitions 0/150 dead transitions. [2024-06-28 00:17:35,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 1518 flow [2024-06-28 00:17:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 00:17:35,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-28 00:17:35,184 INFO L175 Difference]: Start difference. First operand has 97 places, 119 transitions, 1102 flow. Second operand 9 states and 135 transitions. [2024-06-28 00:17:35,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 150 transitions, 1518 flow [2024-06-28 00:17:35,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 150 transitions, 1444 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:35,222 INFO L231 Difference]: Finished difference. Result has 101 places, 121 transitions, 1146 flow [2024-06-28 00:17:35,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1146, PETRI_PLACES=101, PETRI_TRANSITIONS=121} [2024-06-28 00:17:35,223 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-28 00:17:35,223 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 121 transitions, 1146 flow [2024-06-28 00:17:35,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:35,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:35,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:35,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:17:35,224 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:35,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1520884708, now seen corresponding path program 4 times [2024-06-28 00:17:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211276084] [2024-06-28 00:17:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211276084] [2024-06-28 00:17:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211276084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:40,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:17:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091888065] [2024-06-28 00:17:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:17:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:17:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:17:40,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:17:40,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 121 transitions, 1146 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:40,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:40,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:17:40,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:41,711 INFO L124 PetriNetUnfolderBase]: 1834/2741 cut-off events. [2024-06-28 00:17:41,712 INFO L125 PetriNetUnfolderBase]: For 22464/22474 co-relation queries the response was YES. [2024-06-28 00:17:41,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13374 conditions, 2741 events. 1834/2741 cut-off events. For 22464/22474 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12481 event pairs, 588 based on Foata normal form. 12/2752 useless extension candidates. Maximal degree in co-relation 13325. Up to 2620 conditions per place. [2024-06-28 00:17:41,725 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 103 selfloop transitions, 33 changer transitions 0/139 dead transitions. [2024-06-28 00:17:41,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 1462 flow [2024-06-28 00:17:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:17:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:17:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-28 00:17:41,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3623693379790941 [2024-06-28 00:17:41,728 INFO L175 Difference]: Start difference. First operand has 101 places, 121 transitions, 1146 flow. Second operand 7 states and 104 transitions. [2024-06-28 00:17:41,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 1462 flow [2024-06-28 00:17:41,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 139 transitions, 1372 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:41,761 INFO L231 Difference]: Finished difference. Result has 102 places, 121 transitions, 1138 flow [2024-06-28 00:17:41,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1138, PETRI_PLACES=102, PETRI_TRANSITIONS=121} [2024-06-28 00:17:41,763 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2024-06-28 00:17:41,763 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 121 transitions, 1138 flow [2024-06-28 00:17:41,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:41,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:41,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:41,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:17:41,763 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:41,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1532503012, now seen corresponding path program 4 times [2024-06-28 00:17:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384193128] [2024-06-28 00:17:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384193128] [2024-06-28 00:17:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384193128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:17:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376561244] [2024-06-28 00:17:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:47,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:17:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:17:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:17:47,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:17:47,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 121 transitions, 1138 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:47,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:47,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:17:47,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:49,812 INFO L124 PetriNetUnfolderBase]: 1916/2855 cut-off events. [2024-06-28 00:17:49,812 INFO L125 PetriNetUnfolderBase]: For 26035/26043 co-relation queries the response was YES. [2024-06-28 00:17:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14094 conditions, 2855 events. 1916/2855 cut-off events. For 26035/26043 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13083 event pairs, 499 based on Foata normal form. 16/2870 useless extension candidates. Maximal degree in co-relation 14044. Up to 2414 conditions per place. [2024-06-28 00:17:49,828 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 90 selfloop transitions, 65 changer transitions 0/158 dead transitions. [2024-06-28 00:17:49,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 158 transitions, 1670 flow [2024-06-28 00:17:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-28 00:17:49,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685636856368564 [2024-06-28 00:17:49,829 INFO L175 Difference]: Start difference. First operand has 102 places, 121 transitions, 1138 flow. Second operand 9 states and 136 transitions. [2024-06-28 00:17:49,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 158 transitions, 1670 flow [2024-06-28 00:17:49,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 158 transitions, 1578 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:49,864 INFO L231 Difference]: Finished difference. Result has 107 places, 131 transitions, 1379 flow [2024-06-28 00:17:49,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1379, PETRI_PLACES=107, PETRI_TRANSITIONS=131} [2024-06-28 00:17:49,865 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-28 00:17:49,865 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 131 transitions, 1379 flow [2024-06-28 00:17:49,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:49,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:49,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:49,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:17:49,866 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:49,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1042980484, now seen corresponding path program 1 times [2024-06-28 00:17:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847650943] [2024-06-28 00:17:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847650943] [2024-06-28 00:18:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847650943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:00,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012183639] [2024-06-28 00:18:00,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:00,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:00,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:00,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:00,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 131 transitions, 1379 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:00,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:00,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:00,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:02,557 INFO L124 PetriNetUnfolderBase]: 1968/2941 cut-off events. [2024-06-28 00:18:02,557 INFO L125 PetriNetUnfolderBase]: For 25482/25482 co-relation queries the response was YES. [2024-06-28 00:18:02,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14821 conditions, 2941 events. 1968/2941 cut-off events. For 25482/25482 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13557 event pairs, 562 based on Foata normal form. 16/2956 useless extension candidates. Maximal degree in co-relation 14768. Up to 2724 conditions per place. [2024-06-28 00:18:02,574 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 145 selfloop transitions, 21 changer transitions 0/169 dead transitions. [2024-06-28 00:18:02,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 169 transitions, 1873 flow [2024-06-28 00:18:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-28 00:18:02,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-28 00:18:02,576 INFO L175 Difference]: Start difference. First operand has 107 places, 131 transitions, 1379 flow. Second operand 8 states and 131 transitions. [2024-06-28 00:18:02,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 169 transitions, 1873 flow [2024-06-28 00:18:02,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 169 transitions, 1758 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:02,609 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 1346 flow [2024-06-28 00:18:02,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1346, PETRI_PLACES=108, PETRI_TRANSITIONS=133} [2024-06-28 00:18:02,610 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-06-28 00:18:02,610 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 1346 flow [2024-06-28 00:18:02,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:02,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:02,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:02,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:18:02,611 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:02,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1551286836, now seen corresponding path program 1 times [2024-06-28 00:18:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:02,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420414822] [2024-06-28 00:18:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:09,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420414822] [2024-06-28 00:18:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420414822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:09,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:09,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:09,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729725479] [2024-06-28 00:18:09,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:09,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:09,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:09,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:09,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:09,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 1346 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:09,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:09,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:09,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:11,091 INFO L124 PetriNetUnfolderBase]: 1999/2984 cut-off events. [2024-06-28 00:18:11,091 INFO L125 PetriNetUnfolderBase]: For 25000/25015 co-relation queries the response was YES. [2024-06-28 00:18:11,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14841 conditions, 2984 events. 1999/2984 cut-off events. For 25000/25015 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13795 event pairs, 603 based on Foata normal form. 15/2998 useless extension candidates. Maximal degree in co-relation 14789. Up to 2781 conditions per place. [2024-06-28 00:18:11,106 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 134 selfloop transitions, 43 changer transitions 0/180 dead transitions. [2024-06-28 00:18:11,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 180 transitions, 1920 flow [2024-06-28 00:18:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:18:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:18:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-28 00:18:11,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-28 00:18:11,109 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 1346 flow. Second operand 7 states and 134 transitions. [2024-06-28 00:18:11,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 180 transitions, 1920 flow [2024-06-28 00:18:11,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 180 transitions, 1864 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:11,142 INFO L231 Difference]: Finished difference. Result has 109 places, 139 transitions, 1458 flow [2024-06-28 00:18:11,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1458, PETRI_PLACES=109, PETRI_TRANSITIONS=139} [2024-06-28 00:18:11,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places. [2024-06-28 00:18:11,143 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 139 transitions, 1458 flow [2024-06-28 00:18:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:11,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:11,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:18:11,144 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:11,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash 54350860, now seen corresponding path program 2 times [2024-06-28 00:18:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:11,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567169742] [2024-06-28 00:18:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567169742] [2024-06-28 00:18:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567169742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:20,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063884437] [2024-06-28 00:18:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:20,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:20,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:20,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 139 transitions, 1458 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:20,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:20,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:20,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:22,028 INFO L124 PetriNetUnfolderBase]: 1994/2977 cut-off events. [2024-06-28 00:18:22,028 INFO L125 PetriNetUnfolderBase]: For 28056/28070 co-relation queries the response was YES. [2024-06-28 00:18:22,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15271 conditions, 2977 events. 1994/2977 cut-off events. For 28056/28070 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13765 event pairs, 603 based on Foata normal form. 15/2991 useless extension candidates. Maximal degree in co-relation 15219. Up to 2807 conditions per place. [2024-06-28 00:18:22,044 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 134 selfloop transitions, 40 changer transitions 0/177 dead transitions. [2024-06-28 00:18:22,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 177 transitions, 1934 flow [2024-06-28 00:18:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 00:18:22,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-28 00:18:22,046 INFO L175 Difference]: Start difference. First operand has 109 places, 139 transitions, 1458 flow. Second operand 8 states and 133 transitions. [2024-06-28 00:18:22,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 177 transitions, 1934 flow [2024-06-28 00:18:22,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 177 transitions, 1854 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 00:18:22,079 INFO L231 Difference]: Finished difference. Result has 114 places, 142 transitions, 1512 flow [2024-06-28 00:18:22,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1512, PETRI_PLACES=114, PETRI_TRANSITIONS=142} [2024-06-28 00:18:22,080 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-28 00:18:22,080 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 142 transitions, 1512 flow [2024-06-28 00:18:22,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:22,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:22,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:22,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:18:22,081 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:22,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1551196471, now seen corresponding path program 1 times [2024-06-28 00:18:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455520234] [2024-06-28 00:18:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455520234] [2024-06-28 00:18:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455520234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:31,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307264397] [2024-06-28 00:18:31,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:31,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:31,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:31,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 142 transitions, 1512 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:31,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:31,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:31,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:32,622 INFO L124 PetriNetUnfolderBase]: 2138/3180 cut-off events. [2024-06-28 00:18:32,623 INFO L125 PetriNetUnfolderBase]: For 33734/33748 co-relation queries the response was YES. [2024-06-28 00:18:32,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16696 conditions, 3180 events. 2138/3180 cut-off events. For 33734/33748 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14870 event pairs, 533 based on Foata normal form. 21/3200 useless extension candidates. Maximal degree in co-relation 16642. Up to 2762 conditions per place. [2024-06-28 00:18:32,642 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 168 selfloop transitions, 51 changer transitions 0/222 dead transitions. [2024-06-28 00:18:32,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 222 transitions, 2548 flow [2024-06-28 00:18:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 00:18:32,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-28 00:18:32,645 INFO L175 Difference]: Start difference. First operand has 114 places, 142 transitions, 1512 flow. Second operand 9 states and 163 transitions. [2024-06-28 00:18:32,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 222 transitions, 2548 flow [2024-06-28 00:18:32,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 222 transitions, 2438 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:32,681 INFO L231 Difference]: Finished difference. Result has 120 places, 164 transitions, 1800 flow [2024-06-28 00:18:32,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1800, PETRI_PLACES=120, PETRI_TRANSITIONS=164} [2024-06-28 00:18:32,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2024-06-28 00:18:32,682 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 164 transitions, 1800 flow [2024-06-28 00:18:32,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:32,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:32,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:32,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:18:32,683 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:32,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1547471821, now seen corresponding path program 2 times [2024-06-28 00:18:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:32,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781608492] [2024-06-28 00:18:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:38,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781608492] [2024-06-28 00:18:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781608492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:38,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:38,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:38,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799813420] [2024-06-28 00:18:38,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:38,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:38,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:38,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 164 transitions, 1800 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:38,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:38,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:38,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:40,381 INFO L124 PetriNetUnfolderBase]: 2178/3236 cut-off events. [2024-06-28 00:18:40,381 INFO L125 PetriNetUnfolderBase]: For 39344/39344 co-relation queries the response was YES. [2024-06-28 00:18:40,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18918 conditions, 3236 events. 2178/3236 cut-off events. For 39344/39344 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15110 event pairs, 558 based on Foata normal form. 6/3241 useless extension candidates. Maximal degree in co-relation 18860. Up to 3123 conditions per place. [2024-06-28 00:18:40,403 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 176 selfloop transitions, 33 changer transitions 0/212 dead transitions. [2024-06-28 00:18:40,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 212 transitions, 2502 flow [2024-06-28 00:18:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-28 00:18:40,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-28 00:18:40,405 INFO L175 Difference]: Start difference. First operand has 120 places, 164 transitions, 1800 flow. Second operand 9 states and 144 transitions. [2024-06-28 00:18:40,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 212 transitions, 2502 flow [2024-06-28 00:18:40,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 212 transitions, 2424 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-28 00:18:40,443 INFO L231 Difference]: Finished difference. Result has 129 places, 178 transitions, 1979 flow [2024-06-28 00:18:40,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1979, PETRI_PLACES=129, PETRI_TRANSITIONS=178} [2024-06-28 00:18:40,444 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-28 00:18:40,444 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 178 transitions, 1979 flow [2024-06-28 00:18:40,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:40,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:40,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:40,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:18:40,445 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:40,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 823602517, now seen corresponding path program 3 times [2024-06-28 00:18:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:40,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226735601] [2024-06-28 00:18:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:46,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:46,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226735601] [2024-06-28 00:18:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226735601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066413141] [2024-06-28 00:18:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:46,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:46,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:46,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:46,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 1979 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:46,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:46,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:46,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:48,233 INFO L124 PetriNetUnfolderBase]: 2242/3327 cut-off events. [2024-06-28 00:18:48,234 INFO L125 PetriNetUnfolderBase]: For 43699/43699 co-relation queries the response was YES. [2024-06-28 00:18:48,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20257 conditions, 3327 events. 2242/3327 cut-off events. For 43699/43699 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15585 event pairs, 560 based on Foata normal form. 6/3332 useless extension candidates. Maximal degree in co-relation 20194. Up to 3148 conditions per place. [2024-06-28 00:18:48,253 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 180 selfloop transitions, 43 changer transitions 0/226 dead transitions. [2024-06-28 00:18:48,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 226 transitions, 2749 flow [2024-06-28 00:18:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:18:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:18:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-06-28 00:18:48,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37317073170731707 [2024-06-28 00:18:48,254 INFO L175 Difference]: Start difference. First operand has 129 places, 178 transitions, 1979 flow. Second operand 10 states and 153 transitions. [2024-06-28 00:18:48,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 226 transitions, 2749 flow [2024-06-28 00:18:48,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 226 transitions, 2691 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-28 00:18:48,295 INFO L231 Difference]: Finished difference. Result has 137 places, 190 transitions, 2186 flow [2024-06-28 00:18:48,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2186, PETRI_PLACES=137, PETRI_TRANSITIONS=190} [2024-06-28 00:18:48,295 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-28 00:18:48,295 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 190 transitions, 2186 flow [2024-06-28 00:18:48,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:48,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:48,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:48,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:18:48,296 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:48,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1547477556, now seen corresponding path program 3 times [2024-06-28 00:18:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724869162] [2024-06-28 00:18:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724869162] [2024-06-28 00:18:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724869162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101855876] [2024-06-28 00:18:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:54,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:54,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:54,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:54,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:18:54,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 190 transitions, 2186 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:54,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:54,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:18:54,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:55,873 INFO L124 PetriNetUnfolderBase]: 2255/3346 cut-off events. [2024-06-28 00:18:55,874 INFO L125 PetriNetUnfolderBase]: For 48947/48947 co-relation queries the response was YES. [2024-06-28 00:18:55,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21299 conditions, 3346 events. 2255/3346 cut-off events. For 48947/48947 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15645 event pairs, 565 based on Foata normal form. 2/3347 useless extension candidates. Maximal degree in co-relation 21233. Up to 3243 conditions per place. [2024-06-28 00:18:55,898 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 193 selfloop transitions, 28 changer transitions 0/224 dead transitions. [2024-06-28 00:18:55,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 224 transitions, 2736 flow [2024-06-28 00:18:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:18:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:18:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 00:18:55,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-28 00:18:55,900 INFO L175 Difference]: Start difference. First operand has 137 places, 190 transitions, 2186 flow. Second operand 7 states and 120 transitions. [2024-06-28 00:18:55,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 224 transitions, 2736 flow [2024-06-28 00:18:55,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 224 transitions, 2643 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:55,967 INFO L231 Difference]: Finished difference. Result has 138 places, 193 transitions, 2196 flow [2024-06-28 00:18:55,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2196, PETRI_PLACES=138, PETRI_TRANSITIONS=193} [2024-06-28 00:18:55,968 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-28 00:18:55,968 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 193 transitions, 2196 flow [2024-06-28 00:18:55,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:18:55,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:55,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:55,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:18:55,968 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:55,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash 253796800, now seen corresponding path program 4 times [2024-06-28 00:18:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:55,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910574230] [2024-06-28 00:18:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910574230] [2024-06-28 00:19:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910574230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338182362] [2024-06-28 00:19:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:02,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:02,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:02,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:02,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 193 transitions, 2196 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:02,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:02,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:02,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:03,692 INFO L124 PetriNetUnfolderBase]: 2250/3341 cut-off events. [2024-06-28 00:19:03,692 INFO L125 PetriNetUnfolderBase]: For 52246/52256 co-relation queries the response was YES. [2024-06-28 00:19:03,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21430 conditions, 3341 events. 2250/3341 cut-off events. For 52246/52256 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15661 event pairs, 573 based on Foata normal form. 12/3352 useless extension candidates. Maximal degree in co-relation 21362. Up to 3231 conditions per place. [2024-06-28 00:19:03,714 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 190 selfloop transitions, 28 changer transitions 0/221 dead transitions. [2024-06-28 00:19:03,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 221 transitions, 2700 flow [2024-06-28 00:19:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:19:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:19:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 00:19:03,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-28 00:19:03,716 INFO L175 Difference]: Start difference. First operand has 138 places, 193 transitions, 2196 flow. Second operand 7 states and 118 transitions. [2024-06-28 00:19:03,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 221 transitions, 2700 flow [2024-06-28 00:19:03,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 221 transitions, 2590 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:03,768 INFO L231 Difference]: Finished difference. Result has 139 places, 193 transitions, 2150 flow [2024-06-28 00:19:03,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2150, PETRI_PLACES=139, PETRI_TRANSITIONS=193} [2024-06-28 00:19:03,768 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-28 00:19:03,769 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 193 transitions, 2150 flow [2024-06-28 00:19:03,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:03,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:03,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:03,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:19:03,769 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:03,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1171847427, now seen corresponding path program 4 times [2024-06-28 00:19:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294056489] [2024-06-28 00:19:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:09,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:09,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294056489] [2024-06-28 00:19:09,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294056489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:09,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:09,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810933085] [2024-06-28 00:19:09,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:09,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:09,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:09,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:09,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:09,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 193 transitions, 2150 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:09,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:09,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:09,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:11,502 INFO L124 PetriNetUnfolderBase]: 2350/3484 cut-off events. [2024-06-28 00:19:11,502 INFO L125 PetriNetUnfolderBase]: For 58882/58892 co-relation queries the response was YES. [2024-06-28 00:19:11,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22633 conditions, 3484 events. 2350/3484 cut-off events. For 58882/58892 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16432 event pairs, 567 based on Foata normal form. 16/3499 useless extension candidates. Maximal degree in co-relation 22566. Up to 3274 conditions per place. [2024-06-28 00:19:11,526 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 202 selfloop transitions, 43 changer transitions 0/248 dead transitions. [2024-06-28 00:19:11,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 248 transitions, 3084 flow [2024-06-28 00:19:11,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:19:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:19:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-28 00:19:11,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3804878048780488 [2024-06-28 00:19:11,528 INFO L175 Difference]: Start difference. First operand has 139 places, 193 transitions, 2150 flow. Second operand 10 states and 156 transitions. [2024-06-28 00:19:11,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 248 transitions, 3084 flow [2024-06-28 00:19:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 248 transitions, 3009 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:11,576 INFO L231 Difference]: Finished difference. Result has 145 places, 207 transitions, 2383 flow [2024-06-28 00:19:11,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2383, PETRI_PLACES=145, PETRI_TRANSITIONS=207} [2024-06-28 00:19:11,577 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-28 00:19:11,577 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 207 transitions, 2383 flow [2024-06-28 00:19:11,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:11,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:11,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:11,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:19:11,578 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:11,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 253802535, now seen corresponding path program 5 times [2024-06-28 00:19:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541301358] [2024-06-28 00:19:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:17,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:17,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541301358] [2024-06-28 00:19:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541301358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:17,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039584167] [2024-06-28 00:19:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:17,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:17,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:17,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 207 transitions, 2383 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:17,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:17,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:17,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:19,154 INFO L124 PetriNetUnfolderBase]: 2354/3490 cut-off events. [2024-06-28 00:19:19,155 INFO L125 PetriNetUnfolderBase]: For 65828/65838 co-relation queries the response was YES. [2024-06-28 00:19:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23589 conditions, 3490 events. 2354/3490 cut-off events. For 65828/65838 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16450 event pairs, 566 based on Foata normal form. 16/3505 useless extension candidates. Maximal degree in co-relation 23518. Up to 3349 conditions per place. [2024-06-28 00:19:19,184 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 206 selfloop transitions, 39 changer transitions 0/248 dead transitions. [2024-06-28 00:19:19,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 248 transitions, 3143 flow [2024-06-28 00:19:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:19:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:19:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-28 00:19:19,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-28 00:19:19,185 INFO L175 Difference]: Start difference. First operand has 145 places, 207 transitions, 2383 flow. Second operand 9 states and 141 transitions. [2024-06-28 00:19:19,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 248 transitions, 3143 flow [2024-06-28 00:19:19,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 248 transitions, 3005 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-28 00:19:19,247 INFO L231 Difference]: Finished difference. Result has 151 places, 217 transitions, 2515 flow [2024-06-28 00:19:19,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2515, PETRI_PLACES=151, PETRI_TRANSITIONS=217} [2024-06-28 00:19:19,248 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places. [2024-06-28 00:19:19,248 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 217 transitions, 2515 flow [2024-06-28 00:19:19,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:19,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:19,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:19,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:19:19,249 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:19,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 261154185, now seen corresponding path program 6 times [2024-06-28 00:19:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042878273] [2024-06-28 00:19:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:26,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042878273] [2024-06-28 00:19:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042878273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:26,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527213952] [2024-06-28 00:19:26,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:26,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:26,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:26,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:26,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:26,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:26,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 217 transitions, 2515 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:26,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:26,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:26,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:28,853 INFO L124 PetriNetUnfolderBase]: 2394/3549 cut-off events. [2024-06-28 00:19:28,854 INFO L125 PetriNetUnfolderBase]: For 70790/70800 co-relation queries the response was YES. [2024-06-28 00:19:28,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24240 conditions, 3549 events. 2394/3549 cut-off events. For 70790/70800 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16636 event pairs, 482 based on Foata normal form. 16/3564 useless extension candidates. Maximal degree in co-relation 24165. Up to 3271 conditions per place. [2024-06-28 00:19:28,878 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 206 selfloop transitions, 104 changer transitions 0/313 dead transitions. [2024-06-28 00:19:28,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 313 transitions, 4161 flow [2024-06-28 00:19:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:19:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:19:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-28 00:19:28,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37028824833702884 [2024-06-28 00:19:28,879 INFO L175 Difference]: Start difference. First operand has 151 places, 217 transitions, 2515 flow. Second operand 11 states and 167 transitions. [2024-06-28 00:19:28,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 313 transitions, 4161 flow [2024-06-28 00:19:28,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 313 transitions, 4031 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:28,943 INFO L231 Difference]: Finished difference. Result has 160 places, 281 transitions, 3628 flow [2024-06-28 00:19:28,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2396, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3628, PETRI_PLACES=160, PETRI_TRANSITIONS=281} [2024-06-28 00:19:28,944 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-28 00:19:28,944 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 281 transitions, 3628 flow [2024-06-28 00:19:28,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:28,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:28,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:28,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:19:28,945 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:28,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 97223049, now seen corresponding path program 7 times [2024-06-28 00:19:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546798923] [2024-06-28 00:19:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546798923] [2024-06-28 00:19:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546798923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:34,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875052414] [2024-06-28 00:19:34,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:34,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:34,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:34,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:34,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 281 transitions, 3628 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:34,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:34,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:34,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:36,686 INFO L124 PetriNetUnfolderBase]: 2434/3607 cut-off events. [2024-06-28 00:19:36,687 INFO L125 PetriNetUnfolderBase]: For 86533/86545 co-relation queries the response was YES. [2024-06-28 00:19:36,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26334 conditions, 3607 events. 2434/3607 cut-off events. For 86533/86545 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16937 event pairs, 473 based on Foata normal form. 18/3624 useless extension candidates. Maximal degree in co-relation 26253. Up to 3375 conditions per place. [2024-06-28 00:19:36,716 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 237 selfloop transitions, 86 changer transitions 0/326 dead transitions. [2024-06-28 00:19:36,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 326 transitions, 4672 flow [2024-06-28 00:19:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:19:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:19:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2024-06-28 00:19:36,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35033259423503327 [2024-06-28 00:19:36,717 INFO L175 Difference]: Start difference. First operand has 160 places, 281 transitions, 3628 flow. Second operand 11 states and 158 transitions. [2024-06-28 00:19:36,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 326 transitions, 4672 flow [2024-06-28 00:19:36,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 326 transitions, 4332 flow, removed 168 selfloop flow, removed 1 redundant places. [2024-06-28 00:19:36,850 INFO L231 Difference]: Finished difference. Result has 175 places, 300 transitions, 3884 flow [2024-06-28 00:19:36,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3884, PETRI_PLACES=175, PETRI_TRANSITIONS=300} [2024-06-28 00:19:36,850 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places. [2024-06-28 00:19:36,850 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 300 transitions, 3884 flow [2024-06-28 00:19:36,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:36,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:36,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:19:36,851 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:36,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash -262955721, now seen corresponding path program 8 times [2024-06-28 00:19:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:36,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596336268] [2024-06-28 00:19:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:36,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596336268] [2024-06-28 00:19:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596336268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196184345] [2024-06-28 00:19:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:42,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:42,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:42,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 300 transitions, 3884 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:42,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:42,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:42,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:43,941 INFO L124 PetriNetUnfolderBase]: 2464/3650 cut-off events. [2024-06-28 00:19:43,942 INFO L125 PetriNetUnfolderBase]: For 91198/91210 co-relation queries the response was YES. [2024-06-28 00:19:43,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27273 conditions, 3650 events. 2464/3650 cut-off events. For 91198/91210 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17170 event pairs, 478 based on Foata normal form. 18/3667 useless extension candidates. Maximal degree in co-relation 27184. Up to 3284 conditions per place. [2024-06-28 00:19:43,974 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 238 selfloop transitions, 99 changer transitions 0/340 dead transitions. [2024-06-28 00:19:43,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 340 transitions, 4952 flow [2024-06-28 00:19:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:19:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:19:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 00:19:43,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-28 00:19:43,976 INFO L175 Difference]: Start difference. First operand has 175 places, 300 transitions, 3884 flow. Second operand 8 states and 133 transitions. [2024-06-28 00:19:43,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 340 transitions, 4952 flow [2024-06-28 00:19:44,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 340 transitions, 4828 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-28 00:19:44,108 INFO L231 Difference]: Finished difference. Result has 180 places, 312 transitions, 4252 flow [2024-06-28 00:19:44,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4252, PETRI_PLACES=180, PETRI_TRANSITIONS=312} [2024-06-28 00:19:44,108 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-28 00:19:44,108 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 312 transitions, 4252 flow [2024-06-28 00:19:44,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-28 00:19:44,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:44,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:44,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:19:44,109 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:44,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1968466845, now seen corresponding path program 1 times [2024-06-28 00:19:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68332076] [2024-06-28 00:19:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68332076] [2024-06-28 00:19:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68332076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:48,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:48,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:19:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764405164] [2024-06-28 00:19:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:48,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:19:48,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:19:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:19:48,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:48,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 312 transitions, 4252 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:48,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:48,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:48,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:50,471 INFO L124 PetriNetUnfolderBase]: 2398/3555 cut-off events. [2024-06-28 00:19:50,471 INFO L125 PetriNetUnfolderBase]: For 98485/98491 co-relation queries the response was YES. [2024-06-28 00:19:50,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27581 conditions, 3555 events. 2398/3555 cut-off events. For 98485/98491 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16660 event pairs, 545 based on Foata normal form. 14/3568 useless extension candidates. Maximal degree in co-relation 27490. Up to 3452 conditions per place. [2024-06-28 00:19:50,501 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 289 selfloop transitions, 23 changer transitions 0/315 dead transitions. [2024-06-28 00:19:50,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 315 transitions, 4838 flow [2024-06-28 00:19:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:19:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:19:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-28 00:19:50,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-28 00:19:50,502 INFO L175 Difference]: Start difference. First operand has 180 places, 312 transitions, 4252 flow. Second operand 5 states and 85 transitions. [2024-06-28 00:19:50,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 315 transitions, 4838 flow [2024-06-28 00:19:50,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 315 transitions, 4612 flow, removed 71 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:50,644 INFO L231 Difference]: Finished difference. Result has 178 places, 302 transitions, 3979 flow [2024-06-28 00:19:50,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3914, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3979, PETRI_PLACES=178, PETRI_TRANSITIONS=302} [2024-06-28 00:19:50,645 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-06-28 00:19:50,645 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 302 transitions, 3979 flow [2024-06-28 00:19:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:50,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:50,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:50,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:19:50,646 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:50,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -356275647, now seen corresponding path program 1 times [2024-06-28 00:19:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:50,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578353173] [2024-06-28 00:19:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578353173] [2024-06-28 00:19:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578353173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123046742] [2024-06-28 00:19:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:58,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:58,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:19:58,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 302 transitions, 3979 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:58,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:58,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:19:58,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:00,110 INFO L124 PetriNetUnfolderBase]: 2446/3627 cut-off events. [2024-06-28 00:20:00,110 INFO L125 PetriNetUnfolderBase]: For 96463/96486 co-relation queries the response was YES. [2024-06-28 00:20:00,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27863 conditions, 3627 events. 2446/3627 cut-off events. For 96463/96486 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17113 event pairs, 341 based on Foata normal form. 24/3650 useless extension candidates. Maximal degree in co-relation 27771. Up to 3315 conditions per place. [2024-06-28 00:20:00,141 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 300 selfloop transitions, 51 changer transitions 0/354 dead transitions. [2024-06-28 00:20:00,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 354 transitions, 5015 flow [2024-06-28 00:20:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:20:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:20:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:20:00,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-28 00:20:00,144 INFO L175 Difference]: Start difference. First operand has 178 places, 302 transitions, 3979 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:20:00,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 354 transitions, 5015 flow [2024-06-28 00:20:00,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 354 transitions, 4997 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 00:20:00,265 INFO L231 Difference]: Finished difference. Result has 185 places, 306 transitions, 4190 flow [2024-06-28 00:20:00,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3961, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4190, PETRI_PLACES=185, PETRI_TRANSITIONS=306} [2024-06-28 00:20:00,266 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-28 00:20:00,267 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 306 transitions, 4190 flow [2024-06-28 00:20:00,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:00,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:00,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:00,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:20:00,267 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:00,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash -356215073, now seen corresponding path program 1 times [2024-06-28 00:20:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:00,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760010507] [2024-06-28 00:20:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:00,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760010507] [2024-06-28 00:20:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760010507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:20:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741554607] [2024-06-28 00:20:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:06,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:20:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:06,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:20:06,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:20:07,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:20:07,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 306 transitions, 4190 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:07,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:07,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:20:07,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:09,403 INFO L124 PetriNetUnfolderBase]: 2590/3830 cut-off events. [2024-06-28 00:20:09,403 INFO L125 PetriNetUnfolderBase]: For 110524/110547 co-relation queries the response was YES. [2024-06-28 00:20:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30016 conditions, 3830 events. 2590/3830 cut-off events. For 110524/110547 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18208 event pairs, 417 based on Foata normal form. 28/3857 useless extension candidates. Maximal degree in co-relation 29922. Up to 3195 conditions per place. [2024-06-28 00:20:09,434 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 282 selfloop transitions, 115 changer transitions 0/400 dead transitions. [2024-06-28 00:20:09,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 400 transitions, 5932 flow [2024-06-28 00:20:09,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:20:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:20:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 00:20:09,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611973392461197 [2024-06-28 00:20:09,435 INFO L175 Difference]: Start difference. First operand has 185 places, 306 transitions, 4190 flow. Second operand 11 states and 208 transitions. [2024-06-28 00:20:09,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 400 transitions, 5932 flow [2024-06-28 00:20:09,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 400 transitions, 5801 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-28 00:20:09,576 INFO L231 Difference]: Finished difference. Result has 195 places, 326 transitions, 4690 flow [2024-06-28 00:20:09,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4059, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4690, PETRI_PLACES=195, PETRI_TRANSITIONS=326} [2024-06-28 00:20:09,576 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places. [2024-06-28 00:20:09,576 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 326 transitions, 4690 flow [2024-06-28 00:20:09,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:09,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:09,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:20:09,577 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:09,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash -437828659, now seen corresponding path program 2 times [2024-06-28 00:20:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864860961] [2024-06-28 00:20:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864860961] [2024-06-28 00:20:16,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864860961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:16,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:16,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:20:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528438711] [2024-06-28 00:20:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:16,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:20:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:20:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:20:16,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:20:16,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 326 transitions, 4690 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:16,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:16,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:20:16,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:18,427 INFO L124 PetriNetUnfolderBase]: 2610/3862 cut-off events. [2024-06-28 00:20:18,427 INFO L125 PetriNetUnfolderBase]: For 129726/129749 co-relation queries the response was YES. [2024-06-28 00:20:18,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32547 conditions, 3862 events. 2610/3862 cut-off events. For 129726/129749 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18435 event pairs, 436 based on Foata normal form. 24/3885 useless extension candidates. Maximal degree in co-relation 32447. Up to 3634 conditions per place. [2024-06-28 00:20:18,468 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 322 selfloop transitions, 48 changer transitions 0/373 dead transitions. [2024-06-28 00:20:18,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 373 transitions, 5588 flow [2024-06-28 00:20:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:20:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:20:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-28 00:20:18,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-28 00:20:18,470 INFO L175 Difference]: Start difference. First operand has 195 places, 326 transitions, 4690 flow. Second operand 8 states and 146 transitions. [2024-06-28 00:20:18,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 373 transitions, 5588 flow [2024-06-28 00:20:18,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 373 transitions, 5263 flow, removed 102 selfloop flow, removed 4 redundant places. [2024-06-28 00:20:18,765 INFO L231 Difference]: Finished difference. Result has 199 places, 328 transitions, 4516 flow [2024-06-28 00:20:18,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4365, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4516, PETRI_PLACES=199, PETRI_TRANSITIONS=328} [2024-06-28 00:20:18,766 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-28 00:20:18,766 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 328 transitions, 4516 flow [2024-06-28 00:20:18,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:18,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:18,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:18,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:20:18,766 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:18,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1684879821, now seen corresponding path program 2 times [2024-06-28 00:20:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005587553] [2024-06-28 00:20:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005587553] [2024-06-28 00:20:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005587553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972720081] [2024-06-28 00:20:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:27,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:27,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:20:27,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 328 transitions, 4516 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:27,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:27,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:20:27,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:30,140 INFO L124 PetriNetUnfolderBase]: 2748/4058 cut-off events. [2024-06-28 00:20:30,140 INFO L125 PetriNetUnfolderBase]: For 142688/142711 co-relation queries the response was YES. [2024-06-28 00:20:30,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34254 conditions, 4058 events. 2748/4058 cut-off events. For 142688/142711 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19498 event pairs, 418 based on Foata normal form. 28/4085 useless extension candidates. Maximal degree in co-relation 34152. Up to 3307 conditions per place. [2024-06-28 00:20:30,176 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 259 selfloop transitions, 132 changer transitions 0/394 dead transitions. [2024-06-28 00:20:30,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 394 transitions, 6037 flow [2024-06-28 00:20:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:20:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:20:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 00:20:30,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-28 00:20:30,177 INFO L175 Difference]: Start difference. First operand has 199 places, 328 transitions, 4516 flow. Second operand 10 states and 183 transitions. [2024-06-28 00:20:30,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 394 transitions, 6037 flow [2024-06-28 00:20:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 394 transitions, 5908 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 00:20:30,361 INFO L231 Difference]: Finished difference. Result has 204 places, 336 transitions, 4835 flow [2024-06-28 00:20:30,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4387, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4835, PETRI_PLACES=204, PETRI_TRANSITIONS=336} [2024-06-28 00:20:30,362 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2024-06-28 00:20:30,362 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 336 transitions, 4835 flow [2024-06-28 00:20:30,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:30,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:30,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:30,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:20:30,363 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:30,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -435032149, now seen corresponding path program 3 times [2024-06-28 00:20:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789489330] [2024-06-28 00:20:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789489330] [2024-06-28 00:20:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789489330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439123098] [2024-06-28 00:20:40,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:40,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:40,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:20:40,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 336 transitions, 4835 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:40,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:40,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:20:40,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:43,159 INFO L124 PetriNetUnfolderBase]: 2740/4046 cut-off events. [2024-06-28 00:20:43,159 INFO L125 PetriNetUnfolderBase]: For 150631/150654 co-relation queries the response was YES. [2024-06-28 00:20:43,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35224 conditions, 4046 events. 2740/4046 cut-off events. For 150631/150654 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19433 event pairs, 455 based on Foata normal form. 24/4069 useless extension candidates. Maximal degree in co-relation 35120. Up to 3854 conditions per place. [2024-06-28 00:20:43,203 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 334 selfloop transitions, 42 changer transitions 0/379 dead transitions. [2024-06-28 00:20:43,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 379 transitions, 5763 flow [2024-06-28 00:20:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:20:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:20:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 00:20:43,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-28 00:20:43,206 INFO L175 Difference]: Start difference. First operand has 204 places, 336 transitions, 4835 flow. Second operand 9 states and 147 transitions. [2024-06-28 00:20:43,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 379 transitions, 5763 flow [2024-06-28 00:20:43,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 379 transitions, 5519 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-28 00:20:43,396 INFO L231 Difference]: Finished difference. Result has 207 places, 338 transitions, 4760 flow [2024-06-28 00:20:43,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4591, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4760, PETRI_PLACES=207, PETRI_TRANSITIONS=338} [2024-06-28 00:20:43,397 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-28 00:20:43,397 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 338 transitions, 4760 flow [2024-06-28 00:20:43,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:43,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:43,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:43,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:20:43,397 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:43,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -353413913, now seen corresponding path program 3 times [2024-06-28 00:20:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:43,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462708430] [2024-06-28 00:20:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:52,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:52,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462708430] [2024-06-28 00:20:52,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462708430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:52,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:52,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062508080] [2024-06-28 00:20:52,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:52,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:52,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:52,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:52,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:20:52,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 338 transitions, 4760 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:52,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:52,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:20:52,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:54,955 INFO L124 PetriNetUnfolderBase]: 2828/4169 cut-off events. [2024-06-28 00:20:54,956 INFO L125 PetriNetUnfolderBase]: For 161509/161532 co-relation queries the response was YES. [2024-06-28 00:20:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36347 conditions, 4169 events. 2828/4169 cut-off events. For 161509/161532 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20105 event pairs, 419 based on Foata normal form. 30/4198 useless extension candidates. Maximal degree in co-relation 36241. Up to 3414 conditions per place. [2024-06-28 00:20:55,001 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 287 selfloop transitions, 123 changer transitions 0/413 dead transitions. [2024-06-28 00:20:55,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 413 transitions, 6446 flow [2024-06-28 00:20:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:20:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:20:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 00:20:55,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-28 00:20:55,005 INFO L175 Difference]: Start difference. First operand has 207 places, 338 transitions, 4760 flow. Second operand 10 states and 182 transitions. [2024-06-28 00:20:55,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 413 transitions, 6446 flow [2024-06-28 00:20:55,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 413 transitions, 6295 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-28 00:20:55,239 INFO L231 Difference]: Finished difference. Result has 212 places, 355 transitions, 5284 flow [2024-06-28 00:20:55,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4609, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5284, PETRI_PLACES=212, PETRI_TRANSITIONS=355} [2024-06-28 00:20:55,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-28 00:20:55,240 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 355 transitions, 5284 flow [2024-06-28 00:20:55,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:55,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:55,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:55,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:20:55,241 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:55,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -238122743, now seen corresponding path program 4 times [2024-06-28 00:20:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212283651] [2024-06-28 00:20:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:03,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212283651] [2024-06-28 00:21:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212283651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:03,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838554634] [2024-06-28 00:21:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:03,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:03,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:03,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:21:03,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 355 transitions, 5284 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:03,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:03,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:21:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:05,638 INFO L124 PetriNetUnfolderBase]: 2922/4302 cut-off events. [2024-06-28 00:21:05,638 INFO L125 PetriNetUnfolderBase]: For 178921/178944 co-relation queries the response was YES. [2024-06-28 00:21:05,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39170 conditions, 4302 events. 2922/4302 cut-off events. For 178921/178944 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20802 event pairs, 473 based on Foata normal form. 23/4324 useless extension candidates. Maximal degree in co-relation 39061. Up to 3966 conditions per place. [2024-06-28 00:21:05,679 INFO L140 encePairwiseOnDemand]: 25/41 looper letters, 346 selfloop transitions, 76 changer transitions 0/425 dead transitions. [2024-06-28 00:21:05,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 425 transitions, 6832 flow [2024-06-28 00:21:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:21:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:21:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2024-06-28 00:21:05,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-28 00:21:05,681 INFO L175 Difference]: Start difference. First operand has 212 places, 355 transitions, 5284 flow. Second operand 12 states and 196 transitions. [2024-06-28 00:21:05,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 425 transitions, 6832 flow [2024-06-28 00:21:05,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 425 transitions, 6602 flow, removed 78 selfloop flow, removed 4 redundant places. [2024-06-28 00:21:05,919 INFO L231 Difference]: Finished difference. Result has 221 places, 367 transitions, 5532 flow [2024-06-28 00:21:05,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5076, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5532, PETRI_PLACES=221, PETRI_TRANSITIONS=367} [2024-06-28 00:21:05,919 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-28 00:21:05,920 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 367 transitions, 5532 flow [2024-06-28 00:21:05,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:05,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:05,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:05,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:21:05,920 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:05,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -237949763, now seen corresponding path program 5 times [2024-06-28 00:21:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565880578] [2024-06-28 00:21:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565880578] [2024-06-28 00:21:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565880578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:12,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:12,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533644212] [2024-06-28 00:21:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:12,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:21:12,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 367 transitions, 5532 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:12,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:12,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:21:12,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:15,374 INFO L124 PetriNetUnfolderBase]: 3181/4674 cut-off events. [2024-06-28 00:21:15,374 INFO L125 PetriNetUnfolderBase]: For 196633/196633 co-relation queries the response was YES. [2024-06-28 00:21:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43429 conditions, 4674 events. 3181/4674 cut-off events. For 196633/196633 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22880 event pairs, 451 based on Foata normal form. 8/4681 useless extension candidates. Maximal degree in co-relation 43317. Up to 4162 conditions per place. [2024-06-28 00:21:15,422 INFO L140 encePairwiseOnDemand]: 25/41 looper letters, 376 selfloop transitions, 118 changer transitions 0/497 dead transitions. [2024-06-28 00:21:15,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 497 transitions, 8491 flow [2024-06-28 00:21:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:21:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:21:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions. [2024-06-28 00:21:15,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40040650406504064 [2024-06-28 00:21:15,423 INFO L175 Difference]: Start difference. First operand has 221 places, 367 transitions, 5532 flow. Second operand 12 states and 197 transitions. [2024-06-28 00:21:15,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 497 transitions, 8491 flow [2024-06-28 00:21:15,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 497 transitions, 8334 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-28 00:21:15,703 INFO L231 Difference]: Finished difference. Result has 233 places, 440 transitions, 7211 flow [2024-06-28 00:21:15,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5378, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7211, PETRI_PLACES=233, PETRI_TRANSITIONS=440} [2024-06-28 00:21:15,704 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 191 predicate places. [2024-06-28 00:21:15,704 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 440 transitions, 7211 flow [2024-06-28 00:21:15,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:15,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:15,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:15,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:21:15,705 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:15,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash -237942819, now seen corresponding path program 1 times [2024-06-28 00:21:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965324994] [2024-06-28 00:21:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965324994] [2024-06-28 00:21:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965324994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:21:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183401369] [2024-06-28 00:21:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:23,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:21:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:21:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:21:23,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:21:23,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 440 transitions, 7211 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:23,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:23,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:21:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:26,336 INFO L124 PetriNetUnfolderBase]: 3261/4803 cut-off events. [2024-06-28 00:21:26,336 INFO L125 PetriNetUnfolderBase]: For 222714/222737 co-relation queries the response was YES. [2024-06-28 00:21:26,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46356 conditions, 4803 events. 3261/4803 cut-off events. For 222714/222737 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23744 event pairs, 470 based on Foata normal form. 27/4829 useless extension candidates. Maximal degree in co-relation 46237. Up to 4366 conditions per place. [2024-06-28 00:21:26,391 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 414 selfloop transitions, 78 changer transitions 0/495 dead transitions. [2024-06-28 00:21:26,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 495 transitions, 8788 flow [2024-06-28 00:21:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:21:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:21:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-28 00:21:26,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924611973392461 [2024-06-28 00:21:26,392 INFO L175 Difference]: Start difference. First operand has 233 places, 440 transitions, 7211 flow. Second operand 11 states and 177 transitions. [2024-06-28 00:21:26,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 495 transitions, 8788 flow [2024-06-28 00:21:26,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 495 transitions, 8587 flow, removed 87 selfloop flow, removed 4 redundant places. [2024-06-28 00:21:26,744 INFO L231 Difference]: Finished difference. Result has 240 places, 442 transitions, 7251 flow [2024-06-28 00:21:26,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7016, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7251, PETRI_PLACES=240, PETRI_TRANSITIONS=442} [2024-06-28 00:21:26,745 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-28 00:21:26,745 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 442 transitions, 7251 flow [2024-06-28 00:21:26,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:26,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:26,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:26,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:21:26,746 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:26,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -319556529, now seen corresponding path program 1 times [2024-06-28 00:21:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690048000] [2024-06-28 00:21:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:26,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690048000] [2024-06-28 00:21:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690048000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:21:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768455633] [2024-06-28 00:21:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:33,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:21:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:33,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:21:33,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:21:33,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:21:33,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 442 transitions, 7251 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:33,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:33,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:21:33,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:36,084 INFO L124 PetriNetUnfolderBase]: 3323/4892 cut-off events. [2024-06-28 00:21:36,084 INFO L125 PetriNetUnfolderBase]: For 228280/228303 co-relation queries the response was YES. [2024-06-28 00:21:36,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47444 conditions, 4892 events. 3323/4892 cut-off events. For 228280/228303 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24192 event pairs, 482 based on Foata normal form. 20/4911 useless extension candidates. Maximal degree in co-relation 47324. Up to 4469 conditions per place. [2024-06-28 00:21:36,144 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 409 selfloop transitions, 91 changer transitions 0/503 dead transitions. [2024-06-28 00:21:36,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 503 transitions, 8970 flow [2024-06-28 00:21:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:21:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:21:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-06-28 00:21:36,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38802660753880264 [2024-06-28 00:21:36,146 INFO L175 Difference]: Start difference. First operand has 240 places, 442 transitions, 7251 flow. Second operand 11 states and 175 transitions. [2024-06-28 00:21:36,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 503 transitions, 8970 flow [2024-06-28 00:21:36,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 503 transitions, 8777 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-28 00:21:36,523 INFO L231 Difference]: Finished difference. Result has 242 places, 452 transitions, 7519 flow [2024-06-28 00:21:36,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7058, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7519, PETRI_PLACES=242, PETRI_TRANSITIONS=452} [2024-06-28 00:21:36,523 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places. [2024-06-28 00:21:36,523 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 452 transitions, 7519 flow [2024-06-28 00:21:36,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:36,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:36,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:36,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:21:36,524 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:36,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash -238127517, now seen corresponding path program 4 times [2024-06-28 00:21:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275283654] [2024-06-28 00:21:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:43,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275283654] [2024-06-28 00:21:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275283654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:43,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:21:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610291307] [2024-06-28 00:21:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:43,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:21:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:43,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:21:43,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:21:43,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:21:43,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 452 transitions, 7519 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:43,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:43,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:21:43,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:45,346 INFO L124 PetriNetUnfolderBase]: 3343/4923 cut-off events. [2024-06-28 00:21:45,346 INFO L125 PetriNetUnfolderBase]: For 237058/237058 co-relation queries the response was YES. [2024-06-28 00:21:45,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48229 conditions, 4923 events. 3343/4923 cut-off events. For 237058/237058 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24406 event pairs, 480 based on Foata normal form. 4/4926 useless extension candidates. Maximal degree in co-relation 48108. Up to 4778 conditions per place. [2024-06-28 00:21:45,404 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 453 selfloop transitions, 34 changer transitions 0/490 dead transitions. [2024-06-28 00:21:45,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 490 transitions, 8649 flow [2024-06-28 00:21:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:21:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:21:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 00:21:45,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-28 00:21:45,406 INFO L175 Difference]: Start difference. First operand has 242 places, 452 transitions, 7519 flow. Second operand 8 states and 134 transitions. [2024-06-28 00:21:45,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 490 transitions, 8649 flow [2024-06-28 00:21:45,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 490 transitions, 8409 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-06-28 00:21:45,821 INFO L231 Difference]: Finished difference. Result has 241 places, 454 transitions, 7406 flow [2024-06-28 00:21:45,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7279, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7406, PETRI_PLACES=241, PETRI_TRANSITIONS=454} [2024-06-28 00:21:45,822 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-28 00:21:45,822 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 454 transitions, 7406 flow [2024-06-28 00:21:45,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:45,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:45,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:45,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:21:45,823 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:45,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -238127393, now seen corresponding path program 6 times [2024-06-28 00:21:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:45,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596921277] [2024-06-28 00:21:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596921277] [2024-06-28 00:21:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596921277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:21:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487965973] [2024-06-28 00:21:52,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:52,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:21:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:52,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:21:52,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:21:52,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:21:52,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 454 transitions, 7406 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:52,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:52,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:21:52,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:54,664 INFO L124 PetriNetUnfolderBase]: 3534/5193 cut-off events. [2024-06-28 00:21:54,665 INFO L125 PetriNetUnfolderBase]: For 261824/261824 co-relation queries the response was YES. [2024-06-28 00:21:54,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51190 conditions, 5193 events. 3534/5193 cut-off events. For 261824/261824 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 25913 event pairs, 477 based on Foata normal form. 8/5200 useless extension candidates. Maximal degree in co-relation 51068. Up to 4200 conditions per place. [2024-06-28 00:21:54,727 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 401 selfloop transitions, 128 changer transitions 0/532 dead transitions. [2024-06-28 00:21:54,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 532 transitions, 9753 flow [2024-06-28 00:21:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:21:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:21:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 00:21:54,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-28 00:21:54,729 INFO L175 Difference]: Start difference. First operand has 241 places, 454 transitions, 7406 flow. Second operand 9 states and 165 transitions. [2024-06-28 00:21:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 532 transitions, 9753 flow [2024-06-28 00:21:55,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 532 transitions, 9648 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-28 00:21:55,164 INFO L231 Difference]: Finished difference. Result has 246 places, 481 transitions, 8270 flow [2024-06-28 00:21:55,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7301, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8270, PETRI_PLACES=246, PETRI_TRANSITIONS=481} [2024-06-28 00:21:55,165 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places. [2024-06-28 00:21:55,165 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 481 transitions, 8270 flow [2024-06-28 00:21:55,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:55,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:55,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:55,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:21:55,166 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:55,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1577068579, now seen corresponding path program 2 times [2024-06-28 00:21:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731697876] [2024-06-28 00:21:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731697876] [2024-06-28 00:22:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731697876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:03,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:03,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:22:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99887359] [2024-06-28 00:22:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:22:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:22:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:22:03,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:22:03,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 481 transitions, 8270 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:03,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:03,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:22:03,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:06,398 INFO L124 PetriNetUnfolderBase]: 3598/5295 cut-off events. [2024-06-28 00:22:06,399 INFO L125 PetriNetUnfolderBase]: For 292544/292558 co-relation queries the response was YES. [2024-06-28 00:22:06,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53944 conditions, 5295 events. 3598/5295 cut-off events. For 292544/292558 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26515 event pairs, 495 based on Foata normal form. 30/5324 useless extension candidates. Maximal degree in co-relation 53819. Up to 4528 conditions per place. [2024-06-28 00:22:06,461 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 373 selfloop transitions, 151 changer transitions 0/527 dead transitions. [2024-06-28 00:22:06,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 527 transitions, 9986 flow [2024-06-28 00:22:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:22:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:22:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 00:22:06,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-28 00:22:06,462 INFO L175 Difference]: Start difference. First operand has 246 places, 481 transitions, 8270 flow. Second operand 9 states and 153 transitions. [2024-06-28 00:22:06,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 527 transitions, 9986 flow [2024-06-28 00:22:06,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 527 transitions, 9748 flow, removed 107 selfloop flow, removed 3 redundant places. [2024-06-28 00:22:06,920 INFO L231 Difference]: Finished difference. Result has 252 places, 483 transitions, 8424 flow [2024-06-28 00:22:06,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8040, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8424, PETRI_PLACES=252, PETRI_TRANSITIONS=483} [2024-06-28 00:22:06,921 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-28 00:22:06,921 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 483 transitions, 8424 flow [2024-06-28 00:22:06,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:06,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:06,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:06,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:22:06,921 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:06,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash -485870945, now seen corresponding path program 2 times [2024-06-28 00:22:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:06,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53134010] [2024-06-28 00:22:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53134010] [2024-06-28 00:22:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53134010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:22:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892799757] [2024-06-28 00:22:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:13,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:22:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:22:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:22:13,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:22:13,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 483 transitions, 8424 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:13,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:13,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:22:13,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:16,665 INFO L124 PetriNetUnfolderBase]: 3626/5335 cut-off events. [2024-06-28 00:22:16,665 INFO L125 PetriNetUnfolderBase]: For 294509/294523 co-relation queries the response was YES. [2024-06-28 00:22:16,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54619 conditions, 5335 events. 3626/5335 cut-off events. For 294509/294523 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26760 event pairs, 483 based on Foata normal form. 19/5353 useless extension candidates. Maximal degree in co-relation 54492. Up to 4592 conditions per place. [2024-06-28 00:22:16,726 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 366 selfloop transitions, 158 changer transitions 0/527 dead transitions. [2024-06-28 00:22:16,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 527 transitions, 10152 flow [2024-06-28 00:22:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 00:22:16,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-28 00:22:16,728 INFO L175 Difference]: Start difference. First operand has 252 places, 483 transitions, 8424 flow. Second operand 8 states and 145 transitions. [2024-06-28 00:22:16,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 527 transitions, 10152 flow [2024-06-28 00:22:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 527 transitions, 9768 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-06-28 00:22:17,208 INFO L231 Difference]: Finished difference. Result has 253 places, 488 transitions, 8549 flow [2024-06-28 00:22:17,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8040, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8549, PETRI_PLACES=253, PETRI_TRANSITIONS=488} [2024-06-28 00:22:17,209 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places. [2024-06-28 00:22:17,209 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 488 transitions, 8549 flow [2024-06-28 00:22:17,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:17,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:17,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:17,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:22:17,209 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:17,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1813423863, now seen corresponding path program 7 times [2024-06-28 00:22:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258690111] [2024-06-28 00:22:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258690111] [2024-06-28 00:22:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258690111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:22:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428806557] [2024-06-28 00:22:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:24,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:22:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:22:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:22:24,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:22:24,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 488 transitions, 8549 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:24,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:22:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:27,080 INFO L124 PetriNetUnfolderBase]: 3692/5428 cut-off events. [2024-06-28 00:22:27,080 INFO L125 PetriNetUnfolderBase]: For 306831/306845 co-relation queries the response was YES. [2024-06-28 00:22:27,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56281 conditions, 5428 events. 3692/5428 cut-off events. For 306831/306845 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 27251 event pairs, 498 based on Foata normal form. 17/5444 useless extension candidates. Maximal degree in co-relation 56154. Up to 5157 conditions per place. [2024-06-28 00:22:27,154 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 478 selfloop transitions, 69 changer transitions 0/550 dead transitions. [2024-06-28 00:22:27,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 550 transitions, 10299 flow [2024-06-28 00:22:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:22:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:22:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-28 00:22:27,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-28 00:22:27,156 INFO L175 Difference]: Start difference. First operand has 253 places, 488 transitions, 8549 flow. Second operand 9 states and 156 transitions. [2024-06-28 00:22:27,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 550 transitions, 10299 flow [2024-06-28 00:22:27,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 550 transitions, 9860 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-28 00:22:27,701 INFO L231 Difference]: Finished difference. Result has 258 places, 504 transitions, 8615 flow [2024-06-28 00:22:27,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8110, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8615, PETRI_PLACES=258, PETRI_TRANSITIONS=504} [2024-06-28 00:22:27,701 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places. [2024-06-28 00:22:27,701 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 504 transitions, 8615 flow [2024-06-28 00:22:27,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:27,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:27,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:27,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 00:22:27,702 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:27,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash -554841991, now seen corresponding path program 3 times [2024-06-28 00:22:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612837818] [2024-06-28 00:22:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612837818] [2024-06-28 00:22:35,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612837818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:35,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:35,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:22:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417269771] [2024-06-28 00:22:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:35,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:22:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:22:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:22:35,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:22:35,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 504 transitions, 8615 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:35,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:35,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:22:35,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:39,044 INFO L124 PetriNetUnfolderBase]: 3868/5696 cut-off events. [2024-06-28 00:22:39,044 INFO L125 PetriNetUnfolderBase]: For 343550/343564 co-relation queries the response was YES. [2024-06-28 00:22:39,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58622 conditions, 5696 events. 3868/5696 cut-off events. For 343550/343564 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29006 event pairs, 463 based on Foata normal form. 30/5725 useless extension candidates. Maximal degree in co-relation 58493. Up to 4474 conditions per place. [2024-06-28 00:22:39,111 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 385 selfloop transitions, 215 changer transitions 0/603 dead transitions. [2024-06-28 00:22:39,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 603 transitions, 11558 flow [2024-06-28 00:22:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:22:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:22:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-28 00:22:39,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.401330376940133 [2024-06-28 00:22:39,113 INFO L175 Difference]: Start difference. First operand has 258 places, 504 transitions, 8615 flow. Second operand 11 states and 181 transitions. [2024-06-28 00:22:39,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 603 transitions, 11558 flow [2024-06-28 00:22:39,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 603 transitions, 11432 flow, removed 43 selfloop flow, removed 3 redundant places. [2024-06-28 00:22:39,685 INFO L231 Difference]: Finished difference. Result has 270 places, 551 transitions, 10148 flow [2024-06-28 00:22:39,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8489, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10148, PETRI_PLACES=270, PETRI_TRANSITIONS=551} [2024-06-28 00:22:39,686 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-28 00:22:39,686 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 551 transitions, 10148 flow [2024-06-28 00:22:39,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:39,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:39,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:39,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 00:22:39,687 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:39,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash -555087945, now seen corresponding path program 8 times [2024-06-28 00:22:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929147328] [2024-06-28 00:22:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929147328] [2024-06-28 00:22:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929147328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:46,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:46,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:22:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553268450] [2024-06-28 00:22:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:46,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:22:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:22:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:22:46,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:22:46,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 551 transitions, 10148 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:46,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:46,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:22:46,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:49,305 INFO L124 PetriNetUnfolderBase]: 4174/6137 cut-off events. [2024-06-28 00:22:49,305 INFO L125 PetriNetUnfolderBase]: For 422006/422020 co-relation queries the response was YES. [2024-06-28 00:22:49,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67664 conditions, 6137 events. 4174/6137 cut-off events. For 422006/422020 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31599 event pairs, 526 based on Foata normal form. 22/6158 useless extension candidates. Maximal degree in co-relation 67528. Up to 4895 conditions per place. [2024-06-28 00:22:49,391 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 365 selfloop transitions, 281 changer transitions 0/649 dead transitions. [2024-06-28 00:22:49,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 649 transitions, 13097 flow [2024-06-28 00:22:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-28 00:22:49,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 00:22:49,394 INFO L175 Difference]: Start difference. First operand has 270 places, 551 transitions, 10148 flow. Second operand 8 states and 164 transitions. [2024-06-28 00:22:49,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 649 transitions, 13097 flow [2024-06-28 00:22:50,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 649 transitions, 12666 flow, removed 142 selfloop flow, removed 4 redundant places. [2024-06-28 00:22:50,870 INFO L231 Difference]: Finished difference. Result has 276 places, 601 transitions, 11693 flow [2024-06-28 00:22:50,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9717, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11693, PETRI_PLACES=276, PETRI_TRANSITIONS=601} [2024-06-28 00:22:50,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places. [2024-06-28 00:22:50,871 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 601 transitions, 11693 flow [2024-06-28 00:22:50,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:50,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:50,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:50,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 00:22:50,871 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:50,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash -722053001, now seen corresponding path program 9 times [2024-06-28 00:22:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862230275] [2024-06-28 00:22:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862230275] [2024-06-28 00:22:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862230275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:22:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449987485] [2024-06-28 00:22:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:57,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:22:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:22:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:22:57,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:22:57,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 601 transitions, 11693 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:57,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:57,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:22:57,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:00,986 INFO L124 PetriNetUnfolderBase]: 4427/6512 cut-off events. [2024-06-28 00:23:00,986 INFO L125 PetriNetUnfolderBase]: For 472122/472138 co-relation queries the response was YES. [2024-06-28 00:23:01,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76006 conditions, 6512 events. 4427/6512 cut-off events. For 472122/472138 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33960 event pairs, 546 based on Foata normal form. 19/6530 useless extension candidates. Maximal degree in co-relation 75867. Up to 5216 conditions per place. [2024-06-28 00:23:01,076 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 456 selfloop transitions, 227 changer transitions 0/686 dead transitions. [2024-06-28 00:23:01,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 686 transitions, 14432 flow [2024-06-28 00:23:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:23:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:23:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-06-28 00:23:01,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41685144124168516 [2024-06-28 00:23:01,077 INFO L175 Difference]: Start difference. First operand has 276 places, 601 transitions, 11693 flow. Second operand 11 states and 188 transitions. [2024-06-28 00:23:01,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 686 transitions, 14432 flow [2024-06-28 00:23:02,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 686 transitions, 14212 flow, removed 97 selfloop flow, removed 2 redundant places. [2024-06-28 00:23:02,032 INFO L231 Difference]: Finished difference. Result has 287 places, 631 transitions, 12994 flow [2024-06-28 00:23:02,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11510, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12994, PETRI_PLACES=287, PETRI_TRANSITIONS=631} [2024-06-28 00:23:02,033 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-06-28 00:23:02,034 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 631 transitions, 12994 flow [2024-06-28 00:23:02,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:02,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:02,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:23:02,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 00:23:02,034 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:02,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -722046305, now seen corresponding path program 3 times [2024-06-28 00:23:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426261740] [2024-06-28 00:23:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426261740] [2024-06-28 00:23:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426261740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:10,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:10,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:23:10,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326072786] [2024-06-28 00:23:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:10,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:23:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:10,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:23:10,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:23:10,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:23:10,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 631 transitions, 12994 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:10,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:10,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:23:10,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:13,526 INFO L124 PetriNetUnfolderBase]: 4450/6545 cut-off events. [2024-06-28 00:23:13,526 INFO L125 PetriNetUnfolderBase]: For 477719/477737 co-relation queries the response was YES. [2024-06-28 00:23:13,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78383 conditions, 6545 events. 4450/6545 cut-off events. For 477719/477737 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 34103 event pairs, 639 based on Foata normal form. 24/6568 useless extension candidates. Maximal degree in co-relation 78239. Up to 6310 conditions per place. [2024-06-28 00:23:13,613 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 609 selfloop transitions, 65 changer transitions 0/677 dead transitions. [2024-06-28 00:23:13,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 677 transitions, 14935 flow [2024-06-28 00:23:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:23:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:23:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 00:23:13,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3956639566395664 [2024-06-28 00:23:13,615 INFO L175 Difference]: Start difference. First operand has 287 places, 631 transitions, 12994 flow. Second operand 9 states and 146 transitions. [2024-06-28 00:23:13,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 677 transitions, 14935 flow [2024-06-28 00:23:14,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 677 transitions, 14676 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-06-28 00:23:14,682 INFO L231 Difference]: Finished difference. Result has 291 places, 639 transitions, 13196 flow [2024-06-28 00:23:14,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12737, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13196, PETRI_PLACES=291, PETRI_TRANSITIONS=639} [2024-06-28 00:23:14,683 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 249 predicate places. [2024-06-28 00:23:14,683 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 639 transitions, 13196 flow [2024-06-28 00:23:14,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:14,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:14,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:23:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 00:23:14,683 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:14,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1813243939, now seen corresponding path program 4 times [2024-06-28 00:23:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167573579] [2024-06-28 00:23:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:23,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-28 00:23:23,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:23,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167573579] [2024-06-28 00:23:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167573579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:23:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741093422] [2024-06-28 00:23:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:23,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:23:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:23:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:23:23,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:23:23,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 639 transitions, 13196 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:23,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:23,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:23:23,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:27,321 INFO L124 PetriNetUnfolderBase]: 4530/6673 cut-off events. [2024-06-28 00:23:27,321 INFO L125 PetriNetUnfolderBase]: For 510754/510772 co-relation queries the response was YES. [2024-06-28 00:23:27,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80273 conditions, 6673 events. 4530/6673 cut-off events. For 510754/510772 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 34996 event pairs, 649 based on Foata normal form. 34/6706 useless extension candidates. Maximal degree in co-relation 80127. Up to 6401 conditions per place. [2024-06-28 00:23:27,618 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 629 selfloop transitions, 52 changer transitions 0/684 dead transitions. [2024-06-28 00:23:27,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 684 transitions, 15051 flow [2024-06-28 00:23:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:23:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:23:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2024-06-28 00:23:27,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375609756097561 [2024-06-28 00:23:27,621 INFO L175 Difference]: Start difference. First operand has 291 places, 639 transitions, 13196 flow. Second operand 10 states and 154 transitions. [2024-06-28 00:23:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 684 transitions, 15051 flow [2024-06-28 00:23:28,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 684 transitions, 14774 flow, removed 92 selfloop flow, removed 5 redundant places. [2024-06-28 00:23:28,702 INFO L231 Difference]: Finished difference. Result has 296 places, 641 transitions, 13118 flow [2024-06-28 00:23:28,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12919, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13118, PETRI_PLACES=296, PETRI_TRANSITIONS=641} [2024-06-28 00:23:28,703 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-06-28 00:23:28,703 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 641 transitions, 13118 flow [2024-06-28 00:23:28,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:28,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:28,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:23:28,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 00:23:28,703 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1813428637, now seen corresponding path program 5 times [2024-06-28 00:23:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527255647] [2024-06-28 00:23:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527255647] [2024-06-28 00:23:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527255647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:35,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:35,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:23:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797492974] [2024-06-28 00:23:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:35,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:23:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:23:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:23:35,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:23:35,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 641 transitions, 13118 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:35,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:35,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:23:35,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:38,916 INFO L124 PetriNetUnfolderBase]: 4559/6713 cut-off events. [2024-06-28 00:23:38,916 INFO L125 PetriNetUnfolderBase]: For 510453/510471 co-relation queries the response was YES. [2024-06-28 00:23:38,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80822 conditions, 6713 events. 4559/6713 cut-off events. For 510453/510471 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 35221 event pairs, 586 based on Foata normal form. 22/6734 useless extension candidates. Maximal degree in co-relation 80675. Up to 5766 conditions per place. [2024-06-28 00:23:39,008 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 512 selfloop transitions, 181 changer transitions 0/696 dead transitions. [2024-06-28 00:23:39,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 696 transitions, 15153 flow [2024-06-28 00:23:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:23:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:23:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-28 00:23:39,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-28 00:23:39,011 INFO L175 Difference]: Start difference. First operand has 296 places, 641 transitions, 13118 flow. Second operand 8 states and 146 transitions. [2024-06-28 00:23:39,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 696 transitions, 15153 flow [2024-06-28 00:23:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 696 transitions, 14966 flow, removed 42 selfloop flow, removed 9 redundant places. [2024-06-28 00:23:40,234 INFO L231 Difference]: Finished difference. Result has 296 places, 654 transitions, 13827 flow [2024-06-28 00:23:40,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12931, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13827, PETRI_PLACES=296, PETRI_TRANSITIONS=654} [2024-06-28 00:23:40,235 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-06-28 00:23:40,235 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 654 transitions, 13827 flow [2024-06-28 00:23:40,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:40,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:40,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:23:40,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 00:23:40,236 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:40,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -722230631, now seen corresponding path program 10 times [2024-06-28 00:23:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248239719] [2024-06-28 00:23:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248239719] [2024-06-28 00:23:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248239719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:47,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512396506] [2024-06-28 00:23:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:47,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:47,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:23:47,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 654 transitions, 13827 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:47,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:47,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:23:47,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:51,690 INFO L124 PetriNetUnfolderBase]: 4669/6868 cut-off events. [2024-06-28 00:23:51,690 INFO L125 PetriNetUnfolderBase]: For 554733/554751 co-relation queries the response was YES. [2024-06-28 00:23:51,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84961 conditions, 6868 events. 4669/6868 cut-off events. For 554733/554751 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 36062 event pairs, 668 based on Foata normal form. 26/6893 useless extension candidates. Maximal degree in co-relation 84813. Up to 6365 conditions per place. [2024-06-28 00:23:51,781 INFO L140 encePairwiseOnDemand]: 25/41 looper letters, 642 selfloop transitions, 76 changer transitions 0/721 dead transitions. [2024-06-28 00:23:51,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 721 transitions, 16384 flow [2024-06-28 00:23:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:23:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:23:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-28 00:23:51,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924611973392461 [2024-06-28 00:23:51,784 INFO L175 Difference]: Start difference. First operand has 296 places, 654 transitions, 13827 flow. Second operand 11 states and 177 transitions. [2024-06-28 00:23:51,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 721 transitions, 16384 flow [2024-06-28 00:23:52,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 721 transitions, 16300 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-28 00:23:52,855 INFO L231 Difference]: Finished difference. Result has 304 places, 667 transitions, 14360 flow [2024-06-28 00:23:52,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13743, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14360, PETRI_PLACES=304, PETRI_TRANSITIONS=667} [2024-06-28 00:23:52,856 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places. [2024-06-28 00:23:52,856 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 667 transitions, 14360 flow [2024-06-28 00:23:52,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:52,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:52,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:23:52,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 00:23:52,857 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:52,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1281222751, now seen corresponding path program 11 times [2024-06-28 00:23:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:52,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946061159] [2024-06-28 00:23:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946061159] [2024-06-28 00:23:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946061159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896029756] [2024-06-28 00:23:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:59,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:59,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:59,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:59,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:23:59,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 667 transitions, 14360 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:59,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:59,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:23:59,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:03,672 INFO L124 PetriNetUnfolderBase]: 4942/7254 cut-off events. [2024-06-28 00:24:03,672 INFO L125 PetriNetUnfolderBase]: For 603775/603775 co-relation queries the response was YES. [2024-06-28 00:24:03,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91179 conditions, 7254 events. 4942/7254 cut-off events. For 603775/603775 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 38409 event pairs, 648 based on Foata normal form. 10/7263 useless extension candidates. Maximal degree in co-relation 91026. Up to 6667 conditions per place. [2024-06-28 00:24:03,781 INFO L140 encePairwiseOnDemand]: 25/41 looper letters, 606 selfloop transitions, 177 changer transitions 0/786 dead transitions. [2024-06-28 00:24:03,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 786 transitions, 18134 flow [2024-06-28 00:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:24:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:24:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-28 00:24:03,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035476718403548 [2024-06-28 00:24:03,783 INFO L175 Difference]: Start difference. First operand has 304 places, 667 transitions, 14360 flow. Second operand 11 states and 182 transitions. [2024-06-28 00:24:03,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 786 transitions, 18134 flow [2024-06-28 00:24:05,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 786 transitions, 17900 flow, removed 91 selfloop flow, removed 6 redundant places. [2024-06-28 00:24:05,334 INFO L231 Difference]: Finished difference. Result has 312 places, 728 transitions, 16234 flow [2024-06-28 00:24:05,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14130, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16234, PETRI_PLACES=312, PETRI_TRANSITIONS=728} [2024-06-28 00:24:05,335 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 270 predicate places. [2024-06-28 00:24:05,335 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 728 transitions, 16234 flow [2024-06-28 00:24:05,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:05,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:05,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:24:05,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 00:24:05,336 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:05,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1938209247, now seen corresponding path program 4 times [2024-06-28 00:24:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:05,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277726012] [2024-06-28 00:24:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277726012] [2024-06-28 00:24:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277726012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:24:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979985348] [2024-06-28 00:24:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:12,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:24:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:24:12,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:24:12,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:24:12,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 728 transitions, 16234 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:12,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:12,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:24:12,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:16,436 INFO L124 PetriNetUnfolderBase]: 4961/7283 cut-off events. [2024-06-28 00:24:16,436 INFO L125 PetriNetUnfolderBase]: For 620677/620695 co-relation queries the response was YES. [2024-06-28 00:24:16,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93352 conditions, 7283 events. 4961/7283 cut-off events. For 620677/620695 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 38559 event pairs, 656 based on Foata normal form. 30/7312 useless extension candidates. Maximal degree in co-relation 93194. Up to 6400 conditions per place. [2024-06-28 00:24:16,537 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 522 selfloop transitions, 253 changer transitions 0/778 dead transitions. [2024-06-28 00:24:16,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 778 transitions, 18625 flow [2024-06-28 00:24:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:24:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:24:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 00:24:16,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2024-06-28 00:24:16,539 INFO L175 Difference]: Start difference. First operand has 312 places, 728 transitions, 16234 flow. Second operand 9 states and 147 transitions. [2024-06-28 00:24:16,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 778 transitions, 18625 flow [2024-06-28 00:24:18,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 778 transitions, 18148 flow, removed 177 selfloop flow, removed 4 redundant places. [2024-06-28 00:24:18,199 INFO L231 Difference]: Finished difference. Result has 317 places, 740 transitions, 16755 flow [2024-06-28 00:24:18,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=15783, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16755, PETRI_PLACES=317, PETRI_TRANSITIONS=740} [2024-06-28 00:24:18,200 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-28 00:24:18,200 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 740 transitions, 16755 flow [2024-06-28 00:24:18,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:18,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:18,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:24:18,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 00:24:18,200 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:18,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1281042827, now seen corresponding path program 5 times [2024-06-28 00:24:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555553103] [2024-06-28 00:24:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555553103] [2024-06-28 00:24:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555553103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:24:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803368212] [2024-06-28 00:24:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:26,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:24:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:24:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:24:27,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:24:27,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 740 transitions, 16755 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:27,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:27,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:24:27,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:31,383 INFO L124 PetriNetUnfolderBase]: 5013/7369 cut-off events. [2024-06-28 00:24:31,384 INFO L125 PetriNetUnfolderBase]: For 647562/647580 co-relation queries the response was YES. [2024-06-28 00:24:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94755 conditions, 7369 events. 5013/7369 cut-off events. For 647562/647580 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 39201 event pairs, 585 based on Foata normal form. 34/7402 useless extension candidates. Maximal degree in co-relation 94596. Up to 6520 conditions per place. [2024-06-28 00:24:31,491 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 598 selfloop transitions, 184 changer transitions 0/785 dead transitions. [2024-06-28 00:24:31,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 785 transitions, 18992 flow [2024-06-28 00:24:31,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:24:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:24:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-28 00:24:31,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37250554323725055 [2024-06-28 00:24:31,493 INFO L175 Difference]: Start difference. First operand has 317 places, 740 transitions, 16755 flow. Second operand 11 states and 168 transitions. [2024-06-28 00:24:31,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 785 transitions, 18992 flow [2024-06-28 00:24:33,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 785 transitions, 18483 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-28 00:24:33,081 INFO L231 Difference]: Finished difference. Result has 323 places, 744 transitions, 16888 flow [2024-06-28 00:24:33,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=16246, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16888, PETRI_PLACES=323, PETRI_TRANSITIONS=744} [2024-06-28 00:24:33,082 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places. [2024-06-28 00:24:33,082 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 744 transitions, 16888 flow [2024-06-28 00:24:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:33,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:33,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:24:33,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 00:24:33,082 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:33,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 983291786, now seen corresponding path program 1 times [2024-06-28 00:24:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937843763] [2024-06-28 00:24:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937843763] [2024-06-28 00:24:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937843763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973305537] [2024-06-28 00:24:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:40,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:24:40,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 744 transitions, 16888 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:40,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:40,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:24:40,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:45,324 INFO L124 PetriNetUnfolderBase]: 5247/7710 cut-off events. [2024-06-28 00:24:45,324 INFO L125 PetriNetUnfolderBase]: For 683820/683853 co-relation queries the response was YES. [2024-06-28 00:24:45,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100599 conditions, 7710 events. 5247/7710 cut-off events. For 683820/683853 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 41515 event pairs, 544 based on Foata normal form. 25/7734 useless extension candidates. Maximal degree in co-relation 100437. Up to 6534 conditions per place. [2024-06-28 00:24:45,433 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 675 selfloop transitions, 197 changer transitions 0/875 dead transitions. [2024-06-28 00:24:45,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 875 transitions, 21450 flow [2024-06-28 00:24:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:24:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:24:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 00:24:45,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47073170731707314 [2024-06-28 00:24:45,434 INFO L175 Difference]: Start difference. First operand has 323 places, 744 transitions, 16888 flow. Second operand 10 states and 193 transitions. [2024-06-28 00:24:45,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 875 transitions, 21450 flow [2024-06-28 00:24:47,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 875 transitions, 21128 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-28 00:24:47,334 INFO L231 Difference]: Finished difference. Result has 331 places, 795 transitions, 18898 flow [2024-06-28 00:24:47,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=16582, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18898, PETRI_PLACES=331, PETRI_TRANSITIONS=795} [2024-06-28 00:24:47,335 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places. [2024-06-28 00:24:47,335 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 795 transitions, 18898 flow [2024-06-28 00:24:47,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:47,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:47,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:24:47,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 00:24:47,336 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:47,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash -432900376, now seen corresponding path program 2 times [2024-06-28 00:24:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225051991] [2024-06-28 00:24:47,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:55,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:55,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225051991] [2024-06-28 00:24:55,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225051991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:55,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955639275] [2024-06-28 00:24:55,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:55,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:55,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:24:55,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 795 transitions, 18898 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:55,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:55,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:24:55,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:00,788 INFO L124 PetriNetUnfolderBase]: 5886/8695 cut-off events. [2024-06-28 00:25:00,789 INFO L125 PetriNetUnfolderBase]: For 875799/875832 co-relation queries the response was YES. [2024-06-28 00:25:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117538 conditions, 8695 events. 5886/8695 cut-off events. For 875799/875832 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 47985 event pairs, 873 based on Foata normal form. 33/8727 useless extension candidates. Maximal degree in co-relation 117371. Up to 6705 conditions per place. [2024-06-28 00:25:00,930 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 651 selfloop transitions, 258 changer transitions 0/912 dead transitions. [2024-06-28 00:25:00,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 912 transitions, 23086 flow [2024-06-28 00:25:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:25:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:25:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-28 00:25:00,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 00:25:00,932 INFO L175 Difference]: Start difference. First operand has 331 places, 795 transitions, 18898 flow. Second operand 10 states and 205 transitions. [2024-06-28 00:25:00,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 912 transitions, 23086 flow [2024-06-28 00:25:03,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 912 transitions, 22710 flow, removed 173 selfloop flow, removed 2 redundant places. [2024-06-28 00:25:03,422 INFO L231 Difference]: Finished difference. Result has 342 places, 825 transitions, 19985 flow [2024-06-28 00:25:03,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=18606, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19985, PETRI_PLACES=342, PETRI_TRANSITIONS=825} [2024-06-28 00:25:03,423 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 300 predicate places. [2024-06-28 00:25:03,423 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 825 transitions, 19985 flow [2024-06-28 00:25:03,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:03,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:03,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:25:03,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 00:25:03,423 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:03,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash -687779660, now seen corresponding path program 3 times [2024-06-28 00:25:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:03,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659735469] [2024-06-28 00:25:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659735469] [2024-06-28 00:25:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659735469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:11,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:11,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:25:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839882688] [2024-06-28 00:25:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:11,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:25:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:11,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:25:11,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:25:11,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:25:11,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 825 transitions, 19985 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:11,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:11,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:25:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:17,917 INFO L124 PetriNetUnfolderBase]: 6232/9291 cut-off events. [2024-06-28 00:25:17,917 INFO L125 PetriNetUnfolderBase]: For 1065480/1065513 co-relation queries the response was YES. [2024-06-28 00:25:18,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124937 conditions, 9291 events. 6232/9291 cut-off events. For 1065480/1065513 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 52337 event pairs, 1049 based on Foata normal form. 127/9417 useless extension candidates. Maximal degree in co-relation 124765. Up to 7063 conditions per place. [2024-06-28 00:25:18,057 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 632 selfloop transitions, 287 changer transitions 0/922 dead transitions. [2024-06-28 00:25:18,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 922 transitions, 23640 flow [2024-06-28 00:25:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:25:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:25:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 00:25:18,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-28 00:25:18,060 INFO L175 Difference]: Start difference. First operand has 342 places, 825 transitions, 19985 flow. Second operand 11 states and 209 transitions. [2024-06-28 00:25:18,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 922 transitions, 23640 flow [2024-06-28 00:25:20,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 922 transitions, 23432 flow, removed 89 selfloop flow, removed 2 redundant places. [2024-06-28 00:25:20,933 INFO L231 Difference]: Finished difference. Result has 354 places, 840 transitions, 21004 flow [2024-06-28 00:25:20,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=19803, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21004, PETRI_PLACES=354, PETRI_TRANSITIONS=840} [2024-06-28 00:25:20,934 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 312 predicate places. [2024-06-28 00:25:20,934 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 840 transitions, 21004 flow [2024-06-28 00:25:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:20,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:20,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:25:20,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 00:25:20,934 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:20,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1224270242, now seen corresponding path program 4 times [2024-06-28 00:25:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:20,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308823449] [2024-06-28 00:25:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:33,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308823449] [2024-06-28 00:25:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308823449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:33,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:25:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152541464] [2024-06-28 00:25:33,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:33,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:25:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:33,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:25:33,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:25:33,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:25:33,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 840 transitions, 21004 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:33,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:33,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:25:33,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:39,318 INFO L124 PetriNetUnfolderBase]: 6881/10350 cut-off events. [2024-06-28 00:25:39,318 INFO L125 PetriNetUnfolderBase]: For 1222429/1222462 co-relation queries the response was YES. [2024-06-28 00:25:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143054 conditions, 10350 events. 6881/10350 cut-off events. For 1222429/1222462 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 60234 event pairs, 1231 based on Foata normal form. 75/10424 useless extension candidates. Maximal degree in co-relation 142877. Up to 8387 conditions per place. [2024-06-28 00:25:39,487 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 746 selfloop transitions, 178 changer transitions 0/927 dead transitions. [2024-06-28 00:25:39,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 927 transitions, 24640 flow [2024-06-28 00:25:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:25:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:25:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-28 00:25:39,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458980044345898 [2024-06-28 00:25:39,489 INFO L175 Difference]: Start difference. First operand has 354 places, 840 transitions, 21004 flow. Second operand 11 states and 207 transitions. [2024-06-28 00:25:39,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 927 transitions, 24640 flow [2024-06-28 00:25:43,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 927 transitions, 24060 flow, removed 66 selfloop flow, removed 7 redundant places. [2024-06-28 00:25:43,565 INFO L231 Difference]: Finished difference. Result has 359 places, 842 transitions, 20928 flow [2024-06-28 00:25:43,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=20426, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20928, PETRI_PLACES=359, PETRI_TRANSITIONS=842} [2024-06-28 00:25:43,566 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 317 predicate places. [2024-06-28 00:25:43,566 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 842 transitions, 20928 flow [2024-06-28 00:25:43,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:43,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:43,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:25:43,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 00:25:43,566 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:43,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash -346204846, now seen corresponding path program 5 times [2024-06-28 00:25:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:43,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861167042] [2024-06-28 00:25:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:55,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861167042] [2024-06-28 00:25:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861167042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:25:55,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425580191] [2024-06-28 00:25:55,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:55,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:25:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:25:55,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:25:55,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:25:55,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 842 transitions, 20928 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:55,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:55,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:25:55,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:02,449 INFO L124 PetriNetUnfolderBase]: 7318/11090 cut-off events. [2024-06-28 00:26:02,449 INFO L125 PetriNetUnfolderBase]: For 1367138/1367171 co-relation queries the response was YES. [2024-06-28 00:26:02,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150785 conditions, 11090 events. 7318/11090 cut-off events. For 1367138/1367171 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 66072 event pairs, 1555 based on Foata normal form. 119/11208 useless extension candidates. Maximal degree in co-relation 150606. Up to 9167 conditions per place. [2024-06-28 00:26:02,628 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 699 selfloop transitions, 219 changer transitions 0/921 dead transitions. [2024-06-28 00:26:02,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 921 transitions, 24210 flow [2024-06-28 00:26:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:26:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:26:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-28 00:26:02,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523281596452328 [2024-06-28 00:26:02,630 INFO L175 Difference]: Start difference. First operand has 359 places, 842 transitions, 20928 flow. Second operand 11 states and 204 transitions. [2024-06-28 00:26:02,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 921 transitions, 24210 flow [2024-06-28 00:26:06,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 921 transitions, 23970 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-28 00:26:06,159 INFO L231 Difference]: Finished difference. Result has 366 places, 849 transitions, 21500 flow [2024-06-28 00:26:06,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=20688, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21500, PETRI_PLACES=366, PETRI_TRANSITIONS=849} [2024-06-28 00:26:06,160 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 324 predicate places. [2024-06-28 00:26:06,160 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 849 transitions, 21500 flow [2024-06-28 00:26:06,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:06,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:06,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:26:06,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 00:26:06,161 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:06,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1929073622, now seen corresponding path program 6 times [2024-06-28 00:26:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13252689] [2024-06-28 00:26:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13252689] [2024-06-28 00:26:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13252689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:16,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:26:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112187094] [2024-06-28 00:26:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:16,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:26:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:26:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:26:16,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-06-28 00:26:16,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 849 transitions, 21500 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:16,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:16,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-06-28 00:26:16,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:23,663 INFO L124 PetriNetUnfolderBase]: 7470/11354 cut-off events. [2024-06-28 00:26:23,663 INFO L125 PetriNetUnfolderBase]: For 1387546/1387579 co-relation queries the response was YES. [2024-06-28 00:26:23,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155351 conditions, 11354 events. 7470/11354 cut-off events. For 1387546/1387579 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 68201 event pairs, 1721 based on Foata normal form. 83/11436 useless extension candidates. Maximal degree in co-relation 155169. Up to 10175 conditions per place. [2024-06-28 00:26:23,869 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 710 selfloop transitions, 205 changer transitions 0/918 dead transitions. [2024-06-28 00:26:23,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 918 transitions, 24361 flow [2024-06-28 00:26:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:26:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:26:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-06-28 00:26:23,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44124168514412415 [2024-06-28 00:26:23,871 INFO L175 Difference]: Start difference. First operand has 366 places, 849 transitions, 21500 flow. Second operand 11 states and 199 transitions. [2024-06-28 00:26:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 918 transitions, 24361 flow [2024-06-28 00:26:27,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 918 transitions, 23875 flow, removed 99 selfloop flow, removed 6 redundant places. [2024-06-28 00:26:27,445 INFO L231 Difference]: Finished difference. Result has 371 places, 850 transitions, 21520 flow [2024-06-28 00:26:27,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=21014, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21520, PETRI_PLACES=371, PETRI_TRANSITIONS=850} [2024-06-28 00:26:27,446 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 329 predicate places. [2024-06-28 00:26:27,446 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 850 transitions, 21520 flow [2024-06-28 00:26:27,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:27,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:27,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:26:27,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 00:26:27,446 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:27,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1929079574, now seen corresponding path program 1 times [2024-06-28 00:26:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:27,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568444040] [2024-06-28 00:26:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat