./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 18:09:53,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 18:09:53,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 18:09:53,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 18:09:53,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 18:09:53,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 18:09:53,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 18:09:53,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 18:09:53,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 18:09:53,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 18:09:53,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 18:09:53,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 18:09:53,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 18:09:53,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 18:09:53,796 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 18:09:53,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 18:09:53,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 18:09:53,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 18:09:53,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 18:09:53,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 18:09:53,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 18:09:53,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 18:09:53,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 18:09:53,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 18:09:53,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 18:09:53,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 18:09:53,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 18:09:53,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 18:09:53,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 18:09:53,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 18:09:53,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 18:09:53,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 18:09:53,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:09:53,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 18:09:53,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 18:09:53,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 18:09:53,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 18:09:53,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 18:09:53,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 18:09:53,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 18:09:53,803 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 18:09:53,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 18:09:53,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 18:09:53,804 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-04 18:09:54,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 18:09:54,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 18:09:54,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 18:09:54,078 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 18:09:54,079 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 18:09:54,081 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.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-04 18:09:54,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 18:09:54,267 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 18:09:54,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-04 18:09:55,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 18:09:55,641 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 18:09:55,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-04 18:09:55,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a429b13/e1c50adc90a348e4aab232e3d72040b0/FLAG4e4999a1c [2024-06-04 18:09:55,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a429b13/e1c50adc90a348e4aab232e3d72040b0 [2024-06-04 18:09:55,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 18:09:55,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 18:09:55,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 18:09:55,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 18:09:55,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 18:09:55,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:54" (1/2) ... [2024-06-04 18:09:55,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43858df8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:09:55, skipping insertion in model container [2024-06-04 18:09:55,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:54" (1/2) ... [2024-06-04 18:09:55,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c99537d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:09:55, skipping insertion in model container [2024-06-04 18:09:55,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:09:55" (2/2) ... [2024-06-04 18:09:55,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43858df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:55, skipping insertion in model container [2024-06-04 18:09:55,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:09:55" (2/2) ... [2024-06-04 18:09:55,678 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 18:09:55,738 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 18:09:55,739 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 18:09:55,740 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 18:09:55,740 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 18:09:55,740 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-04 18:09:55,790 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 18:09:56,190 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:09:56,206 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 18:09:56,426 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:09:56,470 INFO L206 MainTranslator]: Completed translation [2024-06-04 18:09:56,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56 WrapperNode [2024-06-04 18:09:56,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 18:09:56,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 18:09:56,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 18:09:56,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 18:09:56,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,615 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-04 18:09:56,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 18:09:56,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 18:09:56,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 18:09:56,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 18:09:56,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,721 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-04 18:09:56,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 18:09:56,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 18:09:56,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 18:09:56,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 18:09:56,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (1/1) ... [2024-06-04 18:09:56,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:09:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 18:09:56,805 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-04 18:09:56,828 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-04 18:09:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 18:09:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 18:09:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 18:09:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 18:09:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 18:09:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 18:09:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 18:09:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 18:09:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 18:09:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 18:09:56,850 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 18:09:56,989 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 18:09:56,990 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 18:09:57,744 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 18:09:57,744 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 18:09:57,938 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 18:09:57,938 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 18:09:57,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:09:57 BoogieIcfgContainer [2024-06-04 18:09:57,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 18:09:57,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 18:09:57,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 18:09:57,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 18:09:57,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:54" (1/4) ... [2024-06-04 18:09:57,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d8f444 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:09:57, skipping insertion in model container [2024-06-04 18:09:57,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:09:55" (2/4) ... [2024-06-04 18:09:57,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d8f444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:09:57, skipping insertion in model container [2024-06-04 18:09:57,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:56" (3/4) ... [2024-06-04 18:09:57,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d8f444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:09:57, skipping insertion in model container [2024-06-04 18:09:57,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:09:57" (4/4) ... [2024-06-04 18:09:57,952 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-06-04 18:09:57,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 18:09:57,970 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 18:09:57,970 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 18:09:58,056 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 18:09:58,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-04 18:09:58,133 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-04 18:09:58,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:09:58,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 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/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 18:09:58,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-04 18:09:58,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-04 18:09:58,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 18:09:58,159 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;@813a450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 18:09:58,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 18:09:58,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 18:09:58,183 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 18:09:58,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:09:58,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:58,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 18:09:58,185 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-04 18:09:58,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1322329521, now seen corresponding path program 1 times [2024-06-04 18:09:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:58,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960015649] [2024-06-04 18:09:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:01,473 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-04 18:10:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960015649] [2024-06-04 18:10:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960015649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 18:10:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108306210] [2024-06-04 18:10:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:01,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 18:10:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 18:10:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 18:10:01,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:10:01,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:01,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:01,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:10:01,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:01,824 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-04 18:10:01,825 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 18:10:01,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 297 events. 162/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1013 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-04 18:10:01,831 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-04 18:10:01,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-04 18:10:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 18:10:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 18:10:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-06-04 18:10:01,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-04 18:10:01,845 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 46 transitions. [2024-06-04 18:10:01,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-04 18:10:01,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 18:10:01,850 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-04 18:10:01,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-04 18:10:01,855 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-04 18:10:01,856 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-04 18:10:01,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:01,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:01,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:01,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 18:10:01,858 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-04 18:10:01,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -551185454, now seen corresponding path program 1 times [2024-06-04 18:10:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:01,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383512404] [2024-06-04 18:10:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:04,236 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-04 18:10:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383512404] [2024-06-04 18:10:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383512404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:04,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:04,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 18:10:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064790253] [2024-06-04 18:10:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:04,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 18:10:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 18:10:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 18:10:04,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:10:04,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:04,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:04,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:10:04,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:04,551 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-04 18:10:04,551 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-04 18:10:04,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 292 events. 159/292 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-04 18:10:04,558 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-04 18:10:04,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-04 18:10:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 18:10:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 18:10:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2024-06-04 18:10:04,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-04 18:10:04,560 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 58 transitions. [2024-06-04 18:10:04,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-04 18:10:04,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 18:10:04,562 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-04 18:10:04,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-04 18:10:04,563 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-04 18:10:04,563 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-04 18:10:04,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:04,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:04,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:04,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 18:10:04,565 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-04 18:10:04,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 79715222, now seen corresponding path program 1 times [2024-06-04 18:10:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457541291] [2024-06-04 18:10:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:06,627 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-04 18:10:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457541291] [2024-06-04 18:10:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457541291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 18:10:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877156149] [2024-06-04 18:10:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:06,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 18:10:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 18:10:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 18:10:06,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:10:06,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:06,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:06,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:10:06,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:06,893 INFO L124 PetriNetUnfolderBase]: 153/282 cut-off events. [2024-06-04 18:10:06,893 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-06-04 18:10:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 282 events. 153/282 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 940 event pairs, 43 based on Foata normal form. 4/284 useless extension candidates. Maximal degree in co-relation 714. Up to 246 conditions per place. [2024-06-04 18:10:06,896 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-04 18:10:06,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 211 flow [2024-06-04 18:10:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:10:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:10:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-04 18:10:06,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-04 18:10:06,901 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 71 transitions. [2024-06-04 18:10:06,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 211 flow [2024-06-04 18:10:06,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 18:10:06,905 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 117 flow [2024-06-04 18:10:06,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-06-04 18:10:06,907 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2024-06-04 18:10:06,907 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 117 flow [2024-06-04 18:10:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:06,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:06,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:06,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 18:10:06,908 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-04 18:10:06,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:06,909 INFO L85 PathProgramCache]: Analyzing trace with hash -703047979, now seen corresponding path program 1 times [2024-06-04 18:10:06,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:06,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680122097] [2024-06-04 18:10:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:09,647 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-04 18:10:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:09,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680122097] [2024-06-04 18:10:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680122097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737749983] [2024-06-04 18:10:09,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:09,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:09,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:10:09,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-04 18:10:09,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:09,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:10:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:09,946 INFO L124 PetriNetUnfolderBase]: 149/274 cut-off events. [2024-06-04 18:10:09,946 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2024-06-04 18:10:09,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 274 events. 149/274 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 907 event pairs, 24 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 756. Up to 220 conditions per place. [2024-06-04 18:10:09,948 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-04 18:10:09,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 225 flow [2024-06-04 18:10:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:10:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:10:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-04 18:10:09,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-04 18:10:09,950 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 117 flow. Second operand 6 states and 78 transitions. [2024-06-04 18:10:09,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 225 flow [2024-06-04 18:10:09,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:09,953 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 114 flow [2024-06-04 18:10:09,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2024-06-04 18:10:09,955 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-04 18:10:09,955 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 114 flow [2024-06-04 18:10:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-04 18:10:09,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:09,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:09,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 18:10:09,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:09,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1322578618, now seen corresponding path program 1 times [2024-06-04 18:10:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141303970] [2024-06-04 18:10:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:14,009 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-04 18:10:14,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:14,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141303970] [2024-06-04 18:10:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141303970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:14,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:14,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:10:14,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467595651] [2024-06-04 18:10:14,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:14,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:10:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:10:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:10:14,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:14,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:14,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:14,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:14,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:14,263 INFO L124 PetriNetUnfolderBase]: 147/271 cut-off events. [2024-06-04 18:10:14,263 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-04 18:10:14,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 271 events. 147/271 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 886 event pairs, 53 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 780. Up to 259 conditions per place. [2024-06-04 18:10:14,265 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2024-06-04 18:10:14,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 196 flow [2024-06-04 18:10:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:10:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:10:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-06-04 18:10:14,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-04 18:10:14,269 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 114 flow. Second operand 5 states and 54 transitions. [2024-06-04 18:10:14,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 196 flow [2024-06-04 18:10:14,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 176 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:14,274 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 121 flow [2024-06-04 18:10:14,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-06-04 18:10:14,276 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2024-06-04 18:10:14,279 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 121 flow [2024-06-04 18:10:14,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:14,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:14,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:14,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 18:10:14,285 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-04 18:10:14,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1949736420, now seen corresponding path program 1 times [2024-06-04 18:10:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450404932] [2024-06-04 18:10:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:17,788 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-04 18:10:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:17,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450404932] [2024-06-04 18:10:17,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450404932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:17,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:17,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:17,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731875447] [2024-06-04 18:10:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:17,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:17,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:17,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:17,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:17,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:17,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:17,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:18,032 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-04 18:10:18,032 INFO L125 PetriNetUnfolderBase]: For 498/501 co-relation queries the response was YES. [2024-06-04 18:10:18,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 276 events. 149/276 cut-off events. For 498/501 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 922 event pairs, 52 based on Foata normal form. 4/277 useless extension candidates. Maximal degree in co-relation 822. Up to 237 conditions per place. [2024-06-04 18:10:18,035 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 28 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2024-06-04 18:10:18,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 249 flow [2024-06-04 18:10:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:10:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:10:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-04 18:10:18,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2024-06-04 18:10:18,037 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 121 flow. Second operand 6 states and 67 transitions. [2024-06-04 18:10:18,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 249 flow [2024-06-04 18:10:18,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 238 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:18,040 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 178 flow [2024-06-04 18:10:18,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-04 18:10:18,042 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-06-04 18:10:18,043 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 178 flow [2024-06-04 18:10:18,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:18,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:18,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 18:10:18,044 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-04 18:10:18,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1382704549, now seen corresponding path program 1 times [2024-06-04 18:10:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142030893] [2024-06-04 18:10:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142030893] [2024-06-04 18:10:20,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142030893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528818176] [2024-06-04 18:10:20,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:20,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:21,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:21,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:21,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:21,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:21,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:21,226 INFO L124 PetriNetUnfolderBase]: 156/288 cut-off events. [2024-06-04 18:10:21,227 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2024-06-04 18:10:21,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 288 events. 156/288 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 959 event pairs, 51 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 989. Up to 264 conditions per place. [2024-06-04 18:10:21,229 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-04 18:10:21,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 332 flow [2024-06-04 18:10:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-04 18:10:21,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-04 18:10:21,231 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 178 flow. Second operand 7 states and 74 transitions. [2024-06-04 18:10:21,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 332 flow [2024-06-04 18:10:21,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 318 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 18:10:21,234 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 233 flow [2024-06-04 18:10:21,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-04 18:10:21,235 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-04 18:10:21,235 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 233 flow [2024-06-04 18:10:21,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:21,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:21,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:21,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 18:10:21,236 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-04 18:10:21,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1164690619, now seen corresponding path program 2 times [2024-06-04 18:10:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648600658] [2024-06-04 18:10:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648600658] [2024-06-04 18:10:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648600658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:24,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003832032] [2024-06-04 18:10:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:24,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:24,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:24,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:24,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:24,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:24,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:24,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:24,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:24,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:24,649 INFO L124 PetriNetUnfolderBase]: 159/293 cut-off events. [2024-06-04 18:10:24,649 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-04 18:10:24,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 293 events. 159/293 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 982 event pairs, 50 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1086. Up to 266 conditions per place. [2024-06-04 18:10:24,652 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2024-06-04 18:10:24,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 370 flow [2024-06-04 18:10:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:10:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:10:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-04 18:10:24,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-04 18:10:24,654 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 233 flow. Second operand 6 states and 65 transitions. [2024-06-04 18:10:24,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 370 flow [2024-06-04 18:10:24,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 349 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:24,657 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 267 flow [2024-06-04 18:10:24,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-04 18:10:24,658 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-04 18:10:24,658 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 267 flow [2024-06-04 18:10:24,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:24,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:24,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:24,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 18:10:24,659 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-04 18:10:24,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash 312279589, now seen corresponding path program 3 times [2024-06-04 18:10:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103286056] [2024-06-04 18:10:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:27,731 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-04 18:10:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103286056] [2024-06-04 18:10:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103286056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:27,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031987703] [2024-06-04 18:10:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:27,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:27,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:27,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:27,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:27,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:27,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:27,968 INFO L124 PetriNetUnfolderBase]: 154/286 cut-off events. [2024-06-04 18:10:27,969 INFO L125 PetriNetUnfolderBase]: For 1202/1205 co-relation queries the response was YES. [2024-06-04 18:10:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 286 events. 154/286 cut-off events. For 1202/1205 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 960 event pairs, 53 based on Foata normal form. 4/286 useless extension candidates. Maximal degree in co-relation 1081. Up to 239 conditions per place. [2024-06-04 18:10:27,971 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 30 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2024-06-04 18:10:27,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 375 flow [2024-06-04 18:10:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:10:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:10:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-04 18:10:27,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 18:10:27,973 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 267 flow. Second operand 6 states and 66 transitions. [2024-06-04 18:10:27,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 375 flow [2024-06-04 18:10:27,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 345 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:27,975 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 276 flow [2024-06-04 18:10:27,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-06-04 18:10:27,976 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-04 18:10:27,976 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 276 flow [2024-06-04 18:10:27,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:27,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:27,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:27,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 18:10:27,977 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-04 18:10:27,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash 312287525, now seen corresponding path program 1 times [2024-06-04 18:10:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78916582] [2024-06-04 18:10:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:31,040 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-04 18:10:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:31,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78916582] [2024-06-04 18:10:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78916582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:31,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847484760] [2024-06-04 18:10:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:31,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:31,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 276 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-04 18:10:31,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:31,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:31,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:31,361 INFO L124 PetriNetUnfolderBase]: 173/319 cut-off events. [2024-06-04 18:10:31,361 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-06-04 18:10:31,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 319 events. 173/319 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1115 event pairs, 38 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 1174. Up to 192 conditions per place. [2024-06-04 18:10:31,364 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 39 selfloop transitions, 23 changer transitions 0/64 dead transitions. [2024-06-04 18:10:31,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 504 flow [2024-06-04 18:10:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-04 18:10:31,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 18:10:31,366 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 276 flow. Second operand 7 states and 85 transitions. [2024-06-04 18:10:31,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 504 flow [2024-06-04 18:10:31,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 459 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 18:10:31,370 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 352 flow [2024-06-04 18:10:31,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-04 18:10:31,371 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-04 18:10:31,371 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 352 flow [2024-06-04 18:10:31,371 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-04 18:10:31,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:31,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:31,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 18:10:31,372 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-04 18:10:31,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1229324189, now seen corresponding path program 1 times [2024-06-04 18:10:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208849157] [2024-06-04 18:10:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:34,234 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-04 18:10:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:34,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208849157] [2024-06-04 18:10:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208849157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725199712] [2024-06-04 18:10:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:34,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:34,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:34,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 352 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-04 18:10:34,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:34,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:34,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:34,536 INFO L124 PetriNetUnfolderBase]: 183/335 cut-off events. [2024-06-04 18:10:34,537 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2024-06-04 18:10:34,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 335 events. 183/335 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1178 event pairs, 33 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1385. Up to 281 conditions per place. [2024-06-04 18:10:34,540 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-04 18:10:34,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 574 flow [2024-06-04 18:10:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 18:10:34,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-04 18:10:34,542 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 352 flow. Second operand 8 states and 87 transitions. [2024-06-04 18:10:34,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 574 flow [2024-06-04 18:10:34,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 550 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-04 18:10:34,546 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 423 flow [2024-06-04 18:10:34,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=423, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-06-04 18:10:34,547 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-04 18:10:34,547 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 423 flow [2024-06-04 18:10:34,547 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-04 18:10:34,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:34,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:34,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 18:10:34,548 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-04 18:10:34,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -584554399, now seen corresponding path program 2 times [2024-06-04 18:10:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791915219] [2024-06-04 18:10:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:37,481 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-04 18:10:37,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:37,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791915219] [2024-06-04 18:10:37,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791915219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:37,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:37,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:37,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103628920] [2024-06-04 18:10:37,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:37,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:37,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:37,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:37,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:37,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:37,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 423 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-04 18:10:37,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:37,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:37,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:37,855 INFO L124 PetriNetUnfolderBase]: 189/345 cut-off events. [2024-06-04 18:10:37,855 INFO L125 PetriNetUnfolderBase]: For 1876/1876 co-relation queries the response was YES. [2024-06-04 18:10:37,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 345 events. 189/345 cut-off events. For 1876/1876 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1212 event pairs, 32 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1571. Up to 285 conditions per place. [2024-06-04 18:10:37,859 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 18 changer transitions 0/73 dead transitions. [2024-06-04 18:10:37,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 629 flow [2024-06-04 18:10:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-04 18:10:37,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-04 18:10:37,860 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 423 flow. Second operand 7 states and 78 transitions. [2024-06-04 18:10:37,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 629 flow [2024-06-04 18:10:37,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 607 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:37,865 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 469 flow [2024-06-04 18:10:37,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-04 18:10:37,866 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-06-04 18:10:37,866 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 469 flow [2024-06-04 18:10:37,867 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-04 18:10:37,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:37,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:37,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 18:10:37,867 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-04 18:10:37,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash 913601579, now seen corresponding path program 3 times [2024-06-04 18:10:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:37,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629757779] [2024-06-04 18:10:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:40,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-04 18:10:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629757779] [2024-06-04 18:10:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629757779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:40,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873403326] [2024-06-04 18:10:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:40,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:40,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:40,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:40,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 469 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-04 18:10:40,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:40,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:40,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:41,093 INFO L124 PetriNetUnfolderBase]: 200/363 cut-off events. [2024-06-04 18:10:41,093 INFO L125 PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES. [2024-06-04 18:10:41,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 363 events. 200/363 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1299 event pairs, 32 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 1758. Up to 285 conditions per place. [2024-06-04 18:10:41,096 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 53 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-04 18:10:41,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 735 flow [2024-06-04 18:10:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-04 18:10:41,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-04 18:10:41,098 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 469 flow. Second operand 7 states and 79 transitions. [2024-06-04 18:10:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 735 flow [2024-06-04 18:10:41,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 683 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 18:10:41,104 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 521 flow [2024-06-04 18:10:41,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-06-04 18:10:41,105 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-04 18:10:41,105 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 521 flow [2024-06-04 18:10:41,106 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-04 18:10:41,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:41,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:41,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 18:10:41,106 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-04 18:10:41,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1090733099, now seen corresponding path program 4 times [2024-06-04 18:10:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679140316] [2024-06-04 18:10:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:44,063 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-04 18:10:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679140316] [2024-06-04 18:10:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679140316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:44,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257689501] [2024-06-04 18:10:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:44,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:44,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:44,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:44,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 521 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-04 18:10:44,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:44,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:44,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:44,362 INFO L124 PetriNetUnfolderBase]: 210/383 cut-off events. [2024-06-04 18:10:44,363 INFO L125 PetriNetUnfolderBase]: For 2702/2708 co-relation queries the response was YES. [2024-06-04 18:10:44,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 383 events. 210/383 cut-off events. For 2702/2708 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1420 event pairs, 39 based on Foata normal form. 7/384 useless extension candidates. Maximal degree in co-relation 1770. Up to 193 conditions per place. [2024-06-04 18:10:44,367 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2024-06-04 18:10:44,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 807 flow [2024-06-04 18:10:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 18:10:44,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-04 18:10:44,368 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 521 flow. Second operand 7 states and 87 transitions. [2024-06-04 18:10:44,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 807 flow [2024-06-04 18:10:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 785 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:44,375 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 623 flow [2024-06-04 18:10:44,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=623, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-06-04 18:10:44,376 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2024-06-04 18:10:44,376 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 623 flow [2024-06-04 18:10:44,377 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-04 18:10:44,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:44,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:44,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 18:10:44,377 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-04 18:10:44,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1090979363, now seen corresponding path program 1 times [2024-06-04 18:10:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524704827] [2024-06-04 18:10:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:47,696 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-04 18:10:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524704827] [2024-06-04 18:10:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524704827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671353825] [2024-06-04 18:10:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:47,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:47,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:47,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:47,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 623 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-04 18:10:47,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:47,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:48,086 INFO L124 PetriNetUnfolderBase]: 230/435 cut-off events. [2024-06-04 18:10:48,087 INFO L125 PetriNetUnfolderBase]: For 3545/3551 co-relation queries the response was YES. [2024-06-04 18:10:48,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 435 events. 230/435 cut-off events. For 3545/3551 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1714 event pairs, 42 based on Foata normal form. 15/444 useless extension candidates. Maximal degree in co-relation 2064. Up to 209 conditions per place. [2024-06-04 18:10:48,092 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 35 changer transitions 0/90 dead transitions. [2024-06-04 18:10:48,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 925 flow [2024-06-04 18:10:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 18:10:48,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-04 18:10:48,093 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 623 flow. Second operand 8 states and 97 transitions. [2024-06-04 18:10:48,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 925 flow [2024-06-04 18:10:48,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 882 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:48,102 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 668 flow [2024-06-04 18:10:48,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2024-06-04 18:10:48,103 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-04 18:10:48,103 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 668 flow [2024-06-04 18:10:48,104 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-04 18:10:48,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:48,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:48,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 18:10:48,104 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-04 18:10:48,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash 289667238, now seen corresponding path program 1 times [2024-06-04 18:10:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487842634] [2024-06-04 18:10:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:51,120 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-04 18:10:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487842634] [2024-06-04 18:10:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487842634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616210246] [2024-06-04 18:10:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:51,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:51,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:51,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 668 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-04 18:10:51,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:51,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:51,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:51,456 INFO L124 PetriNetUnfolderBase]: 237/446 cut-off events. [2024-06-04 18:10:51,457 INFO L125 PetriNetUnfolderBase]: For 2968/2968 co-relation queries the response was YES. [2024-06-04 18:10:51,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 446 events. 237/446 cut-off events. For 2968/2968 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1797 event pairs, 44 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 2203. Up to 386 conditions per place. [2024-06-04 18:10:51,461 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-04 18:10:51,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 946 flow [2024-06-04 18:10:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 18:10:51,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 18:10:51,463 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 668 flow. Second operand 8 states and 88 transitions. [2024-06-04 18:10:51,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 946 flow [2024-06-04 18:10:51,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 860 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:51,471 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 699 flow [2024-06-04 18:10:51,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=699, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-06-04 18:10:51,472 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2024-06-04 18:10:51,472 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 699 flow [2024-06-04 18:10:51,472 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-04 18:10:51,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:51,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:51,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 18:10:51,473 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-04 18:10:51,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1746930940, now seen corresponding path program 2 times [2024-06-04 18:10:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815232350] [2024-06-04 18:10:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:54,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-04 18:10:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815232350] [2024-06-04 18:10:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815232350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507285365] [2024-06-04 18:10:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:54,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:54,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:54,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 699 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-04 18:10:54,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:54,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:54,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:54,827 INFO L124 PetriNetUnfolderBase]: 235/443 cut-off events. [2024-06-04 18:10:54,827 INFO L125 PetriNetUnfolderBase]: For 3092/3092 co-relation queries the response was YES. [2024-06-04 18:10:54,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 443 events. 235/443 cut-off events. For 3092/3092 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1766 event pairs, 44 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 2149. Up to 374 conditions per place. [2024-06-04 18:10:54,831 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 65 selfloop transitions, 22 changer transitions 0/89 dead transitions. [2024-06-04 18:10:54,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 913 flow [2024-06-04 18:10:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-04 18:10:54,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-04 18:10:54,833 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 699 flow. Second operand 7 states and 78 transitions. [2024-06-04 18:10:54,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 913 flow [2024-06-04 18:10:54,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 871 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:10:54,843 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 715 flow [2024-06-04 18:10:54,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-06-04 18:10:54,844 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-04 18:10:54,844 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 715 flow [2024-06-04 18:10:54,844 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-04 18:10:54,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:54,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:54,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 18:10:54,845 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-04 18:10:54,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1718909537, now seen corresponding path program 1 times [2024-06-04 18:10:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379593189] [2024-06-04 18:10:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:57,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379593189] [2024-06-04 18:10:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379593189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063302339] [2024-06-04 18:10:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:57,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:57,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:57,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 715 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-04 18:10:57,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:57,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:57,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:57,953 INFO L124 PetriNetUnfolderBase]: 241/454 cut-off events. [2024-06-04 18:10:57,954 INFO L125 PetriNetUnfolderBase]: For 3739/3745 co-relation queries the response was YES. [2024-06-04 18:10:57,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 454 events. 241/454 cut-off events. For 3739/3745 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1850 event pairs, 50 based on Foata normal form. 6/455 useless extension candidates. Maximal degree in co-relation 2234. Up to 378 conditions per place. [2024-06-04 18:10:57,958 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 67 selfloop transitions, 20 changer transitions 1/90 dead transitions. [2024-06-04 18:10:57,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 946 flow [2024-06-04 18:10:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-04 18:10:57,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 18:10:57,960 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 715 flow. Second operand 7 states and 77 transitions. [2024-06-04 18:10:57,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 946 flow [2024-06-04 18:10:57,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 878 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 18:10:57,969 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 704 flow [2024-06-04 18:10:57,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2024-06-04 18:10:57,970 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-04 18:10:57,970 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 704 flow [2024-06-04 18:10:57,970 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-04 18:10:57,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:57,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:57,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 18:10:57,971 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-04 18:10:57,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1163541781, now seen corresponding path program 2 times [2024-06-04 18:10:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:57,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437798260] [2024-06-04 18:10:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:00,782 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-04 18:11:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437798260] [2024-06-04 18:11:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437798260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:00,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089748087] [2024-06-04 18:11:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:00,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:00,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:00,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 704 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-04 18:11:00,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:00,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:00,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:01,101 INFO L124 PetriNetUnfolderBase]: 239/454 cut-off events. [2024-06-04 18:11:01,102 INFO L125 PetriNetUnfolderBase]: For 3469/3475 co-relation queries the response was YES. [2024-06-04 18:11:01,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 454 events. 239/454 cut-off events. For 3469/3475 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1863 event pairs, 52 based on Foata normal form. 5/453 useless extension candidates. Maximal degree in co-relation 2174. Up to 250 conditions per place. [2024-06-04 18:11:01,106 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 42 changer transitions 1/92 dead transitions. [2024-06-04 18:11:01,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 1003 flow [2024-06-04 18:11:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:11:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:11:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 18:11:01,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2024-06-04 18:11:01,110 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 704 flow. Second operand 7 states and 86 transitions. [2024-06-04 18:11:01,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 1003 flow [2024-06-04 18:11:01,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 964 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:01,122 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 768 flow [2024-06-04 18:11:01,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2024-06-04 18:11:01,122 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-04 18:11:01,123 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 768 flow [2024-06-04 18:11:01,123 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-04 18:11:01,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:01,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:01,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 18:11:01,123 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-04 18:11:01,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash -332378461, now seen corresponding path program 3 times [2024-06-04 18:11:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412947280] [2024-06-04 18:11:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:04,030 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-04 18:11:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412947280] [2024-06-04 18:11:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412947280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847722781] [2024-06-04 18:11:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:04,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:04,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 768 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-04 18:11:04,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:04,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:04,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:04,283 INFO L124 PetriNetUnfolderBase]: 234/447 cut-off events. [2024-06-04 18:11:04,284 INFO L125 PetriNetUnfolderBase]: For 3666/3672 co-relation queries the response was YES. [2024-06-04 18:11:04,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 447 events. 234/447 cut-off events. For 3666/3672 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1857 event pairs, 49 based on Foata normal form. 3/444 useless extension candidates. Maximal degree in co-relation 2242. Up to 248 conditions per place. [2024-06-04 18:11:04,288 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 51 selfloop transitions, 38 changer transitions 1/92 dead transitions. [2024-06-04 18:11:04,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 1043 flow [2024-06-04 18:11:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:11:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:11:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-04 18:11:04,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-04 18:11:04,290 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 768 flow. Second operand 7 states and 83 transitions. [2024-06-04 18:11:04,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 1043 flow [2024-06-04 18:11:04,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 948 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:04,302 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 768 flow [2024-06-04 18:11:04,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-04 18:11:04,303 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-04 18:11:04,303 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 768 flow [2024-06-04 18:11:04,303 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-04 18:11:04,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:04,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:04,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 18:11:04,304 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-04 18:11:04,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash -539654234, now seen corresponding path program 1 times [2024-06-04 18:11:04,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37142925] [2024-06-04 18:11:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:07,413 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-04 18:11:07,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:07,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37142925] [2024-06-04 18:11:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37142925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:07,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002332308] [2024-06-04 18:11:07,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:07,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:07,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:07,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 768 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-04 18:11:07,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:07,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:07,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:07,688 INFO L124 PetriNetUnfolderBase]: 222/429 cut-off events. [2024-06-04 18:11:07,688 INFO L125 PetriNetUnfolderBase]: For 3728/3734 co-relation queries the response was YES. [2024-06-04 18:11:07,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 429 events. 222/429 cut-off events. For 3728/3734 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1762 event pairs, 52 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 2159. Up to 267 conditions per place. [2024-06-04 18:11:07,691 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 32 changer transitions 0/93 dead transitions. [2024-06-04 18:11:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 1047 flow [2024-06-04 18:11:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:11:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:11:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-04 18:11:07,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-04 18:11:07,692 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 768 flow. Second operand 7 states and 83 transitions. [2024-06-04 18:11:07,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 1047 flow [2024-06-04 18:11:07,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 992 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 18:11:07,702 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 811 flow [2024-06-04 18:11:07,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=811, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-04 18:11:07,703 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-04 18:11:07,703 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 811 flow [2024-06-04 18:11:07,703 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-04 18:11:07,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:07,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:07,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 18:11:07,704 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-04 18:11:07,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash -539387324, now seen corresponding path program 2 times [2024-06-04 18:11:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:07,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935366949] [2024-06-04 18:11:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:10,767 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-04 18:11:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935366949] [2024-06-04 18:11:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935366949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:10,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:11:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280662151] [2024-06-04 18:11:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:10,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:11:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:11:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:11:10,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:10,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 811 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-04 18:11:10,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:10,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:10,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:11,046 INFO L124 PetriNetUnfolderBase]: 218/422 cut-off events. [2024-06-04 18:11:11,046 INFO L125 PetriNetUnfolderBase]: For 3722/3728 co-relation queries the response was YES. [2024-06-04 18:11:11,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 422 events. 218/422 cut-off events. For 3722/3728 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1722 event pairs, 51 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2133. Up to 247 conditions per place. [2024-06-04 18:11:11,048 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 34 changer transitions 0/92 dead transitions. [2024-06-04 18:11:11,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 1061 flow [2024-06-04 18:11:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:11:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:11:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-04 18:11:11,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-06-04 18:11:11,050 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 811 flow. Second operand 7 states and 81 transitions. [2024-06-04 18:11:11,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 1061 flow [2024-06-04 18:11:11,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 965 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:11,062 INFO L231 Difference]: Finished difference. Result has 94 places, 82 transitions, 788 flow [2024-06-04 18:11:11,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=788, PETRI_PLACES=94, PETRI_TRANSITIONS=82} [2024-06-04 18:11:11,062 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-04 18:11:11,062 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 82 transitions, 788 flow [2024-06-04 18:11:11,063 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-04 18:11:11,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:11,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:11,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 18:11:11,063 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-04 18:11:11,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1298332010, now seen corresponding path program 1 times [2024-06-04 18:11:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780840565] [2024-06-04 18:11:11,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:14,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-04 18:11:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780840565] [2024-06-04 18:11:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780840565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950778061] [2024-06-04 18:11:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:14,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:14,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:14,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 788 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-04 18:11:14,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:14,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:14,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:14,510 INFO L124 PetriNetUnfolderBase]: 222/429 cut-off events. [2024-06-04 18:11:14,510 INFO L125 PetriNetUnfolderBase]: For 4017/4017 co-relation queries the response was YES. [2024-06-04 18:11:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 429 events. 222/429 cut-off events. For 4017/4017 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1746 event pairs, 31 based on Foata normal form. 2/429 useless extension candidates. Maximal degree in co-relation 2157. Up to 349 conditions per place. [2024-06-04 18:11:14,513 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-04 18:11:14,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 97 transitions, 1024 flow [2024-06-04 18:11:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-04 18:11:14,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 18:11:14,516 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 788 flow. Second operand 8 states and 84 transitions. [2024-06-04 18:11:14,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 97 transitions, 1024 flow [2024-06-04 18:11:14,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 942 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:14,524 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 750 flow [2024-06-04 18:11:14,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2024-06-04 18:11:14,525 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-04 18:11:14,525 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 750 flow [2024-06-04 18:11:14,525 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-04 18:11:14,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:14,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:14,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 18:11:14,526 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-04 18:11:14,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1746707726, now seen corresponding path program 2 times [2024-06-04 18:11:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136249262] [2024-06-04 18:11:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:17,649 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-04 18:11:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136249262] [2024-06-04 18:11:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136249262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:17,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151696022] [2024-06-04 18:11:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:17,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:17,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:17,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:17,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:17,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 750 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-04 18:11:17,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:17,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:17,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:18,097 INFO L124 PetriNetUnfolderBase]: 226/437 cut-off events. [2024-06-04 18:11:18,098 INFO L125 PetriNetUnfolderBase]: For 4287/4287 co-relation queries the response was YES. [2024-06-04 18:11:18,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 437 events. 226/437 cut-off events. For 4287/4287 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1799 event pairs, 40 based on Foata normal form. 2/437 useless extension candidates. Maximal degree in co-relation 2155. Up to 356 conditions per place. [2024-06-04 18:11:18,102 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 73 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2024-06-04 18:11:18,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 994 flow [2024-06-04 18:11:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 18:11:18,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-04 18:11:18,104 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 750 flow. Second operand 8 states and 86 transitions. [2024-06-04 18:11:18,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 994 flow [2024-06-04 18:11:18,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 960 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:18,114 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 779 flow [2024-06-04 18:11:18,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-04 18:11:18,114 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-04 18:11:18,115 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 779 flow [2024-06-04 18:11:18,115 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-04 18:11:18,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:18,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:18,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 18:11:18,115 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-04 18:11:18,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1679716326, now seen corresponding path program 1 times [2024-06-04 18:11:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:18,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129782161] [2024-06-04 18:11:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:20,974 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-04 18:11:20,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:20,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129782161] [2024-06-04 18:11:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129782161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873156068] [2024-06-04 18:11:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:20,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:20,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:20,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:20,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:21,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:21,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 779 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-04 18:11:21,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:21,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:21,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:21,264 INFO L124 PetriNetUnfolderBase]: 221/423 cut-off events. [2024-06-04 18:11:21,264 INFO L125 PetriNetUnfolderBase]: For 4451/4457 co-relation queries the response was YES. [2024-06-04 18:11:21,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 423 events. 221/423 cut-off events. For 4451/4457 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1716 event pairs, 41 based on Foata normal form. 5/424 useless extension candidates. Maximal degree in co-relation 2118. Up to 336 conditions per place. [2024-06-04 18:11:21,267 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 68 selfloop transitions, 23 changer transitions 2/95 dead transitions. [2024-06-04 18:11:21,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 95 transitions, 1005 flow [2024-06-04 18:11:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:11:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:11:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-04 18:11:21,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 18:11:21,270 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 779 flow. Second operand 7 states and 77 transitions. [2024-06-04 18:11:21,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 95 transitions, 1005 flow [2024-06-04 18:11:21,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 956 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:21,278 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 761 flow [2024-06-04 18:11:21,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2024-06-04 18:11:21,279 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-04 18:11:21,279 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 761 flow [2024-06-04 18:11:21,279 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-04 18:11:21,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:21,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:21,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 18:11:21,280 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-04 18:11:21,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1710234134, now seen corresponding path program 3 times [2024-06-04 18:11:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355982169] [2024-06-04 18:11:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:21,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:24,430 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-04 18:11:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355982169] [2024-06-04 18:11:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355982169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:24,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151162797] [2024-06-04 18:11:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:24,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:24,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:24,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 761 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-04 18:11:24,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:24,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:24,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:24,770 INFO L124 PetriNetUnfolderBase]: 208/395 cut-off events. [2024-06-04 18:11:24,771 INFO L125 PetriNetUnfolderBase]: For 4902/4902 co-relation queries the response was YES. [2024-06-04 18:11:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 395 events. 208/395 cut-off events. For 4902/4902 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1568 event pairs, 32 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 2042. Up to 306 conditions per place. [2024-06-04 18:11:24,774 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 67 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-04 18:11:24,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 96 transitions, 1003 flow [2024-06-04 18:11:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 18:11:24,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-04 18:11:24,775 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 761 flow. Second operand 8 states and 86 transitions. [2024-06-04 18:11:24,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 96 transitions, 1003 flow [2024-06-04 18:11:24,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 914 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:24,784 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 742 flow [2024-06-04 18:11:24,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=742, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2024-06-04 18:11:24,784 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-04 18:11:24,785 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 742 flow [2024-06-04 18:11:24,785 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-04 18:11:24,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:24,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:24,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 18:11:24,785 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-04 18:11:24,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 458862820, now seen corresponding path program 1 times [2024-06-04 18:11:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781690604] [2024-06-04 18:11:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:28,267 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-04 18:11:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781690604] [2024-06-04 18:11:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781690604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640830818] [2024-06-04 18:11:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:28,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:28,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:28,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 742 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-04 18:11:28,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:28,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:28,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:28,578 INFO L124 PetriNetUnfolderBase]: 212/404 cut-off events. [2024-06-04 18:11:28,579 INFO L125 PetriNetUnfolderBase]: For 5070/5076 co-relation queries the response was YES. [2024-06-04 18:11:28,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 404 events. 212/404 cut-off events. For 5070/5076 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1614 event pairs, 44 based on Foata normal form. 6/406 useless extension candidates. Maximal degree in co-relation 2058. Up to 335 conditions per place. [2024-06-04 18:11:28,581 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 24 changer transitions 0/95 dead transitions. [2024-06-04 18:11:28,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 974 flow [2024-06-04 18:11:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 18:11:28,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2024-06-04 18:11:28,584 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 742 flow. Second operand 9 states and 91 transitions. [2024-06-04 18:11:28,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 95 transitions, 974 flow [2024-06-04 18:11:28,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 914 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:28,597 INFO L231 Difference]: Finished difference. Result has 104 places, 85 transitions, 763 flow [2024-06-04 18:11:28,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=104, PETRI_TRANSITIONS=85} [2024-06-04 18:11:28,598 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-04 18:11:28,598 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 85 transitions, 763 flow [2024-06-04 18:11:28,598 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-04 18:11:28,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:28,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:28,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 18:11:28,599 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-04 18:11:28,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 459159490, now seen corresponding path program 2 times [2024-06-04 18:11:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739672030] [2024-06-04 18:11:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739672030] [2024-06-04 18:11:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739672030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066176610] [2024-06-04 18:11:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:31,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:31,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:31,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 85 transitions, 763 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-04 18:11:31,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:31,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:31,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:32,059 INFO L124 PetriNetUnfolderBase]: 238/458 cut-off events. [2024-06-04 18:11:32,060 INFO L125 PetriNetUnfolderBase]: For 7294/7300 co-relation queries the response was YES. [2024-06-04 18:11:32,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 458 events. 238/458 cut-off events. For 7294/7300 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1889 event pairs, 49 based on Foata normal form. 3/455 useless extension candidates. Maximal degree in co-relation 2387. Up to 195 conditions per place. [2024-06-04 18:11:32,064 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 36 changer transitions 0/102 dead transitions. [2024-06-04 18:11:32,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 1071 flow [2024-06-04 18:11:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 18:11:32,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-04 18:11:32,066 INFO L175 Difference]: Start difference. First operand has 104 places, 85 transitions, 763 flow. Second operand 8 states and 92 transitions. [2024-06-04 18:11:32,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 1071 flow [2024-06-04 18:11:32,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 1022 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:32,083 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 790 flow [2024-06-04 18:11:32,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2024-06-04 18:11:32,084 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-04 18:11:32,084 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 790 flow [2024-06-04 18:11:32,084 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-04 18:11:32,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:32,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:32,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 18:11:32,085 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-04 18:11:32,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1164883488, now seen corresponding path program 4 times [2024-06-04 18:11:32,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115848201] [2024-06-04 18:11:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:35,168 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-04 18:11:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115848201] [2024-06-04 18:11:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115848201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888710091] [2024-06-04 18:11:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:35,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:35,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:35,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 790 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-04 18:11:35,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:35,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:35,529 INFO L124 PetriNetUnfolderBase]: 255/497 cut-off events. [2024-06-04 18:11:35,530 INFO L125 PetriNetUnfolderBase]: For 10692/10698 co-relation queries the response was YES. [2024-06-04 18:11:35,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 497 events. 255/497 cut-off events. For 10692/10698 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2151 event pairs, 60 based on Foata normal form. 15/506 useless extension candidates. Maximal degree in co-relation 2495. Up to 259 conditions per place. [2024-06-04 18:11:35,534 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 37 changer transitions 8/102 dead transitions. [2024-06-04 18:11:35,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 102 transitions, 1062 flow [2024-06-04 18:11:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 18:11:35,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-04 18:11:35,536 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 790 flow. Second operand 8 states and 98 transitions. [2024-06-04 18:11:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 102 transitions, 1062 flow [2024-06-04 18:11:35,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 968 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:35,552 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 755 flow [2024-06-04 18:11:35,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=755, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2024-06-04 18:11:35,553 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-04 18:11:35,553 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 755 flow [2024-06-04 18:11:35,553 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-04 18:11:35,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:35,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 18:11:35,554 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-04 18:11:35,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1593587264, now seen corresponding path program 1 times [2024-06-04 18:11:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102428086] [2024-06-04 18:11:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:38,793 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-04 18:11:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102428086] [2024-06-04 18:11:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102428086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:38,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916355896] [2024-06-04 18:11:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:38,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:38,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:38,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 755 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-04 18:11:38,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:38,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:39,182 INFO L124 PetriNetUnfolderBase]: 204/396 cut-off events. [2024-06-04 18:11:39,182 INFO L125 PetriNetUnfolderBase]: For 5025/5031 co-relation queries the response was YES. [2024-06-04 18:11:39,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 396 events. 204/396 cut-off events. For 5025/5031 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1602 event pairs, 27 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1963. Up to 307 conditions per place. [2024-06-04 18:11:39,186 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 78 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-04 18:11:39,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 987 flow [2024-06-04 18:11:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 18:11:39,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-04 18:11:39,188 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 755 flow. Second operand 8 states and 82 transitions. [2024-06-04 18:11:39,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 987 flow [2024-06-04 18:11:39,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 96 transitions, 856 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 18:11:39,198 INFO L231 Difference]: Finished difference. Result has 106 places, 83 transitions, 670 flow [2024-06-04 18:11:39,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2024-06-04 18:11:39,198 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-04 18:11:39,199 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 670 flow [2024-06-04 18:11:39,199 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-04 18:11:39,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:39,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:39,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 18:11:39,199 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-04 18:11:39,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -843400768, now seen corresponding path program 2 times [2024-06-04 18:11:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344769285] [2024-06-04 18:11:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344769285] [2024-06-04 18:11:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344769285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:42,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547127097] [2024-06-04 18:11:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:42,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:42,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:42,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 670 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-04 18:11:42,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:42,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:42,578 INFO L124 PetriNetUnfolderBase]: 215/417 cut-off events. [2024-06-04 18:11:42,578 INFO L125 PetriNetUnfolderBase]: For 5683/5689 co-relation queries the response was YES. [2024-06-04 18:11:42,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 417 events. 215/417 cut-off events. For 5683/5689 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1724 event pairs, 38 based on Foata normal form. 6/419 useless extension candidates. Maximal degree in co-relation 1947. Up to 299 conditions per place. [2024-06-04 18:11:42,582 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 75 selfloop transitions, 22 changer transitions 0/99 dead transitions. [2024-06-04 18:11:42,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 972 flow [2024-06-04 18:11:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 18:11:42,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-04 18:11:42,587 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 670 flow. Second operand 8 states and 86 transitions. [2024-06-04 18:11:42,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 972 flow [2024-06-04 18:11:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 938 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:42,598 INFO L231 Difference]: Finished difference. Result has 108 places, 85 transitions, 702 flow [2024-06-04 18:11:42,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2024-06-04 18:11:42,599 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-04 18:11:42,599 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 702 flow [2024-06-04 18:11:42,599 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-04 18:11:42,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:42,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:42,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 18:11:42,599 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-04 18:11:42,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash -843397048, now seen corresponding path program 3 times [2024-06-04 18:11:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:42,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711334377] [2024-06-04 18:11:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:42,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:45,813 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-04 18:11:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711334377] [2024-06-04 18:11:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711334377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780975178] [2024-06-04 18:11:45,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:45,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:45,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:45,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:45,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 702 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-04 18:11:45,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:45,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:46,143 INFO L124 PetriNetUnfolderBase]: 212/412 cut-off events. [2024-06-04 18:11:46,144 INFO L125 PetriNetUnfolderBase]: For 5525/5531 co-relation queries the response was YES. [2024-06-04 18:11:46,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 412 events. 212/412 cut-off events. For 5525/5531 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1694 event pairs, 37 based on Foata normal form. 6/414 useless extension candidates. Maximal degree in co-relation 1911. Up to 317 conditions per place. [2024-06-04 18:11:46,146 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 72 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-04 18:11:46,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 98 transitions, 938 flow [2024-06-04 18:11:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-04 18:11:46,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 18:11:46,148 INFO L175 Difference]: Start difference. First operand has 108 places, 85 transitions, 702 flow. Second operand 8 states and 84 transitions. [2024-06-04 18:11:46,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 98 transitions, 938 flow [2024-06-04 18:11:46,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 98 transitions, 900 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 18:11:46,159 INFO L231 Difference]: Finished difference. Result has 112 places, 85 transitions, 717 flow [2024-06-04 18:11:46,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=112, PETRI_TRANSITIONS=85} [2024-06-04 18:11:46,160 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-04 18:11:46,160 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 717 flow [2024-06-04 18:11:46,160 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-04 18:11:46,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:46,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:46,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 18:11:46,161 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-04 18:11:46,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash 203800926, now seen corresponding path program 1 times [2024-06-04 18:11:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:46,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634221473] [2024-06-04 18:11:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:49,549 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-04 18:11:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634221473] [2024-06-04 18:11:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634221473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930775807] [2024-06-04 18:11:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:49,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:49,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:49,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 717 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-04 18:11:49,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:49,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:49,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:49,858 INFO L124 PetriNetUnfolderBase]: 260/512 cut-off events. [2024-06-04 18:11:49,858 INFO L125 PetriNetUnfolderBase]: For 12538/12544 co-relation queries the response was YES. [2024-06-04 18:11:49,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 512 events. 260/512 cut-off events. For 12538/12544 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2261 event pairs, 51 based on Foata normal form. 9/515 useless extension candidates. Maximal degree in co-relation 2555. Up to 198 conditions per place. [2024-06-04 18:11:49,861 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 57 selfloop transitions, 41 changer transitions 6/106 dead transitions. [2024-06-04 18:11:49,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 106 transitions, 1069 flow [2024-06-04 18:11:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 18:11:49,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-04 18:11:49,869 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 717 flow. Second operand 8 states and 98 transitions. [2024-06-04 18:11:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 106 transitions, 1069 flow [2024-06-04 18:11:49,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 1016 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:49,895 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 744 flow [2024-06-04 18:11:49,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=113, PETRI_TRANSITIONS=84} [2024-06-04 18:11:49,896 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-04 18:11:49,896 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 744 flow [2024-06-04 18:11:49,896 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-04 18:11:49,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:49,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:49,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 18:11:49,897 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-04 18:11:49,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 203793486, now seen corresponding path program 2 times [2024-06-04 18:11:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17536670] [2024-06-04 18:11:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:53,237 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-04 18:11:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17536670] [2024-06-04 18:11:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17536670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:53,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065728465] [2024-06-04 18:11:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:53,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:53,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:53,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:53,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:53,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 84 transitions, 744 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-04 18:11:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:53,542 INFO L124 PetriNetUnfolderBase]: 250/498 cut-off events. [2024-06-04 18:11:53,542 INFO L125 PetriNetUnfolderBase]: For 13417/13423 co-relation queries the response was YES. [2024-06-04 18:11:53,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 498 events. 250/498 cut-off events. For 13417/13423 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2203 event pairs, 61 based on Foata normal form. 13/505 useless extension candidates. Maximal degree in co-relation 2463. Up to 274 conditions per place. [2024-06-04 18:11:53,545 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 40 changer transitions 7/101 dead transitions. [2024-06-04 18:11:53,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 101 transitions, 1018 flow [2024-06-04 18:11:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-04 18:11:53,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 18:11:53,546 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 744 flow. Second operand 8 states and 95 transitions. [2024-06-04 18:11:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 101 transitions, 1018 flow [2024-06-04 18:11:53,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 101 transitions, 934 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:53,565 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 737 flow [2024-06-04 18:11:53,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=737, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-04 18:11:53,565 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-04 18:11:53,565 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 737 flow [2024-06-04 18:11:53,565 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-04 18:11:53,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:53,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:53,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 18:11:53,566 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-04 18:11:53,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1477646264, now seen corresponding path program 4 times [2024-06-04 18:11:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169038626] [2024-06-04 18:11:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:56,677 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-04 18:11:56,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:56,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169038626] [2024-06-04 18:11:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169038626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:56,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340987905] [2024-06-04 18:11:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:56,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:56,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:56,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 737 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-04 18:11:56,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:56,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:56,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:56,964 INFO L124 PetriNetUnfolderBase]: 208/412 cut-off events. [2024-06-04 18:11:56,965 INFO L125 PetriNetUnfolderBase]: For 6393/6399 co-relation queries the response was YES. [2024-06-04 18:11:56,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 412 events. 208/412 cut-off events. For 6393/6399 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1728 event pairs, 43 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 2005. Up to 236 conditions per place. [2024-06-04 18:11:56,967 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 34 changer transitions 0/95 dead transitions. [2024-06-04 18:11:56,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 95 transitions, 979 flow [2024-06-04 18:11:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 18:11:56,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 18:11:56,968 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 737 flow. Second operand 8 states and 88 transitions. [2024-06-04 18:11:56,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 95 transitions, 979 flow [2024-06-04 18:11:56,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 95 transitions, 877 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:56,984 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 721 flow [2024-06-04 18:11:56,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2024-06-04 18:11:56,985 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-04 18:11:56,985 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 721 flow [2024-06-04 18:11:56,985 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-04 18:11:56,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:56,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:56,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 18:11:56,985 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-04 18:11:56,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1477649984, now seen corresponding path program 5 times [2024-06-04 18:11:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174044032] [2024-06-04 18:11:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:00,050 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-04 18:12:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174044032] [2024-06-04 18:12:00,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174044032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:00,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:00,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575003098] [2024-06-04 18:12:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:00,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:00,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:00,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:00,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 721 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-04 18:12:00,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:00,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:00,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:00,271 INFO L124 PetriNetUnfolderBase]: 205/407 cut-off events. [2024-06-04 18:12:00,271 INFO L125 PetriNetUnfolderBase]: For 5919/5925 co-relation queries the response was YES. [2024-06-04 18:12:00,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 407 events. 205/407 cut-off events. For 5919/5925 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1698 event pairs, 36 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1893. Up to 195 conditions per place. [2024-06-04 18:12:00,273 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 37 changer transitions 0/95 dead transitions. [2024-06-04 18:12:00,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 95 transitions, 947 flow [2024-06-04 18:12:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 18:12:00,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-04 18:12:00,276 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 721 flow. Second operand 8 states and 89 transitions. [2024-06-04 18:12:00,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 95 transitions, 947 flow [2024-06-04 18:12:00,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 871 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 18:12:00,288 INFO L231 Difference]: Finished difference. Result has 116 places, 83 transitions, 724 flow [2024-06-04 18:12:00,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=724, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2024-06-04 18:12:00,289 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-06-04 18:12:00,289 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 724 flow [2024-06-04 18:12:00,289 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-04 18:12:00,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:00,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:00,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 18:12:00,290 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-04 18:12:00,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1083136204, now seen corresponding path program 3 times [2024-06-04 18:12:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263526972] [2024-06-04 18:12:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:03,652 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-04 18:12:03,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:03,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263526972] [2024-06-04 18:12:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263526972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:12:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27843667] [2024-06-04 18:12:03,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:03,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:12:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:12:03,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:12:03,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:03,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 724 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-04 18:12:03,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:03,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:03,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:03,995 INFO L124 PetriNetUnfolderBase]: 221/439 cut-off events. [2024-06-04 18:12:03,996 INFO L125 PetriNetUnfolderBase]: For 8126/8132 co-relation queries the response was YES. [2024-06-04 18:12:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 439 events. 221/439 cut-off events. For 8126/8132 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1889 event pairs, 42 based on Foata normal form. 7/440 useless extension candidates. Maximal degree in co-relation 1997. Up to 250 conditions per place. [2024-06-04 18:12:03,998 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 35 changer transitions 0/101 dead transitions. [2024-06-04 18:12:03,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 101 transitions, 994 flow [2024-06-04 18:12:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:12:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:12:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 18:12:03,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2024-06-04 18:12:03,999 INFO L175 Difference]: Start difference. First operand has 116 places, 83 transitions, 724 flow. Second operand 9 states and 101 transitions. [2024-06-04 18:12:03,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 101 transitions, 994 flow [2024-06-04 18:12:04,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 101 transitions, 903 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 18:12:04,014 INFO L231 Difference]: Finished difference. Result has 118 places, 86 transitions, 735 flow [2024-06-04 18:12:04,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=735, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2024-06-04 18:12:04,014 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-04 18:12:04,014 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 735 flow [2024-06-04 18:12:04,014 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-04 18:12:04,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:04,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:04,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 18:12:04,015 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-04 18:12:04,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1083345454, now seen corresponding path program 4 times [2024-06-04 18:12:04,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:04,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322259069] [2024-06-04 18:12:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:07,287 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-04 18:12:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322259069] [2024-06-04 18:12:07,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322259069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:07,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:07,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496465490] [2024-06-04 18:12:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:07,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:07,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:07,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:07,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 735 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-04 18:12:07,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:07,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:07,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:07,613 INFO L124 PetriNetUnfolderBase]: 248/500 cut-off events. [2024-06-04 18:12:07,613 INFO L125 PetriNetUnfolderBase]: For 12143/12149 co-relation queries the response was YES. [2024-06-04 18:12:07,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 500 events. 248/500 cut-off events. For 12143/12149 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2237 event pairs, 57 based on Foata normal form. 9/503 useless extension candidates. Maximal degree in co-relation 2339. Up to 203 conditions per place. [2024-06-04 18:12:07,616 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 63 selfloop transitions, 29 changer transitions 11/105 dead transitions. [2024-06-04 18:12:07,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 105 transitions, 1079 flow [2024-06-04 18:12:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 18:12:07,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-04 18:12:07,617 INFO L175 Difference]: Start difference. First operand has 118 places, 86 transitions, 735 flow. Second operand 8 states and 99 transitions. [2024-06-04 18:12:07,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 105 transitions, 1079 flow [2024-06-04 18:12:07,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 105 transitions, 984 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 18:12:07,635 INFO L231 Difference]: Finished difference. Result has 118 places, 80 transitions, 654 flow [2024-06-04 18:12:07,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=118, PETRI_TRANSITIONS=80} [2024-06-04 18:12:07,636 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-04 18:12:07,636 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 80 transitions, 654 flow [2024-06-04 18:12:07,636 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-04 18:12:07,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:07,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:07,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 18:12:07,637 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-04 18:12:07,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1349042734, now seen corresponding path program 5 times [2024-06-04 18:12:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821491029] [2024-06-04 18:12:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821491029] [2024-06-04 18:12:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821491029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80878849] [2024-06-04 18:12:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:11,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:11,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 80 transitions, 654 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-04 18:12:11,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:11,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:11,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:11,233 INFO L124 PetriNetUnfolderBase]: 235/481 cut-off events. [2024-06-04 18:12:11,233 INFO L125 PetriNetUnfolderBase]: For 13867/13873 co-relation queries the response was YES. [2024-06-04 18:12:11,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 481 events. 235/481 cut-off events. For 13867/13873 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2138 event pairs, 60 based on Foata normal form. 9/484 useless extension candidates. Maximal degree in co-relation 2239. Up to 202 conditions per place. [2024-06-04 18:12:11,237 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 23 changer transitions 11/97 dead transitions. [2024-06-04 18:12:11,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 97 transitions, 964 flow [2024-06-04 18:12:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 18:12:11,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-04 18:12:11,238 INFO L175 Difference]: Start difference. First operand has 118 places, 80 transitions, 654 flow. Second operand 8 states and 91 transitions. [2024-06-04 18:12:11,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 97 transitions, 964 flow [2024-06-04 18:12:11,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 892 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-04 18:12:11,266 INFO L231 Difference]: Finished difference. Result has 112 places, 75 transitions, 605 flow [2024-06-04 18:12:11,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=605, PETRI_PLACES=112, PETRI_TRANSITIONS=75} [2024-06-04 18:12:11,266 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-04 18:12:11,266 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 75 transitions, 605 flow [2024-06-04 18:12:11,267 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-04 18:12:11,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:11,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:11,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 18:12:11,267 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-04 18:12:11,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1748683931, now seen corresponding path program 1 times [2024-06-04 18:12:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432563190] [2024-06-04 18:12:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:14,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432563190] [2024-06-04 18:12:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432563190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:12:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057500249] [2024-06-04 18:12:14,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:14,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:12:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:12:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:12:15,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:15,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 75 transitions, 605 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:15,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:15,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:15,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:15,330 INFO L124 PetriNetUnfolderBase]: 187/377 cut-off events. [2024-06-04 18:12:15,330 INFO L125 PetriNetUnfolderBase]: For 6010/6016 co-relation queries the response was YES. [2024-06-04 18:12:15,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 377 events. 187/377 cut-off events. For 6010/6016 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1528 event pairs, 31 based on Foata normal form. 10/383 useless extension candidates. Maximal degree in co-relation 1537. Up to 264 conditions per place. [2024-06-04 18:12:15,332 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 11 changer transitions 18/92 dead transitions. [2024-06-04 18:12:15,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 92 transitions, 835 flow [2024-06-04 18:12:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:12:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:12:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 18:12:15,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2024-06-04 18:12:15,333 INFO L175 Difference]: Start difference. First operand has 112 places, 75 transitions, 605 flow. Second operand 9 states and 91 transitions. [2024-06-04 18:12:15,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 92 transitions, 835 flow [2024-06-04 18:12:15,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 92 transitions, 789 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 18:12:15,342 INFO L231 Difference]: Finished difference. Result has 108 places, 70 transitions, 552 flow [2024-06-04 18:12:15,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=108, PETRI_TRANSITIONS=70} [2024-06-04 18:12:15,343 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-04 18:12:15,343 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 70 transitions, 552 flow [2024-06-04 18:12:15,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:15,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:15,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:15,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 18:12:15,344 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-04 18:12:15,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash 32262263, now seen corresponding path program 2 times [2024-06-04 18:12:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543953130] [2024-06-04 18:12:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:18,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543953130] [2024-06-04 18:12:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543953130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:18,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751109487] [2024-06-04 18:12:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:18,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:18,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:18,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 70 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:18,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:18,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:18,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:18,832 INFO L124 PetriNetUnfolderBase]: 164/336 cut-off events. [2024-06-04 18:12:18,832 INFO L125 PetriNetUnfolderBase]: For 4982/4988 co-relation queries the response was YES. [2024-06-04 18:12:18,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 336 events. 164/336 cut-off events. For 4982/4988 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1318 event pairs, 17 based on Foata normal form. 7/337 useless extension candidates. Maximal degree in co-relation 1368. Up to 98 conditions per place. [2024-06-04 18:12:18,834 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 19 changer transitions 16/81 dead transitions. [2024-06-04 18:12:18,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 81 transitions, 740 flow [2024-06-04 18:12:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2024-06-04 18:12:18,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-04 18:12:18,835 INFO L175 Difference]: Start difference. First operand has 108 places, 70 transitions, 552 flow. Second operand 8 states and 78 transitions. [2024-06-04 18:12:18,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 81 transitions, 740 flow [2024-06-04 18:12:18,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 81 transitions, 710 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 18:12:18,843 INFO L231 Difference]: Finished difference. Result has 101 places, 60 transitions, 478 flow [2024-06-04 18:12:18,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=101, PETRI_TRANSITIONS=60} [2024-06-04 18:12:18,843 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-04 18:12:18,843 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 60 transitions, 478 flow [2024-06-04 18:12:18,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:18,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:18,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:18,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 18:12:18,844 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-04 18:12:18,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1338213465, now seen corresponding path program 3 times [2024-06-04 18:12:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:18,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48652454] [2024-06-04 18:12:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:22,065 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-04 18:12:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:22,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48652454] [2024-06-04 18:12:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48652454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:22,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586707018] [2024-06-04 18:12:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:22,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:22,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:22,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 60 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:22,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:22,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:22,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:22,328 INFO L124 PetriNetUnfolderBase]: 134/290 cut-off events. [2024-06-04 18:12:22,328 INFO L125 PetriNetUnfolderBase]: For 4001/4007 co-relation queries the response was YES. [2024-06-04 18:12:22,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 290 events. 134/290 cut-off events. For 4001/4007 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1110 event pairs, 22 based on Foata normal form. 7/291 useless extension candidates. Maximal degree in co-relation 1192. Up to 88 conditions per place. [2024-06-04 18:12:22,330 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 21 selfloop transitions, 7 changer transitions 41/71 dead transitions. [2024-06-04 18:12:22,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 71 transitions, 650 flow [2024-06-04 18:12:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-04 18:12:22,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:12:22,331 INFO L175 Difference]: Start difference. First operand has 101 places, 60 transitions, 478 flow. Second operand 8 states and 80 transitions. [2024-06-04 18:12:22,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 71 transitions, 650 flow [2024-06-04 18:12:22,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 71 transitions, 602 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 18:12:22,336 INFO L231 Difference]: Finished difference. Result has 93 places, 26 transitions, 171 flow [2024-06-04 18:12:22,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=93, PETRI_TRANSITIONS=26} [2024-06-04 18:12:22,337 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-04 18:12:22,337 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 26 transitions, 171 flow [2024-06-04 18:12:22,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:22,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:22,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 18:12:22,338 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-04 18:12:22,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash -782699907, now seen corresponding path program 4 times [2024-06-04 18:12:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295525107] [2024-06-04 18:12:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:26,145 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-04 18:12:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:26,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295525107] [2024-06-04 18:12:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295525107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:26,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:12:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160954271] [2024-06-04 18:12:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:26,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:12:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:12:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:12:26,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:26,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 26 transitions, 171 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:26,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:26,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:26,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:26,434 INFO L124 PetriNetUnfolderBase]: 49/113 cut-off events. [2024-06-04 18:12:26,434 INFO L125 PetriNetUnfolderBase]: For 2053/2053 co-relation queries the response was YES. [2024-06-04 18:12:26,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 113 events. 49/113 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 8 based on Foata normal form. 6/118 useless extension candidates. Maximal degree in co-relation 418. Up to 59 conditions per place. [2024-06-04 18:12:26,435 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2024-06-04 18:12:26,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 35 transitions, 259 flow [2024-06-04 18:12:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2024-06-04 18:12:26,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-04 18:12:26,436 INFO L175 Difference]: Start difference. First operand has 93 places, 26 transitions, 171 flow. Second operand 8 states and 72 transitions. [2024-06-04 18:12:26,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 35 transitions, 259 flow [2024-06-04 18:12:26,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 198 flow, removed 19 selfloop flow, removed 25 redundant places. [2024-06-04 18:12:26,437 INFO L231 Difference]: Finished difference. Result has 53 places, 23 transitions, 109 flow [2024-06-04 18:12:26,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=109, PETRI_PLACES=53, PETRI_TRANSITIONS=23} [2024-06-04 18:12:26,438 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-04 18:12:26,438 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 23 transitions, 109 flow [2024-06-04 18:12:26,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:26,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:26,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 18:12:26,438 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:26,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1652830443, now seen corresponding path program 1 times [2024-06-04 18:12:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684866902] [2024-06-04 18:12:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:30,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684866902] [2024-06-04 18:12:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684866902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:30,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:30,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:12:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338004158] [2024-06-04 18:12:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:30,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:12:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:12:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:12:30,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:30,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 23 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:30,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:30,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:30,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:30,748 INFO L124 PetriNetUnfolderBase]: 31/75 cut-off events. [2024-06-04 18:12:30,748 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-04 18:12:30,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 75 events. 31/75 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 212. Up to 22 conditions per place. [2024-06-04 18:12:30,748 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 0 selfloop transitions, 0 changer transitions 32/32 dead transitions. [2024-06-04 18:12:30,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 32 transitions, 169 flow [2024-06-04 18:12:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:12:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:12:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2024-06-04 18:12:30,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27 [2024-06-04 18:12:30,749 INFO L175 Difference]: Start difference. First operand has 53 places, 23 transitions, 109 flow. Second operand 10 states and 81 transitions. [2024-06-04 18:12:30,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 32 transitions, 169 flow [2024-06-04 18:12:30,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-04 18:12:30,750 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2024-06-04 18:12:30,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2024-06-04 18:12:30,750 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-04 18:12:30,750 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2024-06-04 18:12:30,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:30,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 18:12:30,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 18:12:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 18:12:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 18:12:30,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 18:12:30,754 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:30,757 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 18:12:30,758 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 18:12:30,761 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 18:12:30,761 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 18:12:30,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 06:12:30 BasicIcfg [2024-06-04 18:12:30,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 18:12:30,763 INFO L158 Benchmark]: Toolchain (without parser) took 155093.77ms. Allocated memory was 182.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 145.7MB in the beginning and 817.0MB in the end (delta: -671.3MB). Peak memory consumption was 410.6MB. Max. memory is 16.1GB. [2024-06-04 18:12:30,763 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:12:30,763 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:12:30,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.00ms. Allocated memory is still 182.5MB. Free memory was 145.7MB in the beginning and 99.5MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-04 18:12:30,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.29ms. Allocated memory is still 182.5MB. Free memory was 99.5MB in the beginning and 139.1MB in the end (delta: -39.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-06-04 18:12:30,764 INFO L158 Benchmark]: Boogie Preprocessor took 142.06ms. Allocated memory is still 182.5MB. Free memory was 139.1MB in the beginning and 132.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 18:12:30,765 INFO L158 Benchmark]: RCFGBuilder took 1165.49ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 132.8MB in the beginning and 212.4MB in the end (delta: -79.6MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2024-06-04 18:12:30,765 INFO L158 Benchmark]: TraceAbstraction took 152818.15ms. Allocated memory was 270.5MB in the beginning and 1.3GB in the end (delta: 994.1MB). Free memory was 211.8MB in the beginning and 817.0MB in the end (delta: -605.2MB). Peak memory consumption was 389.9MB. Max. memory is 16.1GB. [2024-06-04 18:12:30,766 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.19ms. Allocated memory is still 130.0MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.00ms. Allocated memory is still 182.5MB. Free memory was 145.7MB in the beginning and 99.5MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.29ms. Allocated memory is still 182.5MB. Free memory was 99.5MB in the beginning and 139.1MB in the end (delta: -39.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.06ms. Allocated memory is still 182.5MB. Free memory was 139.1MB in the beginning and 132.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.49ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 132.8MB in the beginning and 212.4MB in the end (delta: -79.6MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * TraceAbstraction took 152818.15ms. Allocated memory was 270.5MB in the beginning and 1.3GB in the end (delta: 994.1MB). Free memory was 211.8MB in the beginning and 817.0MB in the end (delta: -605.2MB). Peak memory consumption was 389.9MB. 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, 47 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: 152.7s, OverallIterations: 44, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1059 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8755 IncrementalHoareTripleChecker+Invalid, 9153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 175 mSDtfsCounter, 8755 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=811occurred in iteration=21, InterpolantAutomatonStates: 322, 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.3s SatisfiabilityAnalysisTime, 136.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 25075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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-04 18:12:30,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE