./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix005_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix005_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:11:49,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:11:50,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:11:50,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:11:50,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:11:50,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:11:50,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:11:50,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:11:50,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:11:50,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:11:50,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:11:50,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:11:50,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:11:50,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:11:50,073 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:11:50,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:11:50,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:11:50,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:11:50,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:11:50,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:11:50,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:11:50,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:11:50,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:11:50,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:11:50,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:11:50,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:11:50,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:11:50,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:11:50,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:11:50,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:11:50,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:11:50,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:11:50,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:11:50,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:11:50,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:11:50,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:11:50,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:11:50,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:11:50,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:11:50,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:11:50,079 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:11:50,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:11:50,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:11:50,080 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-27 23:11:50,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:11:50,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:11:50,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:11:50,292 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:11:50,293 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:11:50,294 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/mix005_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 23:11:50,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:11:50,380 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:11:50,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:11:51,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:11:51,498 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:11:51,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:11:51,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be8a5d5/1505fca7955a476ea4177239390379b9/FLAG926f2c584 [2024-06-27 23:11:51,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be8a5d5/1505fca7955a476ea4177239390379b9 [2024-06-27 23:11:51,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:11:51,525 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:11:51,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:11:51,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:11:51,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:11:51,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:11:50" (1/2) ... [2024-06-27 23:11:51,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6568628a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:11:51, skipping insertion in model container [2024-06-27 23:11:51,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:11:50" (1/2) ... [2024-06-27 23:11:51,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@633ba8c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:11:51, skipping insertion in model container [2024-06-27 23:11:51,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:11:51" (2/2) ... [2024-06-27 23:11:51,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6568628a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:51, skipping insertion in model container [2024-06-27 23:11:51,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:11:51" (2/2) ... [2024-06-27 23:11:51,536 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:11:51,565 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:11:51,567 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:11:51,567 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:11:51,567 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:11:51,568 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:11:51,568 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:11:51,569 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-27 23:11:51,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:11:51,901 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:11:51,911 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:11:52,162 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:11:52,187 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:11:52,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52 WrapperNode [2024-06-27 23:11:52,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:11:52,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:11:52,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:11:52,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:11:52,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,295 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-06-27 23:11:52,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:11:52,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:11:52,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:11:52,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:11:52,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,359 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 23:11:52,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:11:52,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:11:52,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:11:52,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:11:52,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (1/1) ... [2024-06-27 23:11:52,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:11:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:11:52,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 23:11:52,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 23:11:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:11:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:11:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:11:52,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:11:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:11:52,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:11:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:11:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:11:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:11:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:11:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:11:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:11:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:11:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:11:52,507 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:11:52,655 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:11:52,657 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:11:53,261 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:11:53,261 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:11:53,442 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:11:53,442 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:11:53,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:11:53 BoogieIcfgContainer [2024-06-27 23:11:53,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:11:53,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:11:53,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:11:53,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:11:53,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:11:50" (1/4) ... [2024-06-27 23:11:53,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539fe418 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:11:53, skipping insertion in model container [2024-06-27 23:11:53,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:11:51" (2/4) ... [2024-06-27 23:11:53,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539fe418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:11:53, skipping insertion in model container [2024-06-27 23:11:53,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:11:52" (3/4) ... [2024-06-27 23:11:53,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539fe418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:11:53, skipping insertion in model container [2024-06-27 23:11:53,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:11:53" (4/4) ... [2024-06-27 23:11:53,452 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:11:53,464 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:11:53,465 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:11:53,465 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:11:53,518 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:11:53,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:11:53,589 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:11:53,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:11:53,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:11:53,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:11:53,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:11:53,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:11:53,613 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;@1338eb05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:11:53,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:11:53,627 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:11:53,631 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:11:53,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:11:53,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:53,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:11:53,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:11:53,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash 408787517, now seen corresponding path program 1 times [2024-06-27 23:11:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932948973] [2024-06-27 23:11:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932948973] [2024-06-27 23:11:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932948973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:55,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:11:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954608762] [2024-06-27 23:11:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:55,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:11:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:11:55,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:11:55,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-06-27 23:11:55,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:55,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:55,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-06-27 23:11:55,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:57,220 INFO L124 PetriNetUnfolderBase]: 9587/13493 cut-off events. [2024-06-27 23:11:57,221 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-06-27 23:11:57,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26901 conditions, 13493 events. 9587/13493 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 76037 event pairs, 7462 based on Foata normal form. 1/13170 useless extension candidates. Maximal degree in co-relation 26888. Up to 13017 conditions per place. [2024-06-27 23:11:57,300 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 43 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:11:57,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 231 flow [2024-06-27 23:11:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:11:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:11:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-06-27 23:11:57,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2024-06-27 23:11:57,310 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 100 transitions. [2024-06-27 23:11:57,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 231 flow [2024-06-27 23:11:57,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:11:57,315 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:11:57,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 23:11:57,334 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:11:57,335 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:11:57,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:57,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:57,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:57,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:11:57,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:11:57,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2002836572, now seen corresponding path program 1 times [2024-06-27 23:11:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859997053] [2024-06-27 23:11:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859997053] [2024-06-27 23:11:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859997053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:58,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:11:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661171721] [2024-06-27 23:11:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:58,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:11:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:11:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:11:58,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-06-27 23:11:58,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:58,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:58,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-06-27 23:11:58,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:00,616 INFO L124 PetriNetUnfolderBase]: 9577/13487 cut-off events. [2024-06-27 23:12:00,616 INFO L125 PetriNetUnfolderBase]: For 2586/2586 co-relation queries the response was YES. [2024-06-27 23:12:00,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30336 conditions, 13487 events. 9577/13487 cut-off events. For 2586/2586 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 75961 event pairs, 6775 based on Foata normal form. 4/13350 useless extension candidates. Maximal degree in co-relation 30324. Up to 12982 conditions per place. [2024-06-27 23:12:00,674 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 53 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:12:00,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 323 flow [2024-06-27 23:12:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:12:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:12:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-06-27 23:12:00,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-06-27 23:12:00,676 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 130 transitions. [2024-06-27 23:12:00,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 323 flow [2024-06-27 23:12:00,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:12:00,679 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:12:00,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 23:12:00,680 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:12:00,681 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:12:00,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:00,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:00,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:12:00,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:00,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1958393420, now seen corresponding path program 1 times [2024-06-27 23:12:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023393978] [2024-06-27 23:12:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023393978] [2024-06-27 23:12:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023393978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:01,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:12:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603872388] [2024-06-27 23:12:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:01,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:12:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:12:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:12:02,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-06-27 23:12:02,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:02,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:02,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-06-27 23:12:02,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:03,751 INFO L124 PetriNetUnfolderBase]: 9685/13732 cut-off events. [2024-06-27 23:12:03,751 INFO L125 PetriNetUnfolderBase]: For 7550/7550 co-relation queries the response was YES. [2024-06-27 23:12:03,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34271 conditions, 13732 events. 9685/13732 cut-off events. For 7550/7550 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 78287 event pairs, 5476 based on Foata normal form. 10/13600 useless extension candidates. Maximal degree in co-relation 34257. Up to 12955 conditions per place. [2024-06-27 23:12:03,835 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 73 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2024-06-27 23:12:03,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 547 flow [2024-06-27 23:12:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:12:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:12:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2024-06-27 23:12:03,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6490566037735849 [2024-06-27 23:12:03,841 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 172 transitions. [2024-06-27 23:12:03,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 547 flow [2024-06-27 23:12:03,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 103 transitions, 528 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:12:03,847 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 314 flow [2024-06-27 23:12:03,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-27 23:12:03,848 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:12:03,848 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 314 flow [2024-06-27 23:12:03,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:03,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:03,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:03,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:12:03,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:03,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1190179599, now seen corresponding path program 1 times [2024-06-27 23:12:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203207578] [2024-06-27 23:12:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203207578] [2024-06-27 23:12:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203207578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:05,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:05,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207759904] [2024-06-27 23:12:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:05,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-06-27 23:12:05,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:05,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:05,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-06-27 23:12:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:07,393 INFO L124 PetriNetUnfolderBase]: 9731/13754 cut-off events. [2024-06-27 23:12:07,393 INFO L125 PetriNetUnfolderBase]: For 18161/18164 co-relation queries the response was YES. [2024-06-27 23:12:07,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40663 conditions, 13754 events. 9731/13754 cut-off events. For 18161/18164 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 78085 event pairs, 4552 based on Foata normal form. 10/13648 useless extension candidates. Maximal degree in co-relation 40646. Up to 12877 conditions per place. [2024-06-27 23:12:07,473 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 88 selfloop transitions, 37 changer transitions 0/134 dead transitions. [2024-06-27 23:12:07,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 134 transitions, 858 flow [2024-06-27 23:12:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:12:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:12:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-06-27 23:12:07,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6540880503144654 [2024-06-27 23:12:07,475 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 314 flow. Second operand 6 states and 208 transitions. [2024-06-27 23:12:07,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 134 transitions, 858 flow [2024-06-27 23:12:07,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 134 transitions, 846 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 23:12:07,482 INFO L231 Difference]: Finished difference. Result has 72 places, 82 transitions, 552 flow [2024-06-27 23:12:07,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=72, PETRI_TRANSITIONS=82} [2024-06-27 23:12:07,484 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-06-27 23:12:07,484 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 82 transitions, 552 flow [2024-06-27 23:12:07,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:07,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:07,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:12:07,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:07,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash 820460619, now seen corresponding path program 1 times [2024-06-27 23:12:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968455196] [2024-06-27 23:12:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:09,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968455196] [2024-06-27 23:12:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968455196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359181486] [2024-06-27 23:12:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:09,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-06-27 23:12:09,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 82 transitions, 552 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:09,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:09,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-06-27 23:12:09,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:11,509 INFO L124 PetriNetUnfolderBase]: 9918/14105 cut-off events. [2024-06-27 23:12:11,509 INFO L125 PetriNetUnfolderBase]: For 34218/34225 co-relation queries the response was YES. [2024-06-27 23:12:11,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48068 conditions, 14105 events. 9918/14105 cut-off events. For 34218/34225 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 80758 event pairs, 3760 based on Foata normal form. 40/14039 useless extension candidates. Maximal degree in co-relation 48045. Up to 12878 conditions per place. [2024-06-27 23:12:11,608 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 99 selfloop transitions, 40 changer transitions 0/148 dead transitions. [2024-06-27 23:12:11,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 148 transitions, 1092 flow [2024-06-27 23:12:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2024-06-27 23:12:11,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2024-06-27 23:12:11,610 INFO L175 Difference]: Start difference. First operand has 72 places, 82 transitions, 552 flow. Second operand 7 states and 238 transitions. [2024-06-27 23:12:11,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 148 transitions, 1092 flow [2024-06-27 23:12:11,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 148 transitions, 1070 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-06-27 23:12:11,626 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 647 flow [2024-06-27 23:12:11,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=647, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2024-06-27 23:12:11,627 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2024-06-27 23:12:11,627 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 647 flow [2024-06-27 23:12:11,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:11,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:11,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:11,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:12:11,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:11,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash -411394019, now seen corresponding path program 1 times [2024-06-27 23:12:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199944792] [2024-06-27 23:12:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199944792] [2024-06-27 23:12:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199944792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:13,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:13,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:12:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139091803] [2024-06-27 23:12:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:12:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:12:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:12:13,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:12:13,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 647 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:13,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:13,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:12:13,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:15,293 INFO L124 PetriNetUnfolderBase]: 9900/14072 cut-off events. [2024-06-27 23:12:15,294 INFO L125 PetriNetUnfolderBase]: For 43617/43617 co-relation queries the response was YES. [2024-06-27 23:12:15,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50595 conditions, 14072 events. 9900/14072 cut-off events. For 43617/43617 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 80656 event pairs, 4704 based on Foata normal form. 6/13977 useless extension candidates. Maximal degree in co-relation 50568. Up to 13450 conditions per place. [2024-06-27 23:12:15,385 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 79 selfloop transitions, 15 changer transitions 0/102 dead transitions. [2024-06-27 23:12:15,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 102 transitions, 895 flow [2024-06-27 23:12:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:12:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:12:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-06-27 23:12:15,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056603773584906 [2024-06-27 23:12:15,387 INFO L175 Difference]: Start difference. First operand has 78 places, 84 transitions, 647 flow. Second operand 5 states and 134 transitions. [2024-06-27 23:12:15,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 102 transitions, 895 flow [2024-06-27 23:12:15,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 102 transitions, 796 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:15,414 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 617 flow [2024-06-27 23:12:15,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=617, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2024-06-27 23:12:15,416 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2024-06-27 23:12:15,416 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 617 flow [2024-06-27 23:12:15,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:15,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:15,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:15,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:12:15,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:15,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash -877015526, now seen corresponding path program 1 times [2024-06-27 23:12:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380485755] [2024-06-27 23:12:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380485755] [2024-06-27 23:12:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380485755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249267980] [2024-06-27 23:12:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:17,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:12:17,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:17,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:17,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:12:17,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:19,654 INFO L124 PetriNetUnfolderBase]: 13852/18973 cut-off events. [2024-06-27 23:12:19,654 INFO L125 PetriNetUnfolderBase]: For 66722/66722 co-relation queries the response was YES. [2024-06-27 23:12:19,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69125 conditions, 18973 events. 13852/18973 cut-off events. For 66722/66722 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 102609 event pairs, 6445 based on Foata normal form. 12/18966 useless extension candidates. Maximal degree in co-relation 69094. Up to 18515 conditions per place. [2024-06-27 23:12:19,771 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 100 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-27 23:12:19,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 1160 flow [2024-06-27 23:12:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:12:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:12:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-06-27 23:12:19,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968553459119497 [2024-06-27 23:12:19,773 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 617 flow. Second operand 6 states and 158 transitions. [2024-06-27 23:12:19,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 1160 flow [2024-06-27 23:12:19,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 1130 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:12:19,807 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 845 flow [2024-06-27 23:12:19,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=845, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2024-06-27 23:12:19,808 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 27 predicate places. [2024-06-27 23:12:19,808 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 845 flow [2024-06-27 23:12:19,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:19,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:19,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:19,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:12:19,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:19,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1237411150, now seen corresponding path program 2 times [2024-06-27 23:12:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179460993] [2024-06-27 23:12:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:21,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179460993] [2024-06-27 23:12:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179460993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159024833] [2024-06-27 23:12:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:21,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:21,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:12:21,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 845 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:21,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:21,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:12:21,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:23,887 INFO L124 PetriNetUnfolderBase]: 13822/18934 cut-off events. [2024-06-27 23:12:23,887 INFO L125 PetriNetUnfolderBase]: For 76744/76744 co-relation queries the response was YES. [2024-06-27 23:12:23,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70870 conditions, 18934 events. 13822/18934 cut-off events. For 76744/76744 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 102811 event pairs, 6750 based on Foata normal form. 6/18923 useless extension candidates. Maximal degree in co-relation 70837. Up to 18639 conditions per place. [2024-06-27 23:12:23,987 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 105 selfloop transitions, 16 changer transitions 0/127 dead transitions. [2024-06-27 23:12:23,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 1165 flow [2024-06-27 23:12:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:12:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:12:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 23:12:23,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46855345911949686 [2024-06-27 23:12:23,988 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 845 flow. Second operand 6 states and 149 transitions. [2024-06-27 23:12:23,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 1165 flow [2024-06-27 23:12:24,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 1139 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 23:12:24,031 INFO L231 Difference]: Finished difference. Result has 87 places, 103 transitions, 878 flow [2024-06-27 23:12:24,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=87, PETRI_TRANSITIONS=103} [2024-06-27 23:12:24,032 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 31 predicate places. [2024-06-27 23:12:24,033 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 878 flow [2024-06-27 23:12:24,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:24,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:24,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:12:24,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:24,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1192679774, now seen corresponding path program 3 times [2024-06-27 23:12:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209286391] [2024-06-27 23:12:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209286391] [2024-06-27 23:12:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209286391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663647571] [2024-06-27 23:12:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:25,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:25,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:12:25,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 878 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:25,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:25,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:12:25,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:27,988 INFO L124 PetriNetUnfolderBase]: 10227/14550 cut-off events. [2024-06-27 23:12:27,988 INFO L125 PetriNetUnfolderBase]: For 67056/67056 co-relation queries the response was YES. [2024-06-27 23:12:28,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56210 conditions, 14550 events. 10227/14550 cut-off events. For 67056/67056 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 83065 event pairs, 4466 based on Foata normal form. 6/14445 useless extension candidates. Maximal degree in co-relation 56175. Up to 13648 conditions per place. [2024-06-27 23:12:28,096 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 115 selfloop transitions, 54 changer transitions 0/177 dead transitions. [2024-06-27 23:12:28,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 177 transitions, 1783 flow [2024-06-27 23:12:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-06-27 23:12:28,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175202156334232 [2024-06-27 23:12:28,097 INFO L175 Difference]: Start difference. First operand has 87 places, 103 transitions, 878 flow. Second operand 7 states and 192 transitions. [2024-06-27 23:12:28,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 177 transitions, 1783 flow [2024-06-27 23:12:28,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 177 transitions, 1723 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 23:12:28,136 INFO L231 Difference]: Finished difference. Result has 92 places, 141 transitions, 1451 flow [2024-06-27 23:12:28,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1451, PETRI_PLACES=92, PETRI_TRANSITIONS=141} [2024-06-27 23:12:28,136 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 36 predicate places. [2024-06-27 23:12:28,136 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 141 transitions, 1451 flow [2024-06-27 23:12:28,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:28,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:28,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:28,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:12:28,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:28,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2021224892, now seen corresponding path program 1 times [2024-06-27 23:12:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:28,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564866088] [2024-06-27 23:12:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:30,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564866088] [2024-06-27 23:12:30,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564866088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:30,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:30,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026392337] [2024-06-27 23:12:30,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:30,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:30,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:30,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:30,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:30,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:12:30,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 141 transitions, 1451 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:30,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:30,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:12:30,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:33,335 INFO L124 PetriNetUnfolderBase]: 12531/17743 cut-off events. [2024-06-27 23:12:33,335 INFO L125 PetriNetUnfolderBase]: For 94049/94049 co-relation queries the response was YES. [2024-06-27 23:12:33,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70690 conditions, 17743 events. 12531/17743 cut-off events. For 94049/94049 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 101327 event pairs, 5618 based on Foata normal form. 6/17583 useless extension candidates. Maximal degree in co-relation 70652. Up to 16912 conditions per place. [2024-06-27 23:12:33,432 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 149 selfloop transitions, 24 changer transitions 0/180 dead transitions. [2024-06-27 23:12:33,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 180 transitions, 1977 flow [2024-06-27 23:12:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:12:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:12:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 23:12:33,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-27 23:12:33,433 INFO L175 Difference]: Start difference. First operand has 92 places, 141 transitions, 1451 flow. Second operand 8 states and 192 transitions. [2024-06-27 23:12:33,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 180 transitions, 1977 flow [2024-06-27 23:12:33,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 180 transitions, 1955 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-27 23:12:33,504 INFO L231 Difference]: Finished difference. Result has 100 places, 150 transitions, 1596 flow [2024-06-27 23:12:33,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1596, PETRI_PLACES=100, PETRI_TRANSITIONS=150} [2024-06-27 23:12:33,505 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places. [2024-06-27 23:12:33,505 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 150 transitions, 1596 flow [2024-06-27 23:12:33,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:33,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:33,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:33,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:12:33,506 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:33,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2108077532, now seen corresponding path program 1 times [2024-06-27 23:12:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029684695] [2024-06-27 23:12:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029684695] [2024-06-27 23:12:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029684695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:12:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217707229] [2024-06-27 23:12:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:35,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:12:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:12:35,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:12:35,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:12:35,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 150 transitions, 1596 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:35,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:35,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:12:35,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:38,184 INFO L124 PetriNetUnfolderBase]: 14960/20823 cut-off events. [2024-06-27 23:12:38,184 INFO L125 PetriNetUnfolderBase]: For 128419/128419 co-relation queries the response was YES. [2024-06-27 23:12:38,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86862 conditions, 20823 events. 14960/20823 cut-off events. For 128419/128419 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 115393 event pairs, 7001 based on Foata normal form. 2/20822 useless extension candidates. Maximal degree in co-relation 86820. Up to 20208 conditions per place. [2024-06-27 23:12:38,293 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 149 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2024-06-27 23:12:38,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 167 transitions, 2002 flow [2024-06-27 23:12:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:12:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:12:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-27 23:12:38,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45660377358490567 [2024-06-27 23:12:38,295 INFO L175 Difference]: Start difference. First operand has 100 places, 150 transitions, 1596 flow. Second operand 5 states and 121 transitions. [2024-06-27 23:12:38,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 167 transitions, 2002 flow [2024-06-27 23:12:38,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 167 transitions, 1914 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:38,411 INFO L231 Difference]: Finished difference. Result has 100 places, 154 transitions, 1587 flow [2024-06-27 23:12:38,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1587, PETRI_PLACES=100, PETRI_TRANSITIONS=154} [2024-06-27 23:12:38,412 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places. [2024-06-27 23:12:38,412 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 154 transitions, 1587 flow [2024-06-27 23:12:38,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:38,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:38,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:38,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:12:38,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:38,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1002099335, now seen corresponding path program 1 times [2024-06-27 23:12:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834829954] [2024-06-27 23:12:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834829954] [2024-06-27 23:12:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834829954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:40,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639767630] [2024-06-27 23:12:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:40,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:40,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:12:40,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 154 transitions, 1587 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:40,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:40,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:12:40,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:43,675 INFO L124 PetriNetUnfolderBase]: 14143/20005 cut-off events. [2024-06-27 23:12:43,675 INFO L125 PetriNetUnfolderBase]: For 154592/154617 co-relation queries the response was YES. [2024-06-27 23:12:43,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88896 conditions, 20005 events. 14143/20005 cut-off events. For 154592/154617 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 116868 event pairs, 5886 based on Foata normal form. 12/19849 useless extension candidates. Maximal degree in co-relation 88854. Up to 18469 conditions per place. [2024-06-27 23:12:43,859 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 139 selfloop transitions, 63 changer transitions 0/212 dead transitions. [2024-06-27 23:12:43,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 212 transitions, 2420 flow [2024-06-27 23:12:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-06-27 23:12:43,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363881401617251 [2024-06-27 23:12:43,860 INFO L175 Difference]: Start difference. First operand has 100 places, 154 transitions, 1587 flow. Second operand 7 states and 199 transitions. [2024-06-27 23:12:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 212 transitions, 2420 flow [2024-06-27 23:12:44,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 212 transitions, 2371 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-27 23:12:44,005 INFO L231 Difference]: Finished difference. Result has 106 places, 169 transitions, 1868 flow [2024-06-27 23:12:44,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1868, PETRI_PLACES=106, PETRI_TRANSITIONS=169} [2024-06-27 23:12:44,006 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-27 23:12:44,006 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 169 transitions, 1868 flow [2024-06-27 23:12:44,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:44,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:44,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:44,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:12:44,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:44,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash 354392143, now seen corresponding path program 2 times [2024-06-27 23:12:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22567899] [2024-06-27 23:12:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22567899] [2024-06-27 23:12:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22567899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066872857] [2024-06-27 23:12:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:45,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:46,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:12:46,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 169 transitions, 1868 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:46,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:46,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:12:46,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:49,014 INFO L124 PetriNetUnfolderBase]: 14108/20000 cut-off events. [2024-06-27 23:12:49,014 INFO L125 PetriNetUnfolderBase]: For 184674/184685 co-relation queries the response was YES. [2024-06-27 23:12:49,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94056 conditions, 20000 events. 14108/20000 cut-off events. For 184674/184685 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 117002 event pairs, 5850 based on Foata normal form. 13/19875 useless extension candidates. Maximal degree in co-relation 94011. Up to 18476 conditions per place. [2024-06-27 23:12:49,172 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 138 selfloop transitions, 62 changer transitions 0/210 dead transitions. [2024-06-27 23:12:49,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 210 transitions, 2476 flow [2024-06-27 23:12:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2024-06-27 23:12:49,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148247978436657 [2024-06-27 23:12:49,174 INFO L175 Difference]: Start difference. First operand has 106 places, 169 transitions, 1868 flow. Second operand 7 states and 191 transitions. [2024-06-27 23:12:49,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 210 transitions, 2476 flow [2024-06-27 23:12:49,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 210 transitions, 2401 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-27 23:12:49,362 INFO L231 Difference]: Finished difference. Result has 111 places, 173 transitions, 1991 flow [2024-06-27 23:12:49,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1991, PETRI_PLACES=111, PETRI_TRANSITIONS=173} [2024-06-27 23:12:49,363 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 55 predicate places. [2024-06-27 23:12:49,363 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 173 transitions, 1991 flow [2024-06-27 23:12:49,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:49,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:49,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:49,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:12:49,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:49,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1835780379, now seen corresponding path program 1 times [2024-06-27 23:12:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932872423] [2024-06-27 23:12:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:51,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:51,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932872423] [2024-06-27 23:12:51,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932872423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:51,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:12:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313218095] [2024-06-27 23:12:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:51,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:12:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:12:51,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:12:51,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:12:51,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 173 transitions, 1991 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:51,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:51,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:12:51,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:54,586 INFO L124 PetriNetUnfolderBase]: 15290/21267 cut-off events. [2024-06-27 23:12:54,586 INFO L125 PetriNetUnfolderBase]: For 212421/212421 co-relation queries the response was YES. [2024-06-27 23:12:54,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103671 conditions, 21267 events. 15290/21267 cut-off events. For 212421/212421 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 117766 event pairs, 6868 based on Foata normal form. 3/21267 useless extension candidates. Maximal degree in co-relation 103624. Up to 20533 conditions per place. [2024-06-27 23:12:54,729 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 182 selfloop transitions, 34 changer transitions 0/222 dead transitions. [2024-06-27 23:12:54,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 222 transitions, 2728 flow [2024-06-27 23:12:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:12:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:12:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 23:12:54,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46462264150943394 [2024-06-27 23:12:54,731 INFO L175 Difference]: Start difference. First operand has 111 places, 173 transitions, 1991 flow. Second operand 8 states and 197 transitions. [2024-06-27 23:12:54,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 222 transitions, 2728 flow [2024-06-27 23:12:54,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 222 transitions, 2562 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:54,945 INFO L231 Difference]: Finished difference. Result has 114 places, 181 transitions, 2074 flow [2024-06-27 23:12:54,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1839, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2074, PETRI_PLACES=114, PETRI_TRANSITIONS=181} [2024-06-27 23:12:54,945 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-06-27 23:12:54,945 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 181 transitions, 2074 flow [2024-06-27 23:12:54,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:54,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:54,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:54,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:12:54,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:12:54,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 824796703, now seen corresponding path program 3 times [2024-06-27 23:12:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983540645] [2024-06-27 23:12:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:57,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983540645] [2024-06-27 23:12:57,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983540645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:57,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:57,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508007691] [2024-06-27 23:12:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:57,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:57,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:12:57,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 181 transitions, 2074 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:57,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:57,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:12:57,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:00,365 INFO L124 PetriNetUnfolderBase]: 14253/20142 cut-off events. [2024-06-27 23:13:00,365 INFO L125 PetriNetUnfolderBase]: For 235583/235652 co-relation queries the response was YES. [2024-06-27 23:13:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101225 conditions, 20142 events. 14253/20142 cut-off events. For 235583/235652 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 117608 event pairs, 5720 based on Foata normal form. 41/19999 useless extension candidates. Maximal degree in co-relation 101177. Up to 18111 conditions per place. [2024-06-27 23:13:00,604 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 111 selfloop transitions, 111 changer transitions 0/232 dead transitions. [2024-06-27 23:13:00,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 232 transitions, 2946 flow [2024-06-27 23:13:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-06-27 23:13:00,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633423180592992 [2024-06-27 23:13:00,606 INFO L175 Difference]: Start difference. First operand has 114 places, 181 transitions, 2074 flow. Second operand 7 states and 209 transitions. [2024-06-27 23:13:00,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 232 transitions, 2946 flow [2024-06-27 23:13:00,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 232 transitions, 2819 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 23:13:00,885 INFO L231 Difference]: Finished difference. Result has 115 places, 189 transitions, 2305 flow [2024-06-27 23:13:00,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2305, PETRI_PLACES=115, PETRI_TRANSITIONS=189} [2024-06-27 23:13:00,886 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 59 predicate places. [2024-06-27 23:13:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 189 transitions, 2305 flow [2024-06-27 23:13:00,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:00,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:00,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:00,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:13:00,887 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:00,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 846134623, now seen corresponding path program 4 times [2024-06-27 23:13:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875772079] [2024-06-27 23:13:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:03,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:03,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875772079] [2024-06-27 23:13:03,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875772079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:03,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:03,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:03,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167918814] [2024-06-27 23:13:03,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:03,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:03,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:03,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:13:03,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 189 transitions, 2305 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:03,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:03,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:13:03,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:07,090 INFO L124 PetriNetUnfolderBase]: 14218/20105 cut-off events. [2024-06-27 23:13:07,090 INFO L125 PetriNetUnfolderBase]: For 271254/271303 co-relation queries the response was YES. [2024-06-27 23:13:07,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105891 conditions, 20105 events. 14218/20105 cut-off events. For 271254/271303 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 117500 event pairs, 5785 based on Foata normal form. 33/19959 useless extension candidates. Maximal degree in co-relation 105842. Up to 18334 conditions per place. [2024-06-27 23:13:07,262 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 119 selfloop transitions, 103 changer transitions 0/232 dead transitions. [2024-06-27 23:13:07,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 232 transitions, 3087 flow [2024-06-27 23:13:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-06-27 23:13:07,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555256064690027 [2024-06-27 23:13:07,264 INFO L175 Difference]: Start difference. First operand has 115 places, 189 transitions, 2305 flow. Second operand 7 states and 206 transitions. [2024-06-27 23:13:07,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 232 transitions, 3087 flow [2024-06-27 23:13:07,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 232 transitions, 2905 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:07,558 INFO L231 Difference]: Finished difference. Result has 118 places, 189 transitions, 2365 flow [2024-06-27 23:13:07,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2365, PETRI_PLACES=118, PETRI_TRANSITIONS=189} [2024-06-27 23:13:07,559 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places. [2024-06-27 23:13:07,559 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 189 transitions, 2365 flow [2024-06-27 23:13:07,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:07,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:07,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:07,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:13:07,560 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:07,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1249637861, now seen corresponding path program 2 times [2024-06-27 23:13:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029288423] [2024-06-27 23:13:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029288423] [2024-06-27 23:13:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029288423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:09,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:09,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562258609] [2024-06-27 23:13:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:09,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:10,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:13:10,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 189 transitions, 2365 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:10,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:10,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:13:10,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:13,600 INFO L124 PetriNetUnfolderBase]: 14710/20711 cut-off events. [2024-06-27 23:13:13,600 INFO L125 PetriNetUnfolderBase]: For 255552/255603 co-relation queries the response was YES. [2024-06-27 23:13:13,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107100 conditions, 20711 events. 14710/20711 cut-off events. For 255552/255603 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 117914 event pairs, 5937 based on Foata normal form. 32/20672 useless extension candidates. Maximal degree in co-relation 107050. Up to 18867 conditions per place. [2024-06-27 23:13:13,774 INFO L140 encePairwiseOnDemand]: 35/53 looper letters, 153 selfloop transitions, 123 changer transitions 0/284 dead transitions. [2024-06-27 23:13:13,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 284 transitions, 3764 flow [2024-06-27 23:13:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:13:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:13:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-06-27 23:13:13,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073375262054507 [2024-06-27 23:13:13,777 INFO L175 Difference]: Start difference. First operand has 118 places, 189 transitions, 2365 flow. Second operand 9 states and 242 transitions. [2024-06-27 23:13:13,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 284 transitions, 3764 flow [2024-06-27 23:13:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 284 transitions, 3399 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 23:13:14,102 INFO L231 Difference]: Finished difference. Result has 124 places, 231 transitions, 2988 flow [2024-06-27 23:13:14,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2988, PETRI_PLACES=124, PETRI_TRANSITIONS=231} [2024-06-27 23:13:14,103 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 68 predicate places. [2024-06-27 23:13:14,103 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 231 transitions, 2988 flow [2024-06-27 23:13:14,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:14,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:14,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:14,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:13:14,103 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:14,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -925892868, now seen corresponding path program 1 times [2024-06-27 23:13:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642236841] [2024-06-27 23:13:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:16,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:16,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642236841] [2024-06-27 23:13:16,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642236841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:16,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:16,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277234941] [2024-06-27 23:13:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:16,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:16,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:13:16,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 231 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:16,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:16,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:13:16,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:19,796 INFO L124 PetriNetUnfolderBase]: 15509/21600 cut-off events. [2024-06-27 23:13:19,797 INFO L125 PetriNetUnfolderBase]: For 286361/286361 co-relation queries the response was YES. [2024-06-27 23:13:19,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113005 conditions, 21600 events. 15509/21600 cut-off events. For 286361/286361 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 120142 event pairs, 6893 based on Foata normal form. 4/21601 useless extension candidates. Maximal degree in co-relation 112951. Up to 20934 conditions per place. [2024-06-27 23:13:19,970 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 231 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2024-06-27 23:13:19,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 253 transitions, 3600 flow [2024-06-27 23:13:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:13:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:13:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-27 23:13:19,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44654088050314467 [2024-06-27 23:13:19,971 INFO L175 Difference]: Start difference. First operand has 124 places, 231 transitions, 2988 flow. Second operand 6 states and 142 transitions. [2024-06-27 23:13:19,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 253 transitions, 3600 flow [2024-06-27 23:13:20,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 253 transitions, 3441 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:20,308 INFO L231 Difference]: Finished difference. Result has 126 places, 235 transitions, 2928 flow [2024-06-27 23:13:20,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2829, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2928, PETRI_PLACES=126, PETRI_TRANSITIONS=235} [2024-06-27 23:13:20,309 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2024-06-27 23:13:20,309 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 235 transitions, 2928 flow [2024-06-27 23:13:20,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:20,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:20,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:20,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:13:20,309 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:20,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1000367439, now seen corresponding path program 1 times [2024-06-27 23:13:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145200344] [2024-06-27 23:13:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145200344] [2024-06-27 23:13:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145200344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:22,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:22,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:22,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686645202] [2024-06-27 23:13:22,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:22,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:23,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:13:23,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 235 transitions, 2928 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:23,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:23,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:13:23,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:26,970 INFO L124 PetriNetUnfolderBase]: 15207/21453 cut-off events. [2024-06-27 23:13:26,970 INFO L125 PetriNetUnfolderBase]: For 345341/345388 co-relation queries the response was YES. [2024-06-27 23:13:27,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118655 conditions, 21453 events. 15207/21453 cut-off events. For 345341/345388 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 126088 event pairs, 5550 based on Foata normal form. 46/21200 useless extension candidates. Maximal degree in co-relation 118599. Up to 19104 conditions per place. [2024-06-27 23:13:27,185 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 211 selfloop transitions, 80 changer transitions 0/302 dead transitions. [2024-06-27 23:13:27,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 302 transitions, 4092 flow [2024-06-27 23:13:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 230 transitions. [2024-06-27 23:13:27,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5424528301886793 [2024-06-27 23:13:27,195 INFO L175 Difference]: Start difference. First operand has 126 places, 235 transitions, 2928 flow. Second operand 8 states and 230 transitions. [2024-06-27 23:13:27,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 302 transitions, 4092 flow [2024-06-27 23:13:27,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 302 transitions, 4043 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:27,516 INFO L231 Difference]: Finished difference. Result has 131 places, 242 transitions, 3173 flow [2024-06-27 23:13:27,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2879, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3173, PETRI_PLACES=131, PETRI_TRANSITIONS=242} [2024-06-27 23:13:27,517 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2024-06-27 23:13:27,517 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 242 transitions, 3173 flow [2024-06-27 23:13:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:27,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:27,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:13:27,517 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:27,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1000306989, now seen corresponding path program 2 times [2024-06-27 23:13:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302366611] [2024-06-27 23:13:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302366611] [2024-06-27 23:13:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302366611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123266582] [2024-06-27 23:13:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:29,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:29,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:30,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:13:30,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 242 transitions, 3173 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:30,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:30,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:13:30,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:34,057 INFO L124 PetriNetUnfolderBase]: 15335/21725 cut-off events. [2024-06-27 23:13:34,057 INFO L125 PetriNetUnfolderBase]: For 386631/386666 co-relation queries the response was YES. [2024-06-27 23:13:34,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124070 conditions, 21725 events. 15335/21725 cut-off events. For 386631/386666 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 128402 event pairs, 5850 based on Foata normal form. 44/21537 useless extension candidates. Maximal degree in co-relation 124011. Up to 19898 conditions per place. [2024-06-27 23:13:34,220 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 210 selfloop transitions, 76 changer transitions 0/297 dead transitions. [2024-06-27 23:13:34,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 297 transitions, 4155 flow [2024-06-27 23:13:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-06-27 23:13:34,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283018867924528 [2024-06-27 23:13:34,221 INFO L175 Difference]: Start difference. First operand has 131 places, 242 transitions, 3173 flow. Second operand 8 states and 224 transitions. [2024-06-27 23:13:34,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 297 transitions, 4155 flow [2024-06-27 23:13:34,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 297 transitions, 4049 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:34,566 INFO L231 Difference]: Finished difference. Result has 135 places, 244 transitions, 3279 flow [2024-06-27 23:13:34,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3067, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3279, PETRI_PLACES=135, PETRI_TRANSITIONS=244} [2024-06-27 23:13:34,567 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 79 predicate places. [2024-06-27 23:13:34,567 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 244 transitions, 3279 flow [2024-06-27 23:13:34,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:34,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:34,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:34,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:13:34,568 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:34,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash -997510479, now seen corresponding path program 3 times [2024-06-27 23:13:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:34,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417046508] [2024-06-27 23:13:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417046508] [2024-06-27 23:13:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417046508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156140096] [2024-06-27 23:13:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:37,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:37,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:13:37,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 244 transitions, 3279 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:37,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:37,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:13:37,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:40,955 INFO L124 PetriNetUnfolderBase]: 15966/22352 cut-off events. [2024-06-27 23:13:40,956 INFO L125 PetriNetUnfolderBase]: For 398110/398135 co-relation queries the response was YES. [2024-06-27 23:13:41,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126338 conditions, 22352 events. 15966/22352 cut-off events. For 398110/398135 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 128382 event pairs, 6286 based on Foata normal form. 44/22308 useless extension candidates. Maximal degree in co-relation 126277. Up to 21025 conditions per place. [2024-06-27 23:13:41,190 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 219 selfloop transitions, 66 changer transitions 0/294 dead transitions. [2024-06-27 23:13:41,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 294 transitions, 4117 flow [2024-06-27 23:13:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 23:13:41,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2024-06-27 23:13:41,192 INFO L175 Difference]: Start difference. First operand has 135 places, 244 transitions, 3279 flow. Second operand 8 states and 210 transitions. [2024-06-27 23:13:41,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 294 transitions, 4117 flow [2024-06-27 23:13:41,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 294 transitions, 3929 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 23:13:41,720 INFO L231 Difference]: Finished difference. Result has 138 places, 247 transitions, 3297 flow [2024-06-27 23:13:41,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3095, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3297, PETRI_PLACES=138, PETRI_TRANSITIONS=247} [2024-06-27 23:13:41,721 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 82 predicate places. [2024-06-27 23:13:41,721 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 247 transitions, 3297 flow [2024-06-27 23:13:41,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:41,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:41,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:41,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:13:41,721 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:41,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash -882034611, now seen corresponding path program 1 times [2024-06-27 23:13:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963089649] [2024-06-27 23:13:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963089649] [2024-06-27 23:13:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963089649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:13:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5054735] [2024-06-27 23:13:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:44,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:13:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:13:44,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:13:44,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:13:44,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 247 transitions, 3297 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:44,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:44,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:13:44,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:48,289 INFO L124 PetriNetUnfolderBase]: 15587/22014 cut-off events. [2024-06-27 23:13:48,289 INFO L125 PetriNetUnfolderBase]: For 434908/434911 co-relation queries the response was YES. [2024-06-27 23:13:48,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128297 conditions, 22014 events. 15587/22014 cut-off events. For 434908/434911 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 126901 event pairs, 5874 based on Foata normal form. 14/21895 useless extension candidates. Maximal degree in co-relation 128234. Up to 20317 conditions per place. [2024-06-27 23:13:48,493 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 199 selfloop transitions, 98 changer transitions 0/305 dead transitions. [2024-06-27 23:13:48,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 305 transitions, 4329 flow [2024-06-27 23:13:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 23:13:48,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 23:13:48,494 INFO L175 Difference]: Start difference. First operand has 138 places, 247 transitions, 3297 flow. Second operand 8 states and 212 transitions. [2024-06-27 23:13:48,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 305 transitions, 4329 flow [2024-06-27 23:13:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 305 transitions, 4255 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:49,096 INFO L231 Difference]: Finished difference. Result has 144 places, 260 transitions, 3685 flow [2024-06-27 23:13:49,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3227, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3685, PETRI_PLACES=144, PETRI_TRANSITIONS=260} [2024-06-27 23:13:49,096 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 88 predicate places. [2024-06-27 23:13:49,096 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 260 transitions, 3685 flow [2024-06-27 23:13:49,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:49,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:49,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:49,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:13:49,096 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:49,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1552157835, now seen corresponding path program 1 times [2024-06-27 23:13:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:49,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134195480] [2024-06-27 23:13:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134195480] [2024-06-27 23:13:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134195480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460050916] [2024-06-27 23:13:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:50,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:50,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:51,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:13:51,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 260 transitions, 3685 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:51,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:51,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:13:51,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:55,193 INFO L124 PetriNetUnfolderBase]: 16421/22961 cut-off events. [2024-06-27 23:13:55,193 INFO L125 PetriNetUnfolderBase]: For 463286/463296 co-relation queries the response was YES. [2024-06-27 23:13:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136085 conditions, 22961 events. 16421/22961 cut-off events. For 463286/463296 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 129236 event pairs, 6513 based on Foata normal form. 10/22967 useless extension candidates. Maximal degree in co-relation 136020. Up to 22247 conditions per place. [2024-06-27 23:13:55,414 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 261 selfloop transitions, 26 changer transitions 0/293 dead transitions. [2024-06-27 23:13:55,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 293 transitions, 4561 flow [2024-06-27 23:13:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:13:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:13:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 23:13:55,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46855345911949686 [2024-06-27 23:13:55,415 INFO L175 Difference]: Start difference. First operand has 144 places, 260 transitions, 3685 flow. Second operand 6 states and 149 transitions. [2024-06-27 23:13:55,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 293 transitions, 4561 flow [2024-06-27 23:13:56,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 293 transitions, 4326 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-27 23:13:56,136 INFO L231 Difference]: Finished difference. Result has 146 places, 269 transitions, 3653 flow [2024-06-27 23:13:56,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3450, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3653, PETRI_PLACES=146, PETRI_TRANSITIONS=269} [2024-06-27 23:13:56,137 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 90 predicate places. [2024-06-27 23:13:56,137 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 269 transitions, 3653 flow [2024-06-27 23:13:56,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:56,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:56,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:56,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:13:56,137 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:13:56,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1611373019, now seen corresponding path program 2 times [2024-06-27 23:13:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699757946] [2024-06-27 23:13:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:13:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699757946] [2024-06-27 23:13:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699757946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:13:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166335477] [2024-06-27 23:13:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:58,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:13:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:58,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:13:58,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:13:58,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:13:58,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 269 transitions, 3653 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:58,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:58,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:13:58,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:02,914 INFO L124 PetriNetUnfolderBase]: 15697/22239 cut-off events. [2024-06-27 23:14:02,914 INFO L125 PetriNetUnfolderBase]: For 520400/520400 co-relation queries the response was YES. [2024-06-27 23:14:03,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137864 conditions, 22239 events. 15697/22239 cut-off events. For 520400/520400 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 128781 event pairs, 5968 based on Foata normal form. 6/22119 useless extension candidates. Maximal degree in co-relation 137797. Up to 21019 conditions per place. [2024-06-27 23:14:03,113 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 273 selfloop transitions, 32 changer transitions 0/315 dead transitions. [2024-06-27 23:14:03,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 315 transitions, 4529 flow [2024-06-27 23:14:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 23:14:03,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811320754716981 [2024-06-27 23:14:03,115 INFO L175 Difference]: Start difference. First operand has 146 places, 269 transitions, 3653 flow. Second operand 8 states and 204 transitions. [2024-06-27 23:14:03,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 315 transitions, 4529 flow [2024-06-27 23:14:03,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 315 transitions, 4470 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-06-27 23:14:03,838 INFO L231 Difference]: Finished difference. Result has 152 places, 272 transitions, 3735 flow [2024-06-27 23:14:03,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3594, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3735, PETRI_PLACES=152, PETRI_TRANSITIONS=272} [2024-06-27 23:14:03,838 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 96 predicate places. [2024-06-27 23:14:03,838 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 272 transitions, 3735 flow [2024-06-27 23:14:03,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:14:03,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:03,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:03,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:14:03,839 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:14:03,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1844118067, now seen corresponding path program 1 times [2024-06-27 23:14:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518030942] [2024-06-27 23:14:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat