./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_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-05-21_14-57-05.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/safe029_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_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-76401ed-m [2024-06-20 19:57:54,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:57:54,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:57:54,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:57:54,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:57:55,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:57:55,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:57:55,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:57:55,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:57:55,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:57:55,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:57:55,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:57:55,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:57:55,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:57:55,027 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:57:55,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:57:55,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:57:55,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:57:55,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:57:55,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:57:55,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:57:55,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:57:55,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:57:55,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:57:55,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:57:55,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:57:55,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:57:55,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:57:55,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:57:55,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:57:55,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:57:55,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:57:55,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:57:55,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:57:55,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:57:55,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:57:55,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:57:55,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:57:55,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:57:55,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:57:55,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:57:55,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:57:55,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:57:55,037 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-20 19:57:55,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:57:55,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:57:55,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:57:55,317 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:57:55,317 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:57:55,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-20 19:57:55,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:57:55,511 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:57:55,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-20 19:57:56,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:57:56,970 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:57:56,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-20 19:57:57,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d573a5c/552081c177ec4fe8bb828251ec748e31/FLAG66406376a [2024-06-20 19:57:57,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d573a5c/552081c177ec4fe8bb828251ec748e31 [2024-06-20 19:57:57,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:57:57,020 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:57:57,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:57:57,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:57:57,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:57:57,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:57:55" (1/2) ... [2024-06-20 19:57:57,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d5e12b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:57:57, skipping insertion in model container [2024-06-20 19:57:57,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:57:55" (1/2) ... [2024-06-20 19:57:57,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d56d0bf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:57:57, skipping insertion in model container [2024-06-20 19:57:57,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:57:57" (2/2) ... [2024-06-20 19:57:57,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d5e12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57, skipping insertion in model container [2024-06-20 19:57:57,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:57:57" (2/2) ... [2024-06-20 19:57:57,035 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:57:57,093 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:57:57,095 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-20 19:57:57,095 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-20 19:57:57,096 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:57:57,096 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-20 19:57:57,145 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:57:57,537 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:57:57,550 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:57:57,806 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:57:57,841 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:57:57,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57 WrapperNode [2024-06-20 19:57:57,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:57:57,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:57:57,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:57:57,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:57:57,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:57,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:57,947 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-20 19:57:57,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:57:57,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:57:57,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:57:57,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:57:57,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:57,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:57,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:57,990 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-20 19:57:57,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:57,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:58,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:58,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:58,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:58,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:58,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:57:58,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:57:58,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:57:58,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:57:58,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (1/1) ... [2024-06-20 19:57:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:57:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:57:58,061 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-20 19:57:58,084 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-20 19:57:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:57:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:57:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:57:58,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:57:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:57:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:57:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:57:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:57:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:57:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:57:58,104 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:57:58,242 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:57:58,244 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:57:58,989 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:57:58,990 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:57:59,190 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:57:59,190 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:57:59,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:57:59 BoogieIcfgContainer [2024-06-20 19:57:59,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:57:59,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:57:59,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:57:59,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:57:59,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:57:55" (1/4) ... [2024-06-20 19:57:59,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b414c0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:57:59, skipping insertion in model container [2024-06-20 19:57:59,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:57:57" (2/4) ... [2024-06-20 19:57:59,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b414c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:57:59, skipping insertion in model container [2024-06-20 19:57:59,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:57:57" (3/4) ... [2024-06-20 19:57:59,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b414c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:57:59, skipping insertion in model container [2024-06-20 19:57:59,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:57:59" (4/4) ... [2024-06-20 19:57:59,202 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-20 19:57:59,219 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:57:59,219 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:57:59,219 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:57:59,296 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:57:59,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 66 flow [2024-06-20 19:57:59,366 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-06-20 19:57:59,367 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:57:59,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:57:59,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 29 transitions, 66 flow [2024-06-20 19:57:59,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 21 transitions, 48 flow [2024-06-20 19:57:59,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:57:59,394 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;@39875908, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:57:59,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:57:59,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:57:59,417 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:57:59,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:57:59,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:59,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:57:59,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:57:59,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 321409156, now seen corresponding path program 1 times [2024-06-20 19:57:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672980617] [2024-06-20 19:57:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:58:02,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672980617] [2024-06-20 19:58:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672980617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:58:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665904900] [2024-06-20 19:58:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:02,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:58:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:02,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:58:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:58:02,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:58:02,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:02,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:02,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:58:02,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:03,122 INFO L124 PetriNetUnfolderBase]: 162/296 cut-off events. [2024-06-20 19:58:03,122 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 19:58:03,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 296 events. 162/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1009 event pairs, 97 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 596. Up to 288 conditions per place. [2024-06-20 19:58:03,129 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2024-06-20 19:58:03,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 111 flow [2024-06-20 19:58:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:58:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:58:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-06-20 19:58:03,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2024-06-20 19:58:03,144 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 48 flow. Second operand 3 states and 47 transitions. [2024-06-20 19:58:03,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 111 flow [2024-06-20 19:58:03,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:58:03,149 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 67 flow [2024-06-20 19:58:03,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-06-20 19:58:03,154 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2024-06-20 19:58:03,155 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 67 flow [2024-06-20 19:58:03,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:03,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:03,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:58:03,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:03,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -363415325, now seen corresponding path program 1 times [2024-06-20 19:58:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001023848] [2024-06-20 19:58:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:05,525 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-20 19:58:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001023848] [2024-06-20 19:58:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001023848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:05,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:58:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551287789] [2024-06-20 19:58:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:05,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:58:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:05,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:58:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:58:05,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:58:05,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:05,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:05,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:58:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:05,783 INFO L124 PetriNetUnfolderBase]: 159/291 cut-off events. [2024-06-20 19:58:05,783 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-20 19:58:05,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 291 events. 159/291 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 991 event pairs, 79 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 667. Up to 274 conditions per place. [2024-06-20 19:58:05,790 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2024-06-20 19:58:05,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 153 flow [2024-06-20 19:58:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:58:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:58:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-06-20 19:58:05,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-06-20 19:58:05,794 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 67 flow. Second operand 4 states and 60 transitions. [2024-06-20 19:58:05,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 153 flow [2024-06-20 19:58:05,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:58:05,799 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 91 flow [2024-06-20 19:58:05,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2024-06-20 19:58:05,800 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2024-06-20 19:58:05,801 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 91 flow [2024-06-20 19:58:05,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:05,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:05,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:05,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:58:05,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:05,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:05,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1619027845, now seen corresponding path program 1 times [2024-06-20 19:58:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:05,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043614307] [2024-06-20 19:58:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:05,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:07,912 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-20 19:58:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043614307] [2024-06-20 19:58:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043614307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:07,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:07,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:58:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172860971] [2024-06-20 19:58:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:07,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:58:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:58:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:58:07,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:58:07,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:07,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:07,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:58:07,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:08,152 INFO L124 PetriNetUnfolderBase]: 160/293 cut-off events. [2024-06-20 19:58:08,153 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-06-20 19:58:08,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 293 events. 160/293 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1015 event pairs, 56 based on Foata normal form. 3/295 useless extension candidates. Maximal degree in co-relation 744. Up to 248 conditions per place. [2024-06-20 19:58:08,155 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 33 selfloop transitions, 11 changer transitions 0/47 dead transitions. [2024-06-20 19:58:08,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 245 flow [2024-06-20 19:58:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:58:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:58:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-20 19:58:08,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-06-20 19:58:08,157 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 91 flow. Second operand 5 states and 79 transitions. [2024-06-20 19:58:08,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 245 flow [2024-06-20 19:58:08,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 236 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 19:58:08,160 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 158 flow [2024-06-20 19:58:08,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2024-06-20 19:58:08,161 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2024-06-20 19:58:08,161 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 158 flow [2024-06-20 19:58:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:08,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:08,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:08,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:58:08,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:08,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash -934158844, now seen corresponding path program 1 times [2024-06-20 19:58:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614428979] [2024-06-20 19:58:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:10,748 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-20 19:58:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614428979] [2024-06-20 19:58:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614428979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:10,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:58:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189103894] [2024-06-20 19:58:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:10,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:58:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:58:10,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:58:10,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:58:10,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:10,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:10,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:58:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:11,077 INFO L124 PetriNetUnfolderBase]: 161/295 cut-off events. [2024-06-20 19:58:11,079 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2024-06-20 19:58:11,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 295 events. 161/295 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1012 event pairs, 38 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 903. Up to 237 conditions per place. [2024-06-20 19:58:11,083 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 37 selfloop transitions, 14 changer transitions 0/54 dead transitions. [2024-06-20 19:58:11,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 330 flow [2024-06-20 19:58:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:58:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:58:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-06-20 19:58:11,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-06-20 19:58:11,088 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 158 flow. Second operand 6 states and 93 transitions. [2024-06-20 19:58:11,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 330 flow [2024-06-20 19:58:11,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 326 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-20 19:58:11,095 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 210 flow [2024-06-20 19:58:11,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-20 19:58:11,097 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2024-06-20 19:58:11,097 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 210 flow [2024-06-20 19:58:11,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:11,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:11,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:11,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:58:11,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:11,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1107631940, now seen corresponding path program 1 times [2024-06-20 19:58:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498704801] [2024-06-20 19:58:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:11,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:13,610 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-20 19:58:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498704801] [2024-06-20 19:58:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498704801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:58:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742554645] [2024-06-20 19:58:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:58:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:58:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:58:13,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:58:13,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:13,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:13,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:58:13,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:14,071 INFO L124 PetriNetUnfolderBase]: 199/377 cut-off events. [2024-06-20 19:58:14,072 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2024-06-20 19:58:14,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 377 events. 199/377 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1466 event pairs, 27 based on Foata normal form. 18/394 useless extension candidates. Maximal degree in co-relation 1208. Up to 172 conditions per place. [2024-06-20 19:58:14,075 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 49 selfloop transitions, 22 changer transitions 0/74 dead transitions. [2024-06-20 19:58:14,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 472 flow [2024-06-20 19:58:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-20 19:58:14,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-20 19:58:14,078 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 210 flow. Second operand 7 states and 116 transitions. [2024-06-20 19:58:14,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 472 flow [2024-06-20 19:58:14,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 440 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-20 19:58:14,085 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 297 flow [2024-06-20 19:58:14,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-06-20 19:58:14,092 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 20 predicate places. [2024-06-20 19:58:14,092 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 297 flow [2024-06-20 19:58:14,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:14,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:14,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:14,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:58:14,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:14,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 517624212, now seen corresponding path program 1 times [2024-06-20 19:58:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844646286] [2024-06-20 19:58:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:18,084 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-20 19:58:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844646286] [2024-06-20 19:58:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844646286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:18,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:58:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338604877] [2024-06-20 19:58:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:58:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:58:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:58:18,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:18,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:18,410 INFO L124 PetriNetUnfolderBase]: 197/374 cut-off events. [2024-06-20 19:58:18,410 INFO L125 PetriNetUnfolderBase]: For 992/992 co-relation queries the response was YES. [2024-06-20 19:58:18,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 374 events. 197/374 cut-off events. For 992/992 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1471 event pairs, 58 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 1436. Up to 363 conditions per place. [2024-06-20 19:58:18,414 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-20 19:58:18,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 407 flow [2024-06-20 19:58:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:58:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:58:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2024-06-20 19:58:18,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36551724137931035 [2024-06-20 19:58:18,416 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 297 flow. Second operand 5 states and 53 transitions. [2024-06-20 19:58:18,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 407 flow [2024-06-20 19:58:18,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 395 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-20 19:58:18,420 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 302 flow [2024-06-20 19:58:18,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-20 19:58:18,423 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 25 predicate places. [2024-06-20 19:58:18,423 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 302 flow [2024-06-20 19:58:18,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:18,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:18,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:18,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:58:18,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:18,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1134382894, now seen corresponding path program 1 times [2024-06-20 19:58:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666372765] [2024-06-20 19:58:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:58:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666372765] [2024-06-20 19:58:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666372765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:58:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084775576] [2024-06-20 19:58:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:58:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:58:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:58:22,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:22,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:22,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:22,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:22,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:22,829 INFO L124 PetriNetUnfolderBase]: 193/368 cut-off events. [2024-06-20 19:58:22,829 INFO L125 PetriNetUnfolderBase]: For 1144/1144 co-relation queries the response was YES. [2024-06-20 19:58:22,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 368 events. 193/368 cut-off events. For 1144/1144 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1433 event pairs, 56 based on Foata normal form. 2/369 useless extension candidates. Maximal degree in co-relation 1416. Up to 351 conditions per place. [2024-06-20 19:58:22,832 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 43 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2024-06-20 19:58:22,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 420 flow [2024-06-20 19:58:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:58:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:58:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2024-06-20 19:58:22,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3563218390804598 [2024-06-20 19:58:22,834 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 302 flow. Second operand 6 states and 62 transitions. [2024-06-20 19:58:22,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 420 flow [2024-06-20 19:58:22,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 405 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-20 19:58:22,838 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 308 flow [2024-06-20 19:58:22,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-20 19:58:22,840 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 27 predicate places. [2024-06-20 19:58:22,840 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 308 flow [2024-06-20 19:58:22,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:22,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:22,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:22,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:58:22,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:22,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1615315823, now seen corresponding path program 1 times [2024-06-20 19:58:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:22,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332969573] [2024-06-20 19:58:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:25,840 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-20 19:58:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332969573] [2024-06-20 19:58:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332969573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:58:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99213570] [2024-06-20 19:58:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:25,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:58:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:58:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:58:25,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:25,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:25,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:25,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:25,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:26,116 INFO L124 PetriNetUnfolderBase]: 194/370 cut-off events. [2024-06-20 19:58:26,116 INFO L125 PetriNetUnfolderBase]: For 1314/1314 co-relation queries the response was YES. [2024-06-20 19:58:26,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 370 events. 194/370 cut-off events. For 1314/1314 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1442 event pairs, 55 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 1461. Up to 325 conditions per place. [2024-06-20 19:58:26,120 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 43 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2024-06-20 19:58:26,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 476 flow [2024-06-20 19:58:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:58:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:58:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-20 19:58:26,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-06-20 19:58:26,121 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 308 flow. Second operand 6 states and 69 transitions. [2024-06-20 19:58:26,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 476 flow [2024-06-20 19:58:26,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 450 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:58:26,126 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 333 flow [2024-06-20 19:58:26,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-20 19:58:26,126 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 27 predicate places. [2024-06-20 19:58:26,127 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 333 flow [2024-06-20 19:58:26,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:26,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:26,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:26,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:58:26,127 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:26,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash -779326733, now seen corresponding path program 2 times [2024-06-20 19:58:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:26,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034062687] [2024-06-20 19:58:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:58:29,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:29,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034062687] [2024-06-20 19:58:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034062687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:29,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:58:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603698719] [2024-06-20 19:58:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:29,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:58:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:58:29,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:58:29,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:29,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:29,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:29,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:29,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:29,351 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-20 19:58:29,351 INFO L125 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2024-06-20 19:58:29,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 360 events. 189/360 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1386 event pairs, 54 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1445. Up to 346 conditions per place. [2024-06-20 19:58:29,354 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 44 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-06-20 19:58:29,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 451 flow [2024-06-20 19:58:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:58:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:58:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2024-06-20 19:58:29,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3505747126436782 [2024-06-20 19:58:29,357 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 333 flow. Second operand 6 states and 61 transitions. [2024-06-20 19:58:29,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 451 flow [2024-06-20 19:58:29,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 436 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 19:58:29,361 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 339 flow [2024-06-20 19:58:29,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-06-20 19:58:29,363 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 30 predicate places. [2024-06-20 19:58:29,363 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 339 flow [2024-06-20 19:58:29,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:29,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:29,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:29,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:58:29,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:29,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817657, now seen corresponding path program 1 times [2024-06-20 19:58:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996410479] [2024-06-20 19:58:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:32,779 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-20 19:58:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:32,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996410479] [2024-06-20 19:58:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996410479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:32,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110666483] [2024-06-20 19:58:32,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:32,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:32,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:32,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:32,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 339 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:32,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:32,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:32,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:33,075 INFO L124 PetriNetUnfolderBase]: 209/394 cut-off events. [2024-06-20 19:58:33,075 INFO L125 PetriNetUnfolderBase]: For 1984/1984 co-relation queries the response was YES. [2024-06-20 19:58:33,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 394 events. 209/394 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1541 event pairs, 42 based on Foata normal form. 6/399 useless extension candidates. Maximal degree in co-relation 1580. Up to 244 conditions per place. [2024-06-20 19:58:33,078 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 45 selfloop transitions, 26 changer transitions 0/73 dead transitions. [2024-06-20 19:58:33,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 609 flow [2024-06-20 19:58:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-20 19:58:33,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43842364532019706 [2024-06-20 19:58:33,080 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 339 flow. Second operand 7 states and 89 transitions. [2024-06-20 19:58:33,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 609 flow [2024-06-20 19:58:33,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 575 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:58:33,085 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 435 flow [2024-06-20 19:58:33,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=435, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-20 19:58:33,086 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 32 predicate places. [2024-06-20 19:58:33,086 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 435 flow [2024-06-20 19:58:33,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:33,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:33,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:33,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:58:33,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:33,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1610675671, now seen corresponding path program 2 times [2024-06-20 19:58:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191070550] [2024-06-20 19:58:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:35,973 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-20 19:58:35,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:35,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191070550] [2024-06-20 19:58:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191070550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:35,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:35,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953844531] [2024-06-20 19:58:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:36,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:36,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 435 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:36,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:36,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:36,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:36,262 INFO L124 PetriNetUnfolderBase]: 215/404 cut-off events. [2024-06-20 19:58:36,263 INFO L125 PetriNetUnfolderBase]: For 2176/2176 co-relation queries the response was YES. [2024-06-20 19:58:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 404 events. 215/404 cut-off events. For 2176/2176 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1585 event pairs, 48 based on Foata normal form. 2/405 useless extension candidates. Maximal degree in co-relation 1782. Up to 367 conditions per place. [2024-06-20 19:58:36,266 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 55 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-06-20 19:58:36,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 635 flow [2024-06-20 19:58:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-20 19:58:36,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3694581280788177 [2024-06-20 19:58:36,268 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 435 flow. Second operand 7 states and 75 transitions. [2024-06-20 19:58:36,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 635 flow [2024-06-20 19:58:36,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 618 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-20 19:58:36,273 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 467 flow [2024-06-20 19:58:36,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=467, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-06-20 19:58:36,274 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 37 predicate places. [2024-06-20 19:58:36,274 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 467 flow [2024-06-20 19:58:36,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:36,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:36,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:36,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:58:36,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:36,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1642186327, now seen corresponding path program 3 times [2024-06-20 19:58:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:36,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332952266] [2024-06-20 19:58:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:39,021 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-20 19:58:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332952266] [2024-06-20 19:58:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332952266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:39,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578781183] [2024-06-20 19:58:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:39,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:39,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:39,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:39,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:39,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 467 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:39,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:39,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:39,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:39,318 INFO L124 PetriNetUnfolderBase]: 216/406 cut-off events. [2024-06-20 19:58:39,319 INFO L125 PetriNetUnfolderBase]: For 2445/2445 co-relation queries the response was YES. [2024-06-20 19:58:39,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 406 events. 216/406 cut-off events. For 2445/2445 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1594 event pairs, 48 based on Foata normal form. 2/407 useless extension candidates. Maximal degree in co-relation 1831. Up to 383 conditions per place. [2024-06-20 19:58:39,322 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 57 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2024-06-20 19:58:39,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 657 flow [2024-06-20 19:58:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2024-06-20 19:58:39,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3497536945812808 [2024-06-20 19:58:39,325 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 467 flow. Second operand 7 states and 71 transitions. [2024-06-20 19:58:39,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 657 flow [2024-06-20 19:58:39,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 631 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 19:58:39,331 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 513 flow [2024-06-20 19:58:39,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-06-20 19:58:39,332 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 41 predicate places. [2024-06-20 19:58:39,332 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 513 flow [2024-06-20 19:58:39,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:39,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:39,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:39,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:58:39,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:39,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 779752849, now seen corresponding path program 1 times [2024-06-20 19:58:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882175984] [2024-06-20 19:58:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:42,729 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-20 19:58:42,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882175984] [2024-06-20 19:58:42,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882175984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:42,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:42,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925013828] [2024-06-20 19:58:42,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:42,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:42,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:42,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:42,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:42,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 513 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:42,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:42,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:42,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:43,082 INFO L124 PetriNetUnfolderBase]: 213/401 cut-off events. [2024-06-20 19:58:43,082 INFO L125 PetriNetUnfolderBase]: For 2624/2624 co-relation queries the response was YES. [2024-06-20 19:58:43,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 401 events. 213/401 cut-off events. For 2624/2624 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1553 event pairs, 47 based on Foata normal form. 2/402 useless extension candidates. Maximal degree in co-relation 1852. Up to 378 conditions per place. [2024-06-20 19:58:43,086 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 59 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-06-20 19:58:43,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 669 flow [2024-06-20 19:58:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2024-06-20 19:58:43,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3399014778325123 [2024-06-20 19:58:43,087 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 513 flow. Second operand 7 states and 69 transitions. [2024-06-20 19:58:43,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 669 flow [2024-06-20 19:58:43,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 651 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-20 19:58:43,095 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 519 flow [2024-06-20 19:58:43,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=519, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2024-06-20 19:58:43,095 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 45 predicate places. [2024-06-20 19:58:43,096 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 519 flow [2024-06-20 19:58:43,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:43,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:43,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:43,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:58:43,097 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:43,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1839107472, now seen corresponding path program 1 times [2024-06-20 19:58:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258834820] [2024-06-20 19:58:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:58:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258834820] [2024-06-20 19:58:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258834820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487742534] [2024-06-20 19:58:46,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:46,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:46,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:46,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 519 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:46,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:46,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:46,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:46,893 INFO L124 PetriNetUnfolderBase]: 209/394 cut-off events. [2024-06-20 19:58:46,894 INFO L125 PetriNetUnfolderBase]: For 2776/2776 co-relation queries the response was YES. [2024-06-20 19:58:46,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 394 events. 209/394 cut-off events. For 2776/2776 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1531 event pairs, 47 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1827. Up to 334 conditions per place. [2024-06-20 19:58:46,898 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 58 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2024-06-20 19:58:46,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 714 flow [2024-06-20 19:58:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:58:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:58:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 19:58:46,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2024-06-20 19:58:46,900 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 519 flow. Second operand 8 states and 88 transitions. [2024-06-20 19:58:46,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 714 flow [2024-06-20 19:58:46,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 686 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:58:46,907 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 544 flow [2024-06-20 19:58:46,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-06-20 19:58:46,908 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 47 predicate places. [2024-06-20 19:58:46,908 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 544 flow [2024-06-20 19:58:46,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:46,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:46,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:46,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:58:46,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:46,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash 798945655, now seen corresponding path program 1 times [2024-06-20 19:58:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268474410] [2024-06-20 19:58:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:49,800 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-20 19:58:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268474410] [2024-06-20 19:58:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268474410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572350824] [2024-06-20 19:58:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:49,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:49,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:49,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 544 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:49,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:49,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:50,128 INFO L124 PetriNetUnfolderBase]: 211/398 cut-off events. [2024-06-20 19:58:50,129 INFO L125 PetriNetUnfolderBase]: For 3244/3244 co-relation queries the response was YES. [2024-06-20 19:58:50,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 398 events. 211/398 cut-off events. For 3244/3244 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1551 event pairs, 38 based on Foata normal form. 4/401 useless extension candidates. Maximal degree in co-relation 1850. Up to 238 conditions per place. [2024-06-20 19:58:50,132 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 47 selfloop transitions, 34 changer transitions 1/84 dead transitions. [2024-06-20 19:58:50,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 84 transitions, 829 flow [2024-06-20 19:58:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-20 19:58:50,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-06-20 19:58:50,135 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 544 flow. Second operand 7 states and 91 transitions. [2024-06-20 19:58:50,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 84 transitions, 829 flow [2024-06-20 19:58:50,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 787 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:58:50,147 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 585 flow [2024-06-20 19:58:50,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-20 19:58:50,148 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2024-06-20 19:58:50,148 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 585 flow [2024-06-20 19:58:50,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:50,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:50,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:58:50,149 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:50,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1804395233, now seen corresponding path program 2 times [2024-06-20 19:58:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:50,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989637200] [2024-06-20 19:58:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:58:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989637200] [2024-06-20 19:58:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989637200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350952087] [2024-06-20 19:58:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:52,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:52,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:52,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:53,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:53,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 585 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:53,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:53,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:53,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:53,306 INFO L124 PetriNetUnfolderBase]: 213/404 cut-off events. [2024-06-20 19:58:53,306 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2024-06-20 19:58:53,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 404 events. 213/404 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1590 event pairs, 36 based on Foata normal form. 2/405 useless extension candidates. Maximal degree in co-relation 1956. Up to 240 conditions per place. [2024-06-20 19:58:53,310 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 46 selfloop transitions, 32 changer transitions 1/81 dead transitions. [2024-06-20 19:58:53,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 830 flow [2024-06-20 19:58:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:58:53,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4187192118226601 [2024-06-20 19:58:53,311 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 585 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:58:53,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 830 flow [2024-06-20 19:58:53,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 757 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 19:58:53,320 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 591 flow [2024-06-20 19:58:53,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-20 19:58:53,320 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 50 predicate places. [2024-06-20 19:58:53,321 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 591 flow [2024-06-20 19:58:53,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:53,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:53,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:53,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:58:53,321 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:53,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:53,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1601042542, now seen corresponding path program 1 times [2024-06-20 19:58:53,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:53,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880557178] [2024-06-20 19:58:53,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:58:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880557178] [2024-06-20 19:58:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880557178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:58:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523220822] [2024-06-20 19:58:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:56,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:58:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:56,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:58:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:58:56,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:56,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 591 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:56,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:56,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:56,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:56,517 INFO L124 PetriNetUnfolderBase]: 207/397 cut-off events. [2024-06-20 19:58:56,517 INFO L125 PetriNetUnfolderBase]: For 3538/3538 co-relation queries the response was YES. [2024-06-20 19:58:56,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 397 events. 207/397 cut-off events. For 3538/3538 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1566 event pairs, 37 based on Foata normal form. 1/397 useless extension candidates. Maximal degree in co-relation 1925. Up to 371 conditions per place. [2024-06-20 19:58:56,521 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 59 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2024-06-20 19:58:56,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 755 flow [2024-06-20 19:58:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2024-06-20 19:58:56,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3497536945812808 [2024-06-20 19:58:56,522 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 591 flow. Second operand 7 states and 71 transitions. [2024-06-20 19:58:56,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 755 flow [2024-06-20 19:58:56,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 74 transitions, 709 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:58:56,531 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 579 flow [2024-06-20 19:58:56,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-06-20 19:58:56,531 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 53 predicate places. [2024-06-20 19:58:56,531 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 579 flow [2024-06-20 19:58:56,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:58:56,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:56,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:56,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:58:56,532 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:56,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1604891633, now seen corresponding path program 3 times [2024-06-20 19:58:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802247355] [2024-06-20 19:58:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:58:59,351 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-20 19:58:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:58:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802247355] [2024-06-20 19:58:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802247355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:58:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:58:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:58:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786392998] [2024-06-20 19:58:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:58:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:58:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:58:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:58:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:58:59,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:58:59,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:59,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:58:59,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:58:59,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:58:59,665 INFO L124 PetriNetUnfolderBase]: 206/394 cut-off events. [2024-06-20 19:58:59,665 INFO L125 PetriNetUnfolderBase]: For 3860/3860 co-relation queries the response was YES. [2024-06-20 19:58:59,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 394 events. 206/394 cut-off events. For 3860/3860 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1539 event pairs, 39 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 1884. Up to 363 conditions per place. [2024-06-20 19:58:59,668 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 62 selfloop transitions, 12 changer transitions 1/77 dead transitions. [2024-06-20 19:58:59,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 77 transitions, 771 flow [2024-06-20 19:58:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:58:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:58:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-20 19:58:59,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35960591133004927 [2024-06-20 19:58:59,670 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 579 flow. Second operand 7 states and 73 transitions. [2024-06-20 19:58:59,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 77 transitions, 771 flow [2024-06-20 19:58:59,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 729 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:58:59,680 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 576 flow [2024-06-20 19:58:59,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-06-20 19:58:59,681 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 53 predicate places. [2024-06-20 19:58:59,681 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 576 flow [2024-06-20 19:58:59,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-20 19:58:59,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:58:59,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:58:59,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:58:59,682 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:58:59,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:58:59,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1177816740, now seen corresponding path program 1 times [2024-06-20 19:58:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:58:59,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447415804] [2024-06-20 19:58:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:58:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:58:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:02,882 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-20 19:59:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:02,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447415804] [2024-06-20 19:59:02,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447415804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:02,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868127711] [2024-06-20 19:59:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:02,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:02,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:02,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 576 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:02,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:02,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:02,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:03,257 INFO L124 PetriNetUnfolderBase]: 228/444 cut-off events. [2024-06-20 19:59:03,257 INFO L125 PetriNetUnfolderBase]: For 5545/5545 co-relation queries the response was YES. [2024-06-20 19:59:03,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 444 events. 228/444 cut-off events. For 5545/5545 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1848 event pairs, 36 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2171. Up to 153 conditions per place. [2024-06-20 19:59:03,262 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 60 selfloop transitions, 31 changer transitions 0/93 dead transitions. [2024-06-20 19:59:03,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 93 transitions, 948 flow [2024-06-20 19:59:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-20 19:59:03,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267241379310345 [2024-06-20 19:59:03,265 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 576 flow. Second operand 8 states and 99 transitions. [2024-06-20 19:59:03,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 93 transitions, 948 flow [2024-06-20 19:59:03,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 93 transitions, 926 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-20 19:59:03,276 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 630 flow [2024-06-20 19:59:03,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-20 19:59:03,277 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 56 predicate places. [2024-06-20 19:59:03,277 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 630 flow [2024-06-20 19:59:03,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:03,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:03,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:03,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:59:03,278 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:03,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1177756290, now seen corresponding path program 2 times [2024-06-20 19:59:03,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:03,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671223322] [2024-06-20 19:59:03,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:03,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:06,807 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-20 19:59:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671223322] [2024-06-20 19:59:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671223322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758062850] [2024-06-20 19:59:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:06,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:06,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 630 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:06,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:06,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:06,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:07,174 INFO L124 PetriNetUnfolderBase]: 235/457 cut-off events. [2024-06-20 19:59:07,174 INFO L125 PetriNetUnfolderBase]: For 6324/6324 co-relation queries the response was YES. [2024-06-20 19:59:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2379 conditions, 457 events. 235/457 cut-off events. For 6324/6324 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1925 event pairs, 43 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2339. Up to 312 conditions per place. [2024-06-20 19:59:07,178 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 57 selfloop transitions, 31 changer transitions 0/90 dead transitions. [2024-06-20 19:59:07,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 963 flow [2024-06-20 19:59:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 19:59:07,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2024-06-20 19:59:07,180 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 630 flow. Second operand 8 states and 95 transitions. [2024-06-20 19:59:07,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 963 flow [2024-06-20 19:59:07,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 894 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:59:07,189 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 662 flow [2024-06-20 19:59:07,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=662, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2024-06-20 19:59:07,189 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 59 predicate places. [2024-06-20 19:59:07,189 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 662 flow [2024-06-20 19:59:07,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:07,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:07,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:07,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:59:07,190 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:07,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1174955006, now seen corresponding path program 1 times [2024-06-20 19:59:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:07,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560406907] [2024-06-20 19:59:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:07,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:10,093 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-20 19:59:10,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:10,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560406907] [2024-06-20 19:59:10,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560406907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:10,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:59:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343739782] [2024-06-20 19:59:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:10,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:59:10,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:59:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:59:10,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:10,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 662 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:10,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:10,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:10,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:10,345 INFO L124 PetriNetUnfolderBase]: 231/451 cut-off events. [2024-06-20 19:59:10,345 INFO L125 PetriNetUnfolderBase]: For 6514/6514 co-relation queries the response was YES. [2024-06-20 19:59:10,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 451 events. 231/451 cut-off events. For 6514/6514 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1914 event pairs, 48 based on Foata normal form. 2/452 useless extension candidates. Maximal degree in co-relation 2280. Up to 334 conditions per place. [2024-06-20 19:59:10,348 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 56 selfloop transitions, 27 changer transitions 0/85 dead transitions. [2024-06-20 19:59:10,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 906 flow [2024-06-20 19:59:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:59:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:59:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:59:10,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4187192118226601 [2024-06-20 19:59:10,349 INFO L175 Difference]: Start difference. First operand has 87 places, 71 transitions, 662 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:59:10,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 906 flow [2024-06-20 19:59:10,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 838 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-20 19:59:10,361 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 656 flow [2024-06-20 19:59:10,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=656, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2024-06-20 19:59:10,361 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 61 predicate places. [2024-06-20 19:59:10,362 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 656 flow [2024-06-20 19:59:10,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:10,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:10,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:10,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:59:10,362 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:10,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash -106323316, now seen corresponding path program 3 times [2024-06-20 19:59:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978844951] [2024-06-20 19:59:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:59:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978844951] [2024-06-20 19:59:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978844951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575356713] [2024-06-20 19:59:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:13,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:13,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 656 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:13,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:13,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:13,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:13,773 INFO L124 PetriNetUnfolderBase]: 215/423 cut-off events. [2024-06-20 19:59:13,774 INFO L125 PetriNetUnfolderBase]: For 6647/6647 co-relation queries the response was YES. [2024-06-20 19:59:13,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 423 events. 215/423 cut-off events. For 6647/6647 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1764 event pairs, 38 based on Foata normal form. 12/434 useless extension candidates. Maximal degree in co-relation 1958. Up to 258 conditions per place. [2024-06-20 19:59:13,777 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 56 selfloop transitions, 25 changer transitions 8/91 dead transitions. [2024-06-20 19:59:13,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 938 flow [2024-06-20 19:59:13,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-20 19:59:13,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41810344827586204 [2024-06-20 19:59:13,779 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 656 flow. Second operand 8 states and 97 transitions. [2024-06-20 19:59:13,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 938 flow [2024-06-20 19:59:13,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 91 transitions, 852 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 19:59:13,789 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 598 flow [2024-06-20 19:59:13,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2024-06-20 19:59:13,790 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 62 predicate places. [2024-06-20 19:59:13,790 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 598 flow [2024-06-20 19:59:13,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:13,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:13,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:13,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:59:13,791 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:13,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1059483912, now seen corresponding path program 1 times [2024-06-20 19:59:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:13,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569232192] [2024-06-20 19:59:13,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:17,053 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-20 19:59:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569232192] [2024-06-20 19:59:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569232192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:17,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567186133] [2024-06-20 19:59:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:17,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:17,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 598 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:17,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:17,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:17,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:17,366 INFO L124 PetriNetUnfolderBase]: 213/425 cut-off events. [2024-06-20 19:59:17,367 INFO L125 PetriNetUnfolderBase]: For 7743/7743 co-relation queries the response was YES. [2024-06-20 19:59:17,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 425 events. 213/425 cut-off events. For 7743/7743 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1815 event pairs, 38 based on Foata normal form. 14/438 useless extension candidates. Maximal degree in co-relation 1912. Up to 229 conditions per place. [2024-06-20 19:59:17,369 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 49 selfloop transitions, 30 changer transitions 8/89 dead transitions. [2024-06-20 19:59:17,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 884 flow [2024-06-20 19:59:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-20 19:59:17,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4224137931034483 [2024-06-20 19:59:17,370 INFO L175 Difference]: Start difference. First operand has 90 places, 68 transitions, 598 flow. Second operand 8 states and 98 transitions. [2024-06-20 19:59:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 884 flow [2024-06-20 19:59:17,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 808 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-20 19:59:17,379 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 577 flow [2024-06-20 19:59:17,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=577, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-06-20 19:59:17,380 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 61 predicate places. [2024-06-20 19:59:17,380 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 577 flow [2024-06-20 19:59:17,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:17,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:17,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:17,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:59:17,380 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:17,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1671114070, now seen corresponding path program 2 times [2024-06-20 19:59:17,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:17,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430161811] [2024-06-20 19:59:17,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:17,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:20,577 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-20 19:59:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430161811] [2024-06-20 19:59:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430161811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:20,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973459028] [2024-06-20 19:59:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:20,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:20,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:20,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 577 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:20,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:20,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:20,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:20,857 INFO L124 PetriNetUnfolderBase]: 191/383 cut-off events. [2024-06-20 19:59:20,857 INFO L125 PetriNetUnfolderBase]: For 4741/4741 co-relation queries the response was YES. [2024-06-20 19:59:20,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 383 events. 191/383 cut-off events. For 4741/4741 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1563 event pairs, 35 based on Foata normal form. 2/384 useless extension candidates. Maximal degree in co-relation 1794. Up to 342 conditions per place. [2024-06-20 19:59:20,861 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 59 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2024-06-20 19:59:20,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 78 transitions, 765 flow [2024-06-20 19:59:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-20 19:59:20,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35344827586206895 [2024-06-20 19:59:20,863 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 577 flow. Second operand 8 states and 82 transitions. [2024-06-20 19:59:20,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 78 transitions, 765 flow [2024-06-20 19:59:20,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 696 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-20 19:59:20,875 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 556 flow [2024-06-20 19:59:20,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=556, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-06-20 19:59:20,875 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 62 predicate places. [2024-06-20 19:59:20,875 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 556 flow [2024-06-20 19:59:20,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:20,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:20,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:20,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:59:20,876 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:20,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2018190256, now seen corresponding path program 3 times [2024-06-20 19:59:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:20,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576508651] [2024-06-20 19:59:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:23,822 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-20 19:59:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576508651] [2024-06-20 19:59:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576508651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:23,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:23,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701605701] [2024-06-20 19:59:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:23,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:23,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:23,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:23,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 556 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:23,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:23,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:23,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:24,180 INFO L124 PetriNetUnfolderBase]: 195/391 cut-off events. [2024-06-20 19:59:24,180 INFO L125 PetriNetUnfolderBase]: For 5004/5004 co-relation queries the response was YES. [2024-06-20 19:59:24,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 391 events. 195/391 cut-off events. For 5004/5004 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1598 event pairs, 35 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1799. Up to 360 conditions per place. [2024-06-20 19:59:24,184 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 65 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-20 19:59:24,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 78 transitions, 740 flow [2024-06-20 19:59:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2024-06-20 19:59:24,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33189655172413796 [2024-06-20 19:59:24,185 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 556 flow. Second operand 8 states and 77 transitions. [2024-06-20 19:59:24,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 78 transitions, 740 flow [2024-06-20 19:59:24,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 702 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:59:24,195 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 556 flow [2024-06-20 19:59:24,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=556, PETRI_PLACES=92, PETRI_TRANSITIONS=68} [2024-06-20 19:59:24,196 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 64 predicate places. [2024-06-20 19:59:24,196 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 556 flow [2024-06-20 19:59:24,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:24,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:24,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:24,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:59:24,197 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:24,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2017893338, now seen corresponding path program 1 times [2024-06-20 19:59:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126674268] [2024-06-20 19:59:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:24,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:59:26,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:26,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126674268] [2024-06-20 19:59:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126674268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344479708] [2024-06-20 19:59:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:26,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:26,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:26,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:27,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:27,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 68 transitions, 556 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:27,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:27,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:27,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:27,210 INFO L124 PetriNetUnfolderBase]: 190/376 cut-off events. [2024-06-20 19:59:27,211 INFO L125 PetriNetUnfolderBase]: For 4840/4840 co-relation queries the response was YES. [2024-06-20 19:59:27,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 376 events. 190/376 cut-off events. For 4840/4840 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1530 event pairs, 34 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1723. Up to 339 conditions per place. [2024-06-20 19:59:27,214 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 57 selfloop transitions, 14 changer transitions 4/77 dead transitions. [2024-06-20 19:59:27,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 77 transitions, 730 flow [2024-06-20 19:59:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:59:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:59:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-20 19:59:27,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35960591133004927 [2024-06-20 19:59:27,216 INFO L175 Difference]: Start difference. First operand has 92 places, 68 transitions, 556 flow. Second operand 7 states and 73 transitions. [2024-06-20 19:59:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 77 transitions, 730 flow [2024-06-20 19:59:27,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 77 transitions, 702 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:59:27,226 INFO L231 Difference]: Finished difference. Result has 93 places, 64 transitions, 525 flow [2024-06-20 19:59:27,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=93, PETRI_TRANSITIONS=64} [2024-06-20 19:59:27,227 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 65 predicate places. [2024-06-20 19:59:27,227 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 64 transitions, 525 flow [2024-06-20 19:59:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:27,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:27,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:27,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:59:27,228 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:27,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1899015220, now seen corresponding path program 4 times [2024-06-20 19:59:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959807164] [2024-06-20 19:59:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:30,256 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-20 19:59:30,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959807164] [2024-06-20 19:59:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959807164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:30,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:30,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907542854] [2024-06-20 19:59:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:30,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:30,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 64 transitions, 525 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:30,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:30,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:30,567 INFO L124 PetriNetUnfolderBase]: 177/349 cut-off events. [2024-06-20 19:59:30,568 INFO L125 PetriNetUnfolderBase]: For 5501/5501 co-relation queries the response was YES. [2024-06-20 19:59:30,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 349 events. 177/349 cut-off events. For 5501/5501 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1393 event pairs, 29 based on Foata normal form. 2/350 useless extension candidates. Maximal degree in co-relation 1659. Up to 320 conditions per place. [2024-06-20 19:59:30,571 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 60 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-20 19:59:30,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 75 transitions, 707 flow [2024-06-20 19:59:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-20 19:59:30,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34051724137931033 [2024-06-20 19:59:30,573 INFO L175 Difference]: Start difference. First operand has 93 places, 64 transitions, 525 flow. Second operand 8 states and 79 transitions. [2024-06-20 19:59:30,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 75 transitions, 707 flow [2024-06-20 19:59:30,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 75 transitions, 628 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-20 19:59:30,585 INFO L231 Difference]: Finished difference. Result has 91 places, 65 transitions, 490 flow [2024-06-20 19:59:30,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=91, PETRI_TRANSITIONS=65} [2024-06-20 19:59:30,586 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 63 predicate places. [2024-06-20 19:59:30,586 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 65 transitions, 490 flow [2024-06-20 19:59:30,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:30,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:30,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:30,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:59:30,587 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:30,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1896357624, now seen corresponding path program 5 times [2024-06-20 19:59:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:30,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363800121] [2024-06-20 19:59:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:33,487 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-20 19:59:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:33,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363800121] [2024-06-20 19:59:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363800121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083699747] [2024-06-20 19:59:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:33,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:33,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:33,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:33,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 65 transitions, 490 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:33,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:33,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:33,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:33,807 INFO L124 PetriNetUnfolderBase]: 174/344 cut-off events. [2024-06-20 19:59:33,807 INFO L125 PetriNetUnfolderBase]: For 4452/4452 co-relation queries the response was YES. [2024-06-20 19:59:33,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 344 events. 174/344 cut-off events. For 4452/4452 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1365 event pairs, 28 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1506. Up to 306 conditions per place. [2024-06-20 19:59:33,810 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 58 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2024-06-20 19:59:33,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 75 transitions, 660 flow [2024-06-20 19:59:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-20 19:59:33,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34051724137931033 [2024-06-20 19:59:33,812 INFO L175 Difference]: Start difference. First operand has 91 places, 65 transitions, 490 flow. Second operand 8 states and 79 transitions. [2024-06-20 19:59:33,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 75 transitions, 660 flow [2024-06-20 19:59:33,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 75 transitions, 626 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:59:33,821 INFO L231 Difference]: Finished difference. Result has 93 places, 65 transitions, 492 flow [2024-06-20 19:59:33,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=492, PETRI_PLACES=93, PETRI_TRANSITIONS=65} [2024-06-20 19:59:33,821 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 65 predicate places. [2024-06-20 19:59:33,822 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 65 transitions, 492 flow [2024-06-20 19:59:33,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:33,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:33,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:33,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:59:33,822 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:33,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2142387342, now seen corresponding path program 1 times [2024-06-20 19:59:33,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:33,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734310211] [2024-06-20 19:59:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:36,648 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-20 19:59:36,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734310211] [2024-06-20 19:59:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734310211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:36,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8626142] [2024-06-20 19:59:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:36,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:36,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:36,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:36,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 65 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:36,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:36,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:36,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:36,972 INFO L124 PetriNetUnfolderBase]: 208/418 cut-off events. [2024-06-20 19:59:36,972 INFO L125 PetriNetUnfolderBase]: For 9189/9189 co-relation queries the response was YES. [2024-06-20 19:59:36,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 418 events. 208/418 cut-off events. For 9189/9189 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1761 event pairs, 49 based on Foata normal form. 8/425 useless extension candidates. Maximal degree in co-relation 1898. Up to 184 conditions per place. [2024-06-20 19:59:36,975 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 56 selfloop transitions, 22 changer transitions 12/92 dead transitions. [2024-06-20 19:59:36,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 800 flow [2024-06-20 19:59:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:59:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:59:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 19:59:36,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099616858237548 [2024-06-20 19:59:36,978 INFO L175 Difference]: Start difference. First operand has 93 places, 65 transitions, 492 flow. Second operand 9 states and 107 transitions. [2024-06-20 19:59:36,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 800 flow [2024-06-20 19:59:36,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 743 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 19:59:36,993 INFO L231 Difference]: Finished difference. Result has 95 places, 63 transitions, 472 flow [2024-06-20 19:59:36,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=95, PETRI_TRANSITIONS=63} [2024-06-20 19:59:36,995 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 67 predicate places. [2024-06-20 19:59:36,995 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 63 transitions, 472 flow [2024-06-20 19:59:36,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:36,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:36,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:36,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:59:36,996 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:36,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2067589114, now seen corresponding path program 2 times [2024-06-20 19:59:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439579682] [2024-06-20 19:59:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:59:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439579682] [2024-06-20 19:59:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439579682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:39,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:39,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93166818] [2024-06-20 19:59:39,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:39,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:39,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 63 transitions, 472 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:39,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:39,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:39,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:40,005 INFO L124 PetriNetUnfolderBase]: 215/439 cut-off events. [2024-06-20 19:59:40,006 INFO L125 PetriNetUnfolderBase]: For 10981/10981 co-relation queries the response was YES. [2024-06-20 19:59:40,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 439 events. 215/439 cut-off events. For 10981/10981 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1922 event pairs, 58 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 2057. Up to 213 conditions per place. [2024-06-20 19:59:40,009 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 45 selfloop transitions, 23 changer transitions 14/84 dead transitions. [2024-06-20 19:59:40,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 84 transitions, 746 flow [2024-06-20 19:59:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-20 19:59:40,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4224137931034483 [2024-06-20 19:59:40,011 INFO L175 Difference]: Start difference. First operand has 95 places, 63 transitions, 472 flow. Second operand 8 states and 98 transitions. [2024-06-20 19:59:40,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 84 transitions, 746 flow [2024-06-20 19:59:40,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 714 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:59:40,021 INFO L231 Difference]: Finished difference. Result has 94 places, 57 transitions, 451 flow [2024-06-20 19:59:40,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=451, PETRI_PLACES=94, PETRI_TRANSITIONS=57} [2024-06-20 19:59:40,022 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 66 predicate places. [2024-06-20 19:59:40,022 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 57 transitions, 451 flow [2024-06-20 19:59:40,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:40,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:40,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:40,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:59:40,023 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:40,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1510012076, now seen corresponding path program 3 times [2024-06-20 19:59:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:40,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356854032] [2024-06-20 19:59:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:43,260 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-20 19:59:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356854032] [2024-06-20 19:59:43,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356854032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:43,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:43,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:43,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988810167] [2024-06-20 19:59:43,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:43,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:43,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:43,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:43,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:43,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 57 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:43,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:43,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:43,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:43,638 INFO L124 PetriNetUnfolderBase]: 223/459 cut-off events. [2024-06-20 19:59:43,638 INFO L125 PetriNetUnfolderBase]: For 12417/12417 co-relation queries the response was YES. [2024-06-20 19:59:43,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 459 events. 223/459 cut-off events. For 12417/12417 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2027 event pairs, 65 based on Foata normal form. 8/466 useless extension candidates. Maximal degree in co-relation 2294. Up to 194 conditions per place. [2024-06-20 19:59:43,642 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 46 selfloop transitions, 27 changer transitions 13/88 dead transitions. [2024-06-20 19:59:43,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 88 transitions, 761 flow [2024-06-20 19:59:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:59:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:59:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 19:59:43,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:59:43,646 INFO L175 Difference]: Start difference. First operand has 94 places, 57 transitions, 451 flow. Second operand 10 states and 116 transitions. [2024-06-20 19:59:43,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 88 transitions, 761 flow [2024-06-20 19:59:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 88 transitions, 699 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-20 19:59:43,655 INFO L231 Difference]: Finished difference. Result has 89 places, 55 transitions, 439 flow [2024-06-20 19:59:43,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=439, PETRI_PLACES=89, PETRI_TRANSITIONS=55} [2024-06-20 19:59:43,656 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 61 predicate places. [2024-06-20 19:59:43,656 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 55 transitions, 439 flow [2024-06-20 19:59:43,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:43,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:43,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:43,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:59:43,656 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:43,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1510015796, now seen corresponding path program 4 times [2024-06-20 19:59:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185543527] [2024-06-20 19:59:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:46,646 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-20 19:59:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185543527] [2024-06-20 19:59:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185543527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632727570] [2024-06-20 19:59:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:46,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:46,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:46,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 55 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:46,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:46,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:46,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:46,917 INFO L124 PetriNetUnfolderBase]: 188/388 cut-off events. [2024-06-20 19:59:46,917 INFO L125 PetriNetUnfolderBase]: For 8260/8260 co-relation queries the response was YES. [2024-06-20 19:59:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 388 events. 188/388 cut-off events. For 8260/8260 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1620 event pairs, 55 based on Foata normal form. 12/399 useless extension candidates. Maximal degree in co-relation 1799. Up to 217 conditions per place. [2024-06-20 19:59:46,921 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 38 selfloop transitions, 25 changer transitions 8/73 dead transitions. [2024-06-20 19:59:46,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 73 transitions, 635 flow [2024-06-20 19:59:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-20 19:59:46,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879310344827586 [2024-06-20 19:59:46,922 INFO L175 Difference]: Start difference. First operand has 89 places, 55 transitions, 439 flow. Second operand 8 states and 90 transitions. [2024-06-20 19:59:46,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 73 transitions, 635 flow [2024-06-20 19:59:46,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 73 transitions, 583 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:59:46,931 INFO L231 Difference]: Finished difference. Result has 86 places, 51 transitions, 410 flow [2024-06-20 19:59:46,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=86, PETRI_TRANSITIONS=51} [2024-06-20 19:59:46,932 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 58 predicate places. [2024-06-20 19:59:46,932 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 51 transitions, 410 flow [2024-06-20 19:59:46,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:46,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:46,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:46,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:59:46,932 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:46,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1515730088, now seen corresponding path program 1 times [2024-06-20 19:59:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261330980] [2024-06-20 19:59:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:59:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261330980] [2024-06-20 19:59:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261330980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:59:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739593144] [2024-06-20 19:59:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:59:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:59:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:59:50,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:50,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 51 transitions, 410 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:50,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:50,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:50,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:50,521 INFO L124 PetriNetUnfolderBase]: 163/336 cut-off events. [2024-06-20 19:59:50,521 INFO L125 PetriNetUnfolderBase]: For 5392/5392 co-relation queries the response was YES. [2024-06-20 19:59:50,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 336 events. 163/336 cut-off events. For 5392/5392 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1313 event pairs, 55 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 1633. Up to 225 conditions per place. [2024-06-20 19:59:50,523 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 40 selfloop transitions, 21 changer transitions 0/63 dead transitions. [2024-06-20 19:59:50,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 63 transitions, 568 flow [2024-06-20 19:59:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-20 19:59:50,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2024-06-20 19:59:50,524 INFO L175 Difference]: Start difference. First operand has 86 places, 51 transitions, 410 flow. Second operand 8 states and 80 transitions. [2024-06-20 19:59:50,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 63 transitions, 568 flow [2024-06-20 19:59:50,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 63 transitions, 492 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:59:50,531 INFO L231 Difference]: Finished difference. Result has 84 places, 52 transitions, 390 flow [2024-06-20 19:59:50,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=390, PETRI_PLACES=84, PETRI_TRANSITIONS=52} [2024-06-20 19:59:50,531 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 56 predicate places. [2024-06-20 19:59:50,531 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 52 transitions, 390 flow [2024-06-20 19:59:50,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:50,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:50,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:50,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:59:50,532 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:50,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1515737528, now seen corresponding path program 2 times [2024-06-20 19:59:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:50,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418700793] [2024-06-20 19:59:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:50,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:53,575 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-20 19:59:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418700793] [2024-06-20 19:59:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418700793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:53,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:53,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:53,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571101603] [2024-06-20 19:59:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:53,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:53,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:53,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 52 transitions, 390 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:53,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:53,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:53,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:53,844 INFO L124 PetriNetUnfolderBase]: 167/344 cut-off events. [2024-06-20 19:59:53,844 INFO L125 PetriNetUnfolderBase]: For 5955/5955 co-relation queries the response was YES. [2024-06-20 19:59:53,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 344 events. 167/344 cut-off events. For 5955/5955 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1379 event pairs, 53 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1633. Up to 197 conditions per place. [2024-06-20 19:59:53,846 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 38 selfloop transitions, 24 changer transitions 0/64 dead transitions. [2024-06-20 19:59:53,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 64 transitions, 550 flow [2024-06-20 19:59:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-20 19:59:53,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34913793103448276 [2024-06-20 19:59:53,847 INFO L175 Difference]: Start difference. First operand has 84 places, 52 transitions, 390 flow. Second operand 8 states and 81 transitions. [2024-06-20 19:59:53,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 64 transitions, 550 flow [2024-06-20 19:59:53,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 504 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:59:53,868 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 409 flow [2024-06-20 19:59:53,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=409, PETRI_PLACES=86, PETRI_TRANSITIONS=53} [2024-06-20 19:59:53,868 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 58 predicate places. [2024-06-20 19:59:53,869 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 409 flow [2024-06-20 19:59:53,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:53,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:53,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:53,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:59:53,869 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:53,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1260077332, now seen corresponding path program 3 times [2024-06-20 19:59:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288163579] [2024-06-20 19:59:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:59:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:59:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:59:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288163579] [2024-06-20 19:59:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288163579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:59:56,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:59:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:59:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762081295] [2024-06-20 19:59:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:59:56,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:59:56,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:59:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:59:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:59:56,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 19:59:56,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 53 transitions, 409 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:56,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:59:56,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 19:59:56,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:59:57,013 INFO L124 PetriNetUnfolderBase]: 171/352 cut-off events. [2024-06-20 19:59:57,013 INFO L125 PetriNetUnfolderBase]: For 6546/6546 co-relation queries the response was YES. [2024-06-20 19:59:57,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 352 events. 171/352 cut-off events. For 6546/6546 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1410 event pairs, 56 based on Foata normal form. 2/353 useless extension candidates. Maximal degree in co-relation 1717. Up to 315 conditions per place. [2024-06-20 19:59:57,015 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 50 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2024-06-20 19:59:57,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 65 transitions, 575 flow [2024-06-20 19:59:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:59:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:59:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-20 19:59:57,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2024-06-20 19:59:57,016 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 409 flow. Second operand 8 states and 80 transitions. [2024-06-20 19:59:57,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 65 transitions, 575 flow [2024-06-20 19:59:57,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 65 transitions, 522 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:59:57,023 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 400 flow [2024-06-20 19:59:57,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=400, PETRI_PLACES=88, PETRI_TRANSITIONS=54} [2024-06-20 19:59:57,023 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 60 predicate places. [2024-06-20 19:59:57,023 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 400 flow [2024-06-20 19:59:57,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:59:57,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:59:57,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:59:57,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:59:57,024 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:59:57,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:59:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1260069892, now seen corresponding path program 4 times [2024-06-20 19:59:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:59:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782328429] [2024-06-20 19:59:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:59:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:59:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:00,260 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-20 20:00:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782328429] [2024-06-20 20:00:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782328429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:00:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658027004] [2024-06-20 20:00:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:00,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:00:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:00:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:00:00,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:00,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 54 transitions, 400 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:00,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:00,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:00,579 INFO L124 PetriNetUnfolderBase]: 175/360 cut-off events. [2024-06-20 20:00:00,580 INFO L125 PetriNetUnfolderBase]: For 7126/7126 co-relation queries the response was YES. [2024-06-20 20:00:00,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 360 events. 175/360 cut-off events. For 7126/7126 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1461 event pairs, 58 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 1761. Up to 309 conditions per place. [2024-06-20 20:00:00,582 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 50 selfloop transitions, 14 changer transitions 0/66 dead transitions. [2024-06-20 20:00:00,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 66 transitions, 568 flow [2024-06-20 20:00:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-20 20:00:00,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34913793103448276 [2024-06-20 20:00:00,585 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 400 flow. Second operand 8 states and 81 transitions. [2024-06-20 20:00:00,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 66 transitions, 568 flow [2024-06-20 20:00:00,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 66 transitions, 534 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 20:00:00,596 INFO L231 Difference]: Finished difference. Result has 90 places, 55 transitions, 414 flow [2024-06-20 20:00:00,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=90, PETRI_TRANSITIONS=55} [2024-06-20 20:00:00,597 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 62 predicate places. [2024-06-20 20:00:00,597 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 55 transitions, 414 flow [2024-06-20 20:00:00,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:00,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:00,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 20:00:00,598 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:00,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1003569382, now seen corresponding path program 5 times [2024-06-20 20:00:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:00,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214172772] [2024-06-20 20:00:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:03,564 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-20 20:00:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214172772] [2024-06-20 20:00:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214172772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:03,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:03,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:00:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430269996] [2024-06-20 20:00:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:00:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:00:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:00:03,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:03,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 55 transitions, 414 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:03,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:03,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:03,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:03,904 INFO L124 PetriNetUnfolderBase]: 172/355 cut-off events. [2024-06-20 20:00:03,904 INFO L125 PetriNetUnfolderBase]: For 7159/7159 co-relation queries the response was YES. [2024-06-20 20:00:03,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 355 events. 172/355 cut-off events. For 7159/7159 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1440 event pairs, 54 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 1721. Up to 275 conditions per place. [2024-06-20 20:00:03,907 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 49 selfloop transitions, 18 changer transitions 0/69 dead transitions. [2024-06-20 20:00:03,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 69 transitions, 656 flow [2024-06-20 20:00:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-20 20:00:03,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35344827586206895 [2024-06-20 20:00:03,908 INFO L175 Difference]: Start difference. First operand has 90 places, 55 transitions, 414 flow. Second operand 8 states and 82 transitions. [2024-06-20 20:00:03,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 69 transitions, 656 flow [2024-06-20 20:00:03,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 69 transitions, 618 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 20:00:03,916 INFO L231 Difference]: Finished difference. Result has 92 places, 57 transitions, 452 flow [2024-06-20 20:00:03,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=452, PETRI_PLACES=92, PETRI_TRANSITIONS=57} [2024-06-20 20:00:03,916 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 64 predicate places. [2024-06-20 20:00:03,917 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 57 transitions, 452 flow [2024-06-20 20:00:03,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:03,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:03,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:03,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 20:00:03,917 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:03,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1003576822, now seen corresponding path program 6 times [2024-06-20 20:00:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366163774] [2024-06-20 20:00:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:07,167 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-20 20:00:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366163774] [2024-06-20 20:00:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366163774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:00:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639895823] [2024-06-20 20:00:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:07,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:00:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:00:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:00:07,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:07,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 57 transitions, 452 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:07,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:07,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:07,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:07,455 INFO L124 PetriNetUnfolderBase]: 169/350 cut-off events. [2024-06-20 20:00:07,455 INFO L125 PetriNetUnfolderBase]: For 7164/7164 co-relation queries the response was YES. [2024-06-20 20:00:07,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 350 events. 169/350 cut-off events. For 7164/7164 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1411 event pairs, 55 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 1677. Up to 301 conditions per place. [2024-06-20 20:00:07,457 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 50 selfloop transitions, 16 changer transitions 0/68 dead transitions. [2024-06-20 20:00:07,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 68 transitions, 612 flow [2024-06-20 20:00:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-20 20:00:07,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2024-06-20 20:00:07,458 INFO L175 Difference]: Start difference. First operand has 92 places, 57 transitions, 452 flow. Second operand 8 states and 80 transitions. [2024-06-20 20:00:07,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 68 transitions, 612 flow [2024-06-20 20:00:07,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 68 transitions, 572 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 20:00:07,469 INFO L231 Difference]: Finished difference. Result has 96 places, 57 transitions, 450 flow [2024-06-20 20:00:07,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=450, PETRI_PLACES=96, PETRI_TRANSITIONS=57} [2024-06-20 20:00:07,469 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 68 predicate places. [2024-06-20 20:00:07,469 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 57 transitions, 450 flow [2024-06-20 20:00:07,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:07,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:07,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:07,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 20:00:07,469 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:07,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash -994372612, now seen corresponding path program 7 times [2024-06-20 20:00:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:07,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455430983] [2024-06-20 20:00:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:10,487 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-20 20:00:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455430983] [2024-06-20 20:00:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455430983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:10,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:10,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:00:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779976416] [2024-06-20 20:00:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:10,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:00:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:00:10,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:00:10,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:10,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 57 transitions, 450 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:10,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:10,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:10,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:10,767 INFO L124 PetriNetUnfolderBase]: 166/345 cut-off events. [2024-06-20 20:00:10,768 INFO L125 PetriNetUnfolderBase]: For 6861/6861 co-relation queries the response was YES. [2024-06-20 20:00:10,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 345 events. 166/345 cut-off events. For 6861/6861 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1389 event pairs, 41 based on Foata normal form. 2/346 useless extension candidates. Maximal degree in co-relation 1610. Up to 306 conditions per place. [2024-06-20 20:00:10,769 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 55 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2024-06-20 20:00:10,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 68 transitions, 606 flow [2024-06-20 20:00:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2024-06-20 20:00:10,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33620689655172414 [2024-06-20 20:00:10,770 INFO L175 Difference]: Start difference. First operand has 96 places, 57 transitions, 450 flow. Second operand 8 states and 78 transitions. [2024-06-20 20:00:10,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 68 transitions, 606 flow [2024-06-20 20:00:10,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 68 transitions, 570 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 20:00:10,779 INFO L231 Difference]: Finished difference. Result has 97 places, 57 transitions, 440 flow [2024-06-20 20:00:10,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=440, PETRI_PLACES=97, PETRI_TRANSITIONS=57} [2024-06-20 20:00:10,780 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 69 predicate places. [2024-06-20 20:00:10,780 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 57 transitions, 440 flow [2024-06-20 20:00:10,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:10,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:10,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:10,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 20:00:10,780 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:10,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -443765769, now seen corresponding path program 1 times [2024-06-20 20:00:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761893321] [2024-06-20 20:00:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:14,500 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-20 20:00:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761893321] [2024-06-20 20:00:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761893321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:14,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 20:00:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627166774] [2024-06-20 20:00:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 20:00:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 20:00:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 20:00:14,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:14,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 57 transitions, 440 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:14,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:14,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:14,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:14,759 INFO L124 PetriNetUnfolderBase]: 174/365 cut-off events. [2024-06-20 20:00:14,759 INFO L125 PetriNetUnfolderBase]: For 8763/8763 co-relation queries the response was YES. [2024-06-20 20:00:14,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 365 events. 174/365 cut-off events. For 8763/8763 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1523 event pairs, 52 based on Foata normal form. 6/370 useless extension candidates. Maximal degree in co-relation 1662. Up to 224 conditions per place. [2024-06-20 20:00:14,761 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 42 selfloop transitions, 20 changer transitions 7/71 dead transitions. [2024-06-20 20:00:14,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 71 transitions, 612 flow [2024-06-20 20:00:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 20:00:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 20:00:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-20 20:00:14,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2024-06-20 20:00:14,762 INFO L175 Difference]: Start difference. First operand has 97 places, 57 transitions, 440 flow. Second operand 9 states and 90 transitions. [2024-06-20 20:00:14,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 71 transitions, 612 flow [2024-06-20 20:00:14,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 71 transitions, 558 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-20 20:00:14,773 INFO L231 Difference]: Finished difference. Result has 98 places, 54 transitions, 412 flow [2024-06-20 20:00:14,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=98, PETRI_TRANSITIONS=54} [2024-06-20 20:00:14,773 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 70 predicate places. [2024-06-20 20:00:14,773 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 54 transitions, 412 flow [2024-06-20 20:00:14,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:14,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:14,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:14,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 20:00:14,774 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:14,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -696361745, now seen corresponding path program 2 times [2024-06-20 20:00:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030944809] [2024-06-20 20:00:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:17,833 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-20 20:00:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:17,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030944809] [2024-06-20 20:00:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030944809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:17,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:00:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863411383] [2024-06-20 20:00:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:17,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:00:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:00:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:00:17,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:17,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 54 transitions, 412 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:17,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:17,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:17,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:18,090 INFO L124 PetriNetUnfolderBase]: 146/304 cut-off events. [2024-06-20 20:00:18,090 INFO L125 PetriNetUnfolderBase]: For 7288/7288 co-relation queries the response was YES. [2024-06-20 20:00:18,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 304 events. 146/304 cut-off events. For 7288/7288 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1182 event pairs, 39 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1295. Up to 157 conditions per place. [2024-06-20 20:00:18,092 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 31 selfloop transitions, 11 changer transitions 23/67 dead transitions. [2024-06-20 20:00:18,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 67 transitions, 574 flow [2024-06-20 20:00:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-20 20:00:18,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34913793103448276 [2024-06-20 20:00:18,093 INFO L175 Difference]: Start difference. First operand has 98 places, 54 transitions, 412 flow. Second operand 8 states and 81 transitions. [2024-06-20 20:00:18,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 67 transitions, 574 flow [2024-06-20 20:00:18,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 67 transitions, 487 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 20:00:18,100 INFO L231 Difference]: Finished difference. Result has 94 places, 39 transitions, 260 flow [2024-06-20 20:00:18,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=94, PETRI_TRANSITIONS=39} [2024-06-20 20:00:18,101 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 66 predicate places. [2024-06-20 20:00:18,101 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 39 transitions, 260 flow [2024-06-20 20:00:18,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:18,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:18,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:18,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 20:00:18,102 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:18,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:18,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1145380565, now seen corresponding path program 3 times [2024-06-20 20:00:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:18,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697309094] [2024-06-20 20:00:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:21,479 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-20 20:00:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697309094] [2024-06-20 20:00:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697309094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:21,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:00:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448284664] [2024-06-20 20:00:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:21,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:00:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:00:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:00:21,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:21,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 39 transitions, 260 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:21,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:21,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:21,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:21,697 INFO L124 PetriNetUnfolderBase]: 89/197 cut-off events. [2024-06-20 20:00:21,697 INFO L125 PetriNetUnfolderBase]: For 4166/4166 co-relation queries the response was YES. [2024-06-20 20:00:21,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 197 events. 89/197 cut-off events. For 4166/4166 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 671 event pairs, 20 based on Foata normal form. 6/202 useless extension candidates. Maximal degree in co-relation 727. Up to 60 conditions per place. [2024-06-20 20:00:21,698 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 16 selfloop transitions, 3 changer transitions 31/52 dead transitions. [2024-06-20 20:00:21,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 52 transitions, 390 flow [2024-06-20 20:00:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-20 20:00:21,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34051724137931033 [2024-06-20 20:00:21,699 INFO L175 Difference]: Start difference. First operand has 94 places, 39 transitions, 260 flow. Second operand 8 states and 79 transitions. [2024-06-20 20:00:21,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 52 transitions, 390 flow [2024-06-20 20:00:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 52 transitions, 352 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-20 20:00:21,703 INFO L231 Difference]: Finished difference. Result has 77 places, 20 transitions, 116 flow [2024-06-20 20:00:21,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=77, PETRI_TRANSITIONS=20} [2024-06-20 20:00:21,704 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 49 predicate places. [2024-06-20 20:00:21,704 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 20 transitions, 116 flow [2024-06-20 20:00:21,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:21,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 20:00:21,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:21,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 20:00:21,705 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 20:00:21,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 20:00:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash -760779437, now seen corresponding path program 4 times [2024-06-20 20:00:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 20:00:21,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543563770] [2024-06-20 20:00:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 20:00:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 20:00:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 20:00:24,926 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-20 20:00:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 20:00:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543563770] [2024-06-20 20:00:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543563770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 20:00:24,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 20:00:24,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 20:00:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890225085] [2024-06-20 20:00:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 20:00:24,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 20:00:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 20:00:24,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 20:00:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 20:00:25,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 20:00:25,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 20 transitions, 116 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:25,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 20:00:25,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 20:00:25,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 20:00:25,107 INFO L124 PetriNetUnfolderBase]: 25/64 cut-off events. [2024-06-20 20:00:25,107 INFO L125 PetriNetUnfolderBase]: For 1091/1091 co-relation queries the response was YES. [2024-06-20 20:00:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 64 events. 25/64 cut-off events. For 1091/1091 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 3 based on Foata normal form. 6/70 useless extension candidates. Maximal degree in co-relation 169. Up to 24 conditions per place. [2024-06-20 20:00:25,107 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2024-06-20 20:00:25,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 26 transitions, 138 flow [2024-06-20 20:00:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 20:00:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 20:00:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2024-06-20 20:00:25,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2801724137931034 [2024-06-20 20:00:25,108 INFO L175 Difference]: Start difference. First operand has 77 places, 20 transitions, 116 flow. Second operand 8 states and 65 transitions. [2024-06-20 20:00:25,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 26 transitions, 138 flow [2024-06-20 20:00:25,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 26 transitions, 106 flow, removed 1 selfloop flow, removed 15 redundant places. [2024-06-20 20:00:25,109 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2024-06-20 20:00:25,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2024-06-20 20:00:25,109 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 21 predicate places. [2024-06-20 20:00:25,109 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2024-06-20 20:00:25,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 20:00:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-20 20:00:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-20 20:00:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-20 20:00:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-20 20:00:25,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 20:00:25,118 INFO L445 BasicCegarLoop]: Path program histogram: [7, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 20:00:25,121 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-20 20:00:25,121 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-20 20:00:25,124 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-20 20:00:25,124 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-20 20:00:25,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.06 08:00:25 BasicIcfg [2024-06-20 20:00:25,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-20 20:00:25,126 INFO L158 Benchmark]: Toolchain (without parser) took 148105.90ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 158.7MB in the beginning and 841.5MB in the end (delta: -682.8MB). Peak memory consumption was 434.8MB. Max. memory is 16.1GB. [2024-06-20 20:00:25,126 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 20:00:25,126 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 20:00:25,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 819.40ms. Allocated memory is still 186.6MB. Free memory was 158.5MB in the beginning and 113.9MB in the end (delta: 44.6MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-06-20 20:00:25,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.46ms. Allocated memory is still 186.6MB. Free memory was 112.8MB in the beginning and 101.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-20 20:00:25,127 INFO L158 Benchmark]: Boogie Preprocessor took 83.76ms. Allocated memory is still 186.6MB. Free memory was 101.3MB in the beginning and 94.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-20 20:00:25,127 INFO L158 Benchmark]: RCFGBuilder took 1158.51ms. Allocated memory is still 186.6MB. Free memory was 94.7MB in the beginning and 119.1MB in the end (delta: -24.4MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-06-20 20:00:25,128 INFO L158 Benchmark]: TraceAbstraction took 145931.22ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 119.1MB in the beginning and 841.5MB in the end (delta: -722.4MB). Peak memory consumption was 396.5MB. Max. memory is 16.1GB. [2024-06-20 20:00:25,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 819.40ms. Allocated memory is still 186.6MB. Free memory was 158.5MB in the beginning and 113.9MB in the end (delta: 44.6MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.46ms. Allocated memory is still 186.6MB. Free memory was 112.8MB in the beginning and 101.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.76ms. Allocated memory is still 186.6MB. Free memory was 101.3MB in the beginning and 94.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1158.51ms. Allocated memory is still 186.6MB. Free memory was 94.7MB in the beginning and 119.1MB in the end (delta: -24.4MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 145931.22ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 119.1MB in the beginning and 841.5MB in the end (delta: -722.4MB). Peak memory consumption was 396.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 46 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 145.8s, OverallIterations: 43, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1951 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1621 mSDsluCounter, 1519 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1259 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7928 IncrementalHoareTripleChecker+Invalid, 8300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 260 mSDtfsCounter, 7928 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=20, InterpolantAutomatonStates: 314, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 130.1s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 24926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-20 20:00:25,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE