./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe028_power.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/protection/safe028_power.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/safe028_power.i ./goblint.2024-05-21_14-57-05.files/protection/safe028_power.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 15:43:39,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:43:39,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:43:39,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:43:39,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:43:39,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:43:39,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:43:39,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:43:39,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:43:39,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:43:39,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:43:39,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:43:39,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:43:39,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:43:39,804 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:43:39,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:43:39,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:43:39,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:43:39,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:43:39,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:43:39,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:43:39,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:43:39,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:43:39,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:43:39,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:43:39,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:43:39,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:43:39,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:43:39,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:43:39,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:43:39,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:43:39,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:43:39,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:43:39,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:43:39,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:43:39,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:43:39,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:43:39,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:43:39,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:43:39,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:43:39,810 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:43:39,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:43:39,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:43:39,810 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 15:43:40,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:43:40,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:43:40,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:43:40,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:43:40,048 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:43:40,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i [2024-06-04 15:43:41,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:43:41,339 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:43:41,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_power.i [2024-06-04 15:43:41,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30770a58/d38c828424f64f81a4a40ccfec9b198f/FLAG0b5fa7b52 [2024-06-04 15:43:41,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30770a58/d38c828424f64f81a4a40ccfec9b198f [2024-06-04 15:43:41,376 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:43:41,376 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:43:41,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe028_power.yml/witness.yml [2024-06-04 15:43:41,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:43:41,575 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:43:41,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:43:41,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:43:41,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:43:41,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:43:41" (1/2) ... [2024-06-04 15:43:41,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b04bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:43:41, skipping insertion in model container [2024-06-04 15:43:41,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:43:41" (1/2) ... [2024-06-04 15:43:41,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@443032dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:43:41, skipping insertion in model container [2024-06-04 15:43:41,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:43:41" (2/2) ... [2024-06-04 15:43:41,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b04bcb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:41, skipping insertion in model container [2024-06-04 15:43:41,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:43:41" (2/2) ... [2024-06-04 15:43:41,585 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:43:41,689 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:43:41,691 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-04 15:43:41,691 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-04 15:43:41,691 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-04 15:43:41,691 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:43:41,691 INFO L106 edCorrectnessWitness]: ghost_update [L862-L862] multithreaded = 1; [2024-06-04 15:43:41,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:43:42,052 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:43:42,059 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:43:42,166 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:43:42,192 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:43:42,192 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42 WrapperNode [2024-06-04 15:43:42,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:43:42,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:43:42,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:43:42,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:43:42,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,237 INFO L138 Inliner]: procedures = 175, calls = 90, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 248 [2024-06-04 15:43:42,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:43:42,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:43:42,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:43:42,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:43:42,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,343 INFO L175 MemorySlicer]: Split 48 memory accesses to 2 slices as follows [2, 46]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-06-04 15:43:42,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:43:42,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:43:42,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:43:42,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:43:42,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (1/1) ... [2024-06-04 15:43:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:43:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:43:42,420 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 15:43:42,423 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 15:43:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:43:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:43:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:43:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:43:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:43:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:43:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:43:42,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:43:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:43:42,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:43:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:43:42,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:43:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:43:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:43:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:43:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:43:42,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:43:42,455 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 15:43:42,592 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:43:42,593 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:43:42,983 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:43:42,983 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:43:43,347 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:43:43,348 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:43:43,348 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:43:43 BoogieIcfgContainer [2024-06-04 15:43:43,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:43:43,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:43:43,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:43:43,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:43:43,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:43:41" (1/4) ... [2024-06-04 15:43:43,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630e9b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:43:43, skipping insertion in model container [2024-06-04 15:43:43,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:43:41" (2/4) ... [2024-06-04 15:43:43,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630e9b7a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:43:43, skipping insertion in model container [2024-06-04 15:43:43,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:43:42" (3/4) ... [2024-06-04 15:43:43,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630e9b7a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:43:43, skipping insertion in model container [2024-06-04 15:43:43,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:43:43" (4/4) ... [2024-06-04 15:43:43,355 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2024-06-04 15:43:43,369 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:43:43,370 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:43:43,370 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:43:43,432 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:43:43,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:43:43,495 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 15:43:43,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:43:43,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:43:43,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:43:43,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 15:43:43,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:43:43,518 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;@152d324f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:43:43,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:43:43,523 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:43:43,523 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 15:43:43,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:43:43,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:43,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:43:43,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:43,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1426444067, now seen corresponding path program 1 times [2024-06-04 15:43:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336817361] [2024-06-04 15:43:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:45,547 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 15:43:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336817361] [2024-06-04 15:43:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336817361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:43:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251945666] [2024-06-04 15:43:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:45,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:43:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:45,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:43:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:43:45,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:43:45,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:45,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:45,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:43:45,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:45,999 INFO L124 PetriNetUnfolderBase]: 611/1029 cut-off events. [2024-06-04 15:43:45,999 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-04 15:43:46,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 1029 events. 611/1029 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4806 event pairs, 335 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2039. Up to 948 conditions per place. [2024-06-04 15:43:46,008 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 15:43:46,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-04 15:43:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:43:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:43:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-06-04 15:43:46,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-04 15:43:46,018 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 80 transitions. [2024-06-04 15:43:46,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-04 15:43:46,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:43:46,022 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-04 15:43:46,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-04 15:43:46,026 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-04 15:43:46,026 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-04 15:43:46,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:46,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:46,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:46,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:43:46,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:46,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 718221186, now seen corresponding path program 1 times [2024-06-04 15:43:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:46,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289528716] [2024-06-04 15:43:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:47,585 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 15:43:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289528716] [2024-06-04 15:43:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289528716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:43:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243495200] [2024-06-04 15:43:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:47,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:43:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:43:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:43:47,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:43:47,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:47,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:47,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:43:47,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:48,167 INFO L124 PetriNetUnfolderBase]: 718/1136 cut-off events. [2024-06-04 15:43:48,168 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2024-06-04 15:43:48,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1136 events. 718/1136 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5136 event pairs, 251 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 2541. Up to 1071 conditions per place. [2024-06-04 15:43:48,176 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 34 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2024-06-04 15:43:48,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 263 flow [2024-06-04 15:43:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:43:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:43:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-04 15:43:48,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-04 15:43:48,179 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 5 states and 95 transitions. [2024-06-04 15:43:48,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 263 flow [2024-06-04 15:43:48,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:43:48,182 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 197 flow [2024-06-04 15:43:48,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-04 15:43:48,185 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-04 15:43:48,185 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 197 flow [2024-06-04 15:43:48,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:48,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:48,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:48,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:43:48,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:48,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash 718311396, now seen corresponding path program 2 times [2024-06-04 15:43:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719140548] [2024-06-04 15:43:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:49,643 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 15:43:49,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:49,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719140548] [2024-06-04 15:43:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719140548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:43:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372506340] [2024-06-04 15:43:49,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:49,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:43:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:43:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:43:49,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:43:49,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:49,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:49,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:43:49,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:50,130 INFO L124 PetriNetUnfolderBase]: 716/1135 cut-off events. [2024-06-04 15:43:50,131 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-06-04 15:43:50,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1135 events. 716/1135 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5072 event pairs, 271 based on Foata normal form. 2/1137 useless extension candidates. Maximal degree in co-relation 2787. Up to 1070 conditions per place. [2024-06-04 15:43:50,137 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 39 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-04 15:43:50,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 331 flow [2024-06-04 15:43:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:43:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:43:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-04 15:43:50,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-04 15:43:50,139 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 197 flow. Second operand 5 states and 100 transitions. [2024-06-04 15:43:50,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 331 flow [2024-06-04 15:43:50,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 323 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 15:43:50,142 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 218 flow [2024-06-04 15:43:50,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-04 15:43:50,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-04 15:43:50,143 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 218 flow [2024-06-04 15:43:50,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:50,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:50,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:50,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:43:50,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:50,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 789711921, now seen corresponding path program 1 times [2024-06-04 15:43:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49679764] [2024-06-04 15:43:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:51,361 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 15:43:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49679764] [2024-06-04 15:43:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49679764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:43:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691747713] [2024-06-04 15:43:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:51,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:43:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:43:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:43:51,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:43:51,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:51,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:51,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:43:51,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:51,969 INFO L124 PetriNetUnfolderBase]: 648/1070 cut-off events. [2024-06-04 15:43:51,969 INFO L125 PetriNetUnfolderBase]: For 376/378 co-relation queries the response was YES. [2024-06-04 15:43:51,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1070 events. 648/1070 cut-off events. For 376/378 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5008 event pairs, 334 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 2553. Up to 1007 conditions per place. [2024-06-04 15:43:51,974 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 35 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2024-06-04 15:43:51,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 339 flow [2024-06-04 15:43:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:43:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:43:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-04 15:43:51,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-04 15:43:51,976 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 218 flow. Second operand 5 states and 92 transitions. [2024-06-04 15:43:51,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 339 flow [2024-06-04 15:43:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 301 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:43:51,978 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 238 flow [2024-06-04 15:43:51,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-04 15:43:51,979 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-06-04 15:43:51,979 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 238 flow [2024-06-04 15:43:51,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:43:51,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:51,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:51,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:43:51,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:51,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1567697432, now seen corresponding path program 1 times [2024-06-04 15:43:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:51,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84335193] [2024-06-04 15:43:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:53,460 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 15:43:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84335193] [2024-06-04 15:43:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84335193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:53,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:53,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:43:53,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539258810] [2024-06-04 15:43:53,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:53,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:43:53,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:43:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:43:53,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:43:53,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 15:43:53,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:53,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:43:53,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:54,440 INFO L124 PetriNetUnfolderBase]: 757/1199 cut-off events. [2024-06-04 15:43:54,440 INFO L125 PetriNetUnfolderBase]: For 411/413 co-relation queries the response was YES. [2024-06-04 15:43:54,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 1199 events. 757/1199 cut-off events. For 411/413 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5403 event pairs, 296 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 2916. Up to 1129 conditions per place. [2024-06-04 15:43:54,447 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 40 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2024-06-04 15:43:54,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 404 flow [2024-06-04 15:43:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:43:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:43:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-04 15:43:54,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2024-06-04 15:43:54,452 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 238 flow. Second operand 6 states and 112 transitions. [2024-06-04 15:43:54,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 404 flow [2024-06-04 15:43:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 64 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:43:54,457 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 303 flow [2024-06-04 15:43:54,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-06-04 15:43:54,459 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-06-04 15:43:54,459 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 303 flow [2024-06-04 15:43:54,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 15:43:54,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:54,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:43:54,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:54,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1296021808, now seen corresponding path program 2 times [2024-06-04 15:43:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:54,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058521508] [2024-06-04 15:43:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:55,940 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 15:43:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:55,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058521508] [2024-06-04 15:43:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058521508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:55,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:43:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402617440] [2024-06-04 15:43:55,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:43:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:43:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:43:55,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:43:55,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 15:43:55,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:55,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:43:55,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:56,857 INFO L124 PetriNetUnfolderBase]: 753/1193 cut-off events. [2024-06-04 15:43:56,858 INFO L125 PetriNetUnfolderBase]: For 629/631 co-relation queries the response was YES. [2024-06-04 15:43:56,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1193 events. 753/1193 cut-off events. For 629/631 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5433 event pairs, 273 based on Foata normal form. 0/1170 useless extension candidates. Maximal degree in co-relation 3024. Up to 1126 conditions per place. [2024-06-04 15:43:56,864 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 36 selfloop transitions, 20 changer transitions 0/63 dead transitions. [2024-06-04 15:43:56,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 455 flow [2024-06-04 15:43:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:43:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:43:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 15:43:56,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 15:43:56,867 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 303 flow. Second operand 6 states and 106 transitions. [2024-06-04 15:43:56,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 455 flow [2024-06-04 15:43:56,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 429 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:43:56,870 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 349 flow [2024-06-04 15:43:56,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-06-04 15:43:56,872 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-04 15:43:56,872 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 349 flow [2024-06-04 15:43:56,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 15:43:56,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:56,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:56,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:43:56,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:56,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1294746344, now seen corresponding path program 1 times [2024-06-04 15:43:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648633305] [2024-06-04 15:43:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:43:58,429 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 15:43:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:43:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648633305] [2024-06-04 15:43:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648633305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:43:58,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:43:58,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:43:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588210588] [2024-06-04 15:43:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:43:58,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:43:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:43:58,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:43:58,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:43:58,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:43:58,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 15:43:58,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:43:58,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:43:58,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:43:59,128 INFO L124 PetriNetUnfolderBase]: 652/1078 cut-off events. [2024-06-04 15:43:59,128 INFO L125 PetriNetUnfolderBase]: For 699/701 co-relation queries the response was YES. [2024-06-04 15:43:59,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1078 events. 652/1078 cut-off events. For 699/701 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5028 event pairs, 312 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 2792. Up to 1011 conditions per place. [2024-06-04 15:43:59,144 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 43 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-04 15:43:59,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 487 flow [2024-06-04 15:43:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:43:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:43:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:43:59,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-04 15:43:59,147 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 349 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:43:59,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 487 flow [2024-06-04 15:43:59,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 460 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:43:59,172 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 374 flow [2024-06-04 15:43:59,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-04 15:43:59,173 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-04 15:43:59,173 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 374 flow [2024-06-04 15:43:59,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 15:43:59,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:43:59,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:43:59,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:43:59,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:43:59,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:43:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1294704494, now seen corresponding path program 2 times [2024-06-04 15:43:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:43:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921527044] [2024-06-04 15:43:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:43:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:43:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:00,893 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 15:44:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921527044] [2024-06-04 15:44:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921527044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684806494] [2024-06-04 15:44:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:00,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:00,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:00,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 15:44:00,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:00,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:00,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:01,524 INFO L124 PetriNetUnfolderBase]: 652/1094 cut-off events. [2024-06-04 15:44:01,525 INFO L125 PetriNetUnfolderBase]: For 993/995 co-relation queries the response was YES. [2024-06-04 15:44:01,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1094 events. 652/1094 cut-off events. For 993/995 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5123 event pairs, 302 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 2974. Up to 1002 conditions per place. [2024-06-04 15:44:01,530 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 50 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2024-06-04 15:44:01,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 602 flow [2024-06-04 15:44:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-04 15:44:01,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:44:01,532 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 374 flow. Second operand 7 states and 126 transitions. [2024-06-04 15:44:01,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 602 flow [2024-06-04 15:44:01,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 562 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 15:44:01,535 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 476 flow [2024-06-04 15:44:01,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-06-04 15:44:01,535 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-04 15:44:01,535 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 476 flow [2024-06-04 15:44:01,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 15:44:01,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:01,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:01,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:44:01,536 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:01,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash -885836736, now seen corresponding path program 1 times [2024-06-04 15:44:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:01,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224941265] [2024-06-04 15:44:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:03,920 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 15:44:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224941265] [2024-06-04 15:44:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224941265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283167676] [2024-06-04 15:44:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:03,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:03,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:03,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:03,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:03,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 476 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:03,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:03,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:03,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:04,381 INFO L124 PetriNetUnfolderBase]: 738/1183 cut-off events. [2024-06-04 15:44:04,382 INFO L125 PetriNetUnfolderBase]: For 1809/1857 co-relation queries the response was YES. [2024-06-04 15:44:04,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1183 events. 738/1183 cut-off events. For 1809/1857 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5376 event pairs, 244 based on Foata normal form. 4/1183 useless extension candidates. Maximal degree in co-relation 3538. Up to 1104 conditions per place. [2024-06-04 15:44:04,388 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 22 changer transitions 0/80 dead transitions. [2024-06-04 15:44:04,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 652 flow [2024-06-04 15:44:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:44:04,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:44:04,390 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 476 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:44:04,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 652 flow [2024-06-04 15:44:04,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 80 transitions, 600 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:04,394 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 493 flow [2024-06-04 15:44:04,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=493, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-06-04 15:44:04,394 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-04 15:44:04,395 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 493 flow [2024-06-04 15:44:04,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:04,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:04,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:04,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:44:04,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:04,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 964504580, now seen corresponding path program 2 times [2024-06-04 15:44:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933918093] [2024-06-04 15:44:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:06,700 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 15:44:06,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933918093] [2024-06-04 15:44:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933918093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047343719] [2024-06-04 15:44:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:06,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:06,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:06,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:06,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 493 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:06,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:06,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:06,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:07,352 INFO L124 PetriNetUnfolderBase]: 740/1190 cut-off events. [2024-06-04 15:44:07,352 INFO L125 PetriNetUnfolderBase]: For 1804/1852 co-relation queries the response was YES. [2024-06-04 15:44:07,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3629 conditions, 1190 events. 740/1190 cut-off events. For 1804/1852 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5409 event pairs, 240 based on Foata normal form. 4/1190 useless extension candidates. Maximal degree in co-relation 3594. Up to 1108 conditions per place. [2024-06-04 15:44:07,358 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 64 selfloop transitions, 26 changer transitions 0/97 dead transitions. [2024-06-04 15:44:07,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 817 flow [2024-06-04 15:44:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 15:44:07,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-04 15:44:07,360 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 493 flow. Second operand 7 states and 130 transitions. [2024-06-04 15:44:07,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 817 flow [2024-06-04 15:44:07,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 757 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:44:07,364 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 608 flow [2024-06-04 15:44:07,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=608, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2024-06-04 15:44:07,364 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-04 15:44:07,364 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 608 flow [2024-06-04 15:44:07,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:07,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:07,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:07,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:44:07,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:07,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash 820614050, now seen corresponding path program 3 times [2024-06-04 15:44:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:07,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858579080] [2024-06-04 15:44:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:07,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:09,464 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 15:44:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858579080] [2024-06-04 15:44:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858579080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198285450] [2024-06-04 15:44:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:09,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:09,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:09,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:09,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:09,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 608 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:09,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:09,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:09,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:09,982 INFO L124 PetriNetUnfolderBase]: 741/1192 cut-off events. [2024-06-04 15:44:09,982 INFO L125 PetriNetUnfolderBase]: For 2048/2102 co-relation queries the response was YES. [2024-06-04 15:44:09,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 1192 events. 741/1192 cut-off events. For 2048/2102 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5428 event pairs, 242 based on Foata normal form. 6/1195 useless extension candidates. Maximal degree in co-relation 3734. Up to 1111 conditions per place. [2024-06-04 15:44:09,989 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 58 selfloop transitions, 28 changer transitions 0/93 dead transitions. [2024-06-04 15:44:09,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 93 transitions, 829 flow [2024-06-04 15:44:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 15:44:09,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 15:44:09,990 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 608 flow. Second operand 7 states and 124 transitions. [2024-06-04 15:44:09,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 93 transitions, 829 flow [2024-06-04 15:44:09,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 796 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 15:44:09,994 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 672 flow [2024-06-04 15:44:09,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2024-06-04 15:44:09,995 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-04 15:44:09,995 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 672 flow [2024-06-04 15:44:09,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:09,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:09,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:09,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:44:09,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:09,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1481089545, now seen corresponding path program 1 times [2024-06-04 15:44:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676126416] [2024-06-04 15:44:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:11,879 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 15:44:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676126416] [2024-06-04 15:44:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676126416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:11,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358614440] [2024-06-04 15:44:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:11,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:11,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:11,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 672 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 15:44:11,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:11,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:11,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:12,617 INFO L124 PetriNetUnfolderBase]: 654/1104 cut-off events. [2024-06-04 15:44:12,617 INFO L125 PetriNetUnfolderBase]: For 2178/2187 co-relation queries the response was YES. [2024-06-04 15:44:12,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1104 events. 654/1104 cut-off events. For 2178/2187 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5197 event pairs, 202 based on Foata normal form. 1/1105 useless extension candidates. Maximal degree in co-relation 3468. Up to 999 conditions per place. [2024-06-04 15:44:12,625 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 68 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2024-06-04 15:44:12,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 101 transitions, 934 flow [2024-06-04 15:44:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-04 15:44:12,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-04 15:44:12,626 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 672 flow. Second operand 7 states and 129 transitions. [2024-06-04 15:44:12,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 101 transitions, 934 flow [2024-06-04 15:44:12,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 101 transitions, 870 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 15:44:12,632 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 735 flow [2024-06-04 15:44:12,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=735, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2024-06-04 15:44:12,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-04 15:44:12,633 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 735 flow [2024-06-04 15:44:12,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 15:44:12,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:12,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:12,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:44:12,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:12,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1522068071, now seen corresponding path program 1 times [2024-06-04 15:44:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894114870] [2024-06-04 15:44:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:13,863 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 15:44:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894114870] [2024-06-04 15:44:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894114870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:44:13,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316427747] [2024-06-04 15:44:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:13,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:44:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:44:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:44:13,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:13,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 15:44:13,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:13,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:13,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:14,741 INFO L124 PetriNetUnfolderBase]: 927/1514 cut-off events. [2024-06-04 15:44:14,742 INFO L125 PetriNetUnfolderBase]: For 3073/3129 co-relation queries the response was YES. [2024-06-04 15:44:14,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4756 conditions, 1514 events. 927/1514 cut-off events. For 3073/3129 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7397 event pairs, 514 based on Foata normal form. 1/1512 useless extension candidates. Maximal degree in co-relation 4712. Up to 1404 conditions per place. [2024-06-04 15:44:14,756 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 79 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2024-06-04 15:44:14,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 99 transitions, 965 flow [2024-06-04 15:44:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:44:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:44:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-04 15:44:14,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-04 15:44:14,758 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 735 flow. Second operand 5 states and 93 transitions. [2024-06-04 15:44:14,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 99 transitions, 965 flow [2024-06-04 15:44:14,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 914 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:14,766 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 764 flow [2024-06-04 15:44:14,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=764, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2024-06-04 15:44:14,768 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-04 15:44:14,768 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 764 flow [2024-06-04 15:44:14,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 15:44:14,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:14,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:14,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:44:14,769 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:14,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 964713830, now seen corresponding path program 4 times [2024-06-04 15:44:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478974215] [2024-06-04 15:44:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:44:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:17,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478974215] [2024-06-04 15:44:17,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478974215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:17,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114206094] [2024-06-04 15:44:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:17,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:17,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:17,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:17,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:17,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:17,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:17,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:17,727 INFO L124 PetriNetUnfolderBase]: 735/1182 cut-off events. [2024-06-04 15:44:17,727 INFO L125 PetriNetUnfolderBase]: For 2689/2733 co-relation queries the response was YES. [2024-06-04 15:44:17,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4082 conditions, 1182 events. 735/1182 cut-off events. For 2689/2733 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5429 event pairs, 166 based on Foata normal form. 2/1181 useless extension candidates. Maximal degree in co-relation 4035. Up to 1058 conditions per place. [2024-06-04 15:44:17,734 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 77 selfloop transitions, 31 changer transitions 0/115 dead transitions. [2024-06-04 15:44:17,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 115 transitions, 1065 flow [2024-06-04 15:44:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 15:44:17,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-04 15:44:17,736 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 764 flow. Second operand 7 states and 134 transitions. [2024-06-04 15:44:17,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 115 transitions, 1065 flow [2024-06-04 15:44:17,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 1037 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-04 15:44:17,742 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 810 flow [2024-06-04 15:44:17,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=810, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-06-04 15:44:17,742 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-04 15:44:17,742 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 810 flow [2024-06-04 15:44:17,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:17,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:17,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:17,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:44:17,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:17,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash -974937927, now seen corresponding path program 1 times [2024-06-04 15:44:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378890885] [2024-06-04 15:44:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:19,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 15:44:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378890885] [2024-06-04 15:44:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378890885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804233726] [2024-06-04 15:44:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:19,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:19,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:19,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:19,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 810 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:19,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:19,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:19,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:19,937 INFO L124 PetriNetUnfolderBase]: 793/1272 cut-off events. [2024-06-04 15:44:19,938 INFO L125 PetriNetUnfolderBase]: For 3820/3820 co-relation queries the response was YES. [2024-06-04 15:44:19,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4628 conditions, 1272 events. 793/1272 cut-off events. For 3820/3820 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5909 event pairs, 242 based on Foata normal form. 4/1276 useless extension candidates. Maximal degree in co-relation 4583. Up to 1182 conditions per place. [2024-06-04 15:44:19,950 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 88 selfloop transitions, 29 changer transitions 0/123 dead transitions. [2024-06-04 15:44:19,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 123 transitions, 1209 flow [2024-06-04 15:44:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:44:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:44:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 15:44:19,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:44:19,952 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 810 flow. Second operand 8 states and 144 transitions. [2024-06-04 15:44:19,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 123 transitions, 1209 flow [2024-06-04 15:44:19,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 1125 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 15:44:19,979 INFO L231 Difference]: Finished difference. Result has 100 places, 109 transitions, 901 flow [2024-06-04 15:44:19,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=901, PETRI_PLACES=100, PETRI_TRANSITIONS=109} [2024-06-04 15:44:19,980 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-04 15:44:19,980 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 901 flow [2024-06-04 15:44:19,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:19,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:19,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:19,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:44:19,980 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:19,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:19,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1123937369, now seen corresponding path program 2 times [2024-06-04 15:44:19,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:19,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539509642] [2024-06-04 15:44:19,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:21,363 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 15:44:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539509642] [2024-06-04 15:44:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539509642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197562607] [2024-06-04 15:44:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:21,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:21,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:21,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 901 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:21,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:21,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:21,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:22,191 INFO L124 PetriNetUnfolderBase]: 797/1278 cut-off events. [2024-06-04 15:44:22,192 INFO L125 PetriNetUnfolderBase]: For 5226/5226 co-relation queries the response was YES. [2024-06-04 15:44:22,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5124 conditions, 1278 events. 797/1278 cut-off events. For 5226/5226 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5980 event pairs, 247 based on Foata normal form. 2/1280 useless extension candidates. Maximal degree in co-relation 5078. Up to 1213 conditions per place. [2024-06-04 15:44:22,198 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 24 changer transitions 0/122 dead transitions. [2024-06-04 15:44:22,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 1225 flow [2024-06-04 15:44:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 15:44:22,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 15:44:22,213 INFO L175 Difference]: Start difference. First operand has 100 places, 109 transitions, 901 flow. Second operand 7 states and 123 transitions. [2024-06-04 15:44:22,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 1225 flow [2024-06-04 15:44:22,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 122 transitions, 1145 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:22,221 INFO L231 Difference]: Finished difference. Result has 106 places, 115 transitions, 961 flow [2024-06-04 15:44:22,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=961, PETRI_PLACES=106, PETRI_TRANSITIONS=115} [2024-06-04 15:44:22,222 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-04 15:44:22,223 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 115 transitions, 961 flow [2024-06-04 15:44:22,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:22,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:22,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:22,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 15:44:22,223 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:22,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 63598799, now seen corresponding path program 3 times [2024-06-04 15:44:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440213510] [2024-06-04 15:44:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:23,665 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 15:44:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440213510] [2024-06-04 15:44:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440213510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859958269] [2024-06-04 15:44:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:23,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:23,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:23,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 115 transitions, 961 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:23,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:23,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:24,438 INFO L124 PetriNetUnfolderBase]: 797/1277 cut-off events. [2024-06-04 15:44:24,438 INFO L125 PetriNetUnfolderBase]: For 6045/6045 co-relation queries the response was YES. [2024-06-04 15:44:24,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 1277 events. 797/1277 cut-off events. For 6045/6045 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5961 event pairs, 249 based on Foata normal form. 2/1279 useless extension candidates. Maximal degree in co-relation 5271. Up to 1213 conditions per place. [2024-06-04 15:44:24,464 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 93 selfloop transitions, 25 changer transitions 0/124 dead transitions. [2024-06-04 15:44:24,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 124 transitions, 1275 flow [2024-06-04 15:44:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:44:24,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:44:24,466 INFO L175 Difference]: Start difference. First operand has 106 places, 115 transitions, 961 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:44:24,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 124 transitions, 1275 flow [2024-06-04 15:44:24,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 124 transitions, 1203 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 15:44:24,474 INFO L231 Difference]: Finished difference. Result has 110 places, 120 transitions, 1016 flow [2024-06-04 15:44:24,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1016, PETRI_PLACES=110, PETRI_TRANSITIONS=120} [2024-06-04 15:44:24,475 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-04 15:44:24,475 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 1016 flow [2024-06-04 15:44:24,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:24,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:24,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:24,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 15:44:24,476 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:24,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 70265039, now seen corresponding path program 4 times [2024-06-04 15:44:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467985857] [2024-06-04 15:44:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:26,032 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 15:44:26,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:26,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467985857] [2024-06-04 15:44:26,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467985857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:26,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397590864] [2024-06-04 15:44:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:26,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:26,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:26,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 1016 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:26,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:26,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:26,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:26,729 INFO L124 PetriNetUnfolderBase]: 801/1284 cut-off events. [2024-06-04 15:44:26,730 INFO L125 PetriNetUnfolderBase]: For 7170/7170 co-relation queries the response was YES. [2024-06-04 15:44:26,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 1284 events. 801/1284 cut-off events. For 7170/7170 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5983 event pairs, 249 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 5499. Up to 1212 conditions per place. [2024-06-04 15:44:26,737 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 89 selfloop transitions, 34 changer transitions 0/129 dead transitions. [2024-06-04 15:44:26,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 1340 flow [2024-06-04 15:44:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 15:44:26,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 15:44:26,756 INFO L175 Difference]: Start difference. First operand has 110 places, 120 transitions, 1016 flow. Second operand 7 states and 119 transitions. [2024-06-04 15:44:26,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 129 transitions, 1340 flow [2024-06-04 15:44:26,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 1277 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:26,763 INFO L231 Difference]: Finished difference. Result has 114 places, 123 transitions, 1080 flow [2024-06-04 15:44:26,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1080, PETRI_PLACES=114, PETRI_TRANSITIONS=123} [2024-06-04 15:44:26,764 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-04 15:44:26,764 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 123 transitions, 1080 flow [2024-06-04 15:44:26,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:26,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:26,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:26,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 15:44:26,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:26,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:26,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1329530609, now seen corresponding path program 5 times [2024-06-04 15:44:26,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:26,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378455226] [2024-06-04 15:44:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:28,250 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 15:44:28,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:28,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378455226] [2024-06-04 15:44:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378455226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:28,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:28,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143656459] [2024-06-04 15:44:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:28,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:28,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:28,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 123 transitions, 1080 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:28,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:28,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:28,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:29,184 INFO L124 PetriNetUnfolderBase]: 834/1337 cut-off events. [2024-06-04 15:44:29,184 INFO L125 PetriNetUnfolderBase]: For 9507/9507 co-relation queries the response was YES. [2024-06-04 15:44:29,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 1337 events. 834/1337 cut-off events. For 9507/9507 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6260 event pairs, 226 based on Foata normal form. 4/1341 useless extension candidates. Maximal degree in co-relation 6049. Up to 1194 conditions per place. [2024-06-04 15:44:29,191 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 100 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-06-04 15:44:29,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 160 transitions, 1842 flow [2024-06-04 15:44:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:44:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:44:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-04 15:44:29,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281842818428184 [2024-06-04 15:44:29,201 INFO L175 Difference]: Start difference. First operand has 114 places, 123 transitions, 1080 flow. Second operand 9 states and 158 transitions. [2024-06-04 15:44:29,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 160 transitions, 1842 flow [2024-06-04 15:44:29,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 160 transitions, 1703 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-04 15:44:29,210 INFO L231 Difference]: Finished difference. Result has 121 places, 142 transitions, 1402 flow [2024-06-04 15:44:29,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1402, PETRI_PLACES=121, PETRI_TRANSITIONS=142} [2024-06-04 15:44:29,211 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-04 15:44:29,211 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 142 transitions, 1402 flow [2024-06-04 15:44:29,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:29,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:29,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:29,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 15:44:29,212 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:29,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1330632659, now seen corresponding path program 6 times [2024-06-04 15:44:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709913858] [2024-06-04 15:44:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:30,824 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 15:44:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709913858] [2024-06-04 15:44:30,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709913858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:30,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:44:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377770444] [2024-06-04 15:44:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:30,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:44:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:44:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:44:30,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:30,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 142 transitions, 1402 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:30,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:30,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:30,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:31,556 INFO L124 PetriNetUnfolderBase]: 826/1326 cut-off events. [2024-06-04 15:44:31,557 INFO L125 PetriNetUnfolderBase]: For 12077/12077 co-relation queries the response was YES. [2024-06-04 15:44:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6612 conditions, 1326 events. 826/1326 cut-off events. For 12077/12077 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6217 event pairs, 225 based on Foata normal form. 4/1330 useless extension candidates. Maximal degree in co-relation 6554. Up to 1195 conditions per place. [2024-06-04 15:44:31,591 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 116 selfloop transitions, 40 changer transitions 0/162 dead transitions. [2024-06-04 15:44:31,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 162 transitions, 1910 flow [2024-06-04 15:44:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:44:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:44:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 15:44:31,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 15:44:31,595 INFO L175 Difference]: Start difference. First operand has 121 places, 142 transitions, 1402 flow. Second operand 8 states and 145 transitions. [2024-06-04 15:44:31,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 162 transitions, 1910 flow [2024-06-04 15:44:31,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 162 transitions, 1751 flow, removed 71 selfloop flow, removed 2 redundant places. [2024-06-04 15:44:31,609 INFO L231 Difference]: Finished difference. Result has 128 places, 142 transitions, 1336 flow [2024-06-04 15:44:31,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1336, PETRI_PLACES=128, PETRI_TRANSITIONS=142} [2024-06-04 15:44:31,609 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-04 15:44:31,610 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 142 transitions, 1336 flow [2024-06-04 15:44:31,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 15:44:31,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:31,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:31,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 15:44:31,611 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:31,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 70273967, now seen corresponding path program 1 times [2024-06-04 15:44:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341879107] [2024-06-04 15:44:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:33,531 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 15:44:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341879107] [2024-06-04 15:44:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341879107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:44:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565532224] [2024-06-04 15:44:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:33,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:44:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:33,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:44:33,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:44:33,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:33,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 142 transitions, 1336 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:44:33,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:33,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:33,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:34,243 INFO L124 PetriNetUnfolderBase]: 724/1219 cut-off events. [2024-06-04 15:44:34,244 INFO L125 PetriNetUnfolderBase]: For 10813/10813 co-relation queries the response was YES. [2024-06-04 15:44:34,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 1219 events. 724/1219 cut-off events. For 10813/10813 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5928 event pairs, 307 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 5906. Up to 1121 conditions per place. [2024-06-04 15:44:34,251 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 121 selfloop transitions, 21 changer transitions 0/149 dead transitions. [2024-06-04 15:44:34,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 149 transitions, 1680 flow [2024-06-04 15:44:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:44:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:44:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 15:44:34,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-04 15:44:34,252 INFO L175 Difference]: Start difference. First operand has 128 places, 142 transitions, 1336 flow. Second operand 8 states and 134 transitions. [2024-06-04 15:44:34,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 149 transitions, 1680 flow [2024-06-04 15:44:34,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 149 transitions, 1527 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 15:44:34,265 INFO L231 Difference]: Finished difference. Result has 129 places, 146 transitions, 1290 flow [2024-06-04 15:44:34,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1290, PETRI_PLACES=129, PETRI_TRANSITIONS=146} [2024-06-04 15:44:34,266 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-04 15:44:34,266 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 146 transitions, 1290 flow [2024-06-04 15:44:34,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:44:34,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:34,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:34,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 15:44:34,266 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:34,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1330865717, now seen corresponding path program 2 times [2024-06-04 15:44:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:34,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631183403] [2024-06-04 15:44:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:36,522 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 15:44:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631183403] [2024-06-04 15:44:36,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631183403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:36,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:44:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758442109] [2024-06-04 15:44:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:36,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:44:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:44:36,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:44:36,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:36,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 146 transitions, 1290 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:44:36,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:36,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:36,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:37,500 INFO L124 PetriNetUnfolderBase]: 727/1225 cut-off events. [2024-06-04 15:44:37,501 INFO L125 PetriNetUnfolderBase]: For 11365/11365 co-relation queries the response was YES. [2024-06-04 15:44:37,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5924 conditions, 1225 events. 727/1225 cut-off events. For 11365/11365 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6012 event pairs, 306 based on Foata normal form. 2/1225 useless extension candidates. Maximal degree in co-relation 5863. Up to 1105 conditions per place. [2024-06-04 15:44:37,508 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 114 selfloop transitions, 34 changer transitions 0/155 dead transitions. [2024-06-04 15:44:37,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 155 transitions, 1650 flow [2024-06-04 15:44:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:44:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:44:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-04 15:44:37,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-04 15:44:37,510 INFO L175 Difference]: Start difference. First operand has 129 places, 146 transitions, 1290 flow. Second operand 9 states and 157 transitions. [2024-06-04 15:44:37,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 155 transitions, 1650 flow [2024-06-04 15:44:37,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 155 transitions, 1583 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 15:44:37,523 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 1339 flow [2024-06-04 15:44:37,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1339, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2024-06-04 15:44:37,524 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-06-04 15:44:37,524 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 1339 flow [2024-06-04 15:44:37,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:44:37,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:37,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:37,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 15:44:37,525 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:37,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1330909427, now seen corresponding path program 3 times [2024-06-04 15:44:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020528595] [2024-06-04 15:44:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:39,622 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 15:44:39,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:39,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020528595] [2024-06-04 15:44:39,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020528595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:39,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:39,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:44:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595029063] [2024-06-04 15:44:39,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:39,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:44:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:39,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:44:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:44:39,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:39,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 1339 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:44:39,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:39,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:39,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:40,520 INFO L124 PetriNetUnfolderBase]: 724/1217 cut-off events. [2024-06-04 15:44:40,520 INFO L125 PetriNetUnfolderBase]: For 11699/11701 co-relation queries the response was YES. [2024-06-04 15:44:40,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5961 conditions, 1217 events. 724/1217 cut-off events. For 11699/11701 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5930 event pairs, 293 based on Foata normal form. 2/1215 useless extension candidates. Maximal degree in co-relation 5899. Up to 1077 conditions per place. [2024-06-04 15:44:40,528 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 122 selfloop transitions, 34 changer transitions 0/163 dead transitions. [2024-06-04 15:44:40,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 163 transitions, 1765 flow [2024-06-04 15:44:40,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:44:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:44:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 15:44:40,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-04 15:44:40,529 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 1339 flow. Second operand 8 states and 147 transitions. [2024-06-04 15:44:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 163 transitions, 1765 flow [2024-06-04 15:44:40,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 163 transitions, 1661 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 15:44:40,544 INFO L231 Difference]: Finished difference. Result has 135 places, 153 transitions, 1404 flow [2024-06-04 15:44:40,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1404, PETRI_PLACES=135, PETRI_TRANSITIONS=153} [2024-06-04 15:44:40,544 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-04 15:44:40,545 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 153 transitions, 1404 flow [2024-06-04 15:44:40,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:44:40,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:40,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:40,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 15:44:40,545 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:40,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1877148698, now seen corresponding path program 1 times [2024-06-04 15:44:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303355402] [2024-06-04 15:44:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:41,957 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 15:44:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303355402] [2024-06-04 15:44:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303355402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:41,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667559556] [2024-06-04 15:44:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:41,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:41,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:41,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:41,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:42,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:42,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 153 transitions, 1404 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 15:44:42,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:42,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:42,959 INFO L124 PetriNetUnfolderBase]: 1183/1833 cut-off events. [2024-06-04 15:44:42,960 INFO L125 PetriNetUnfolderBase]: For 15520/15633 co-relation queries the response was YES. [2024-06-04 15:44:42,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 1833 events. 1183/1833 cut-off events. For 15520/15633 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8819 event pairs, 579 based on Foata normal form. 2/1833 useless extension candidates. Maximal degree in co-relation 8560. Up to 1734 conditions per place. [2024-06-04 15:44:42,971 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 128 selfloop transitions, 31 changer transitions 0/165 dead transitions. [2024-06-04 15:44:42,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 165 transitions, 1824 flow [2024-06-04 15:44:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:44:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:44:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-04 15:44:42,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2024-06-04 15:44:42,972 INFO L175 Difference]: Start difference. First operand has 135 places, 153 transitions, 1404 flow. Second operand 6 states and 112 transitions. [2024-06-04 15:44:42,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 165 transitions, 1824 flow [2024-06-04 15:44:42,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 165 transitions, 1726 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-04 15:44:42,991 INFO L231 Difference]: Finished difference. Result has 138 places, 159 transitions, 1466 flow [2024-06-04 15:44:42,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1466, PETRI_PLACES=138, PETRI_TRANSITIONS=159} [2024-06-04 15:44:42,991 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-04 15:44:42,992 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1466 flow [2024-06-04 15:44:42,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 15:44:42,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:42,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 15:44:42,993 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:42,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -158260560, now seen corresponding path program 1 times [2024-06-04 15:44:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892386195] [2024-06-04 15:44:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:44,997 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 15:44:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892386195] [2024-06-04 15:44:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892386195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:44:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13796436] [2024-06-04 15:44:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:44:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:44:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:44:45,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:45,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1466 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:45,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:45,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:45,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:46,119 INFO L124 PetriNetUnfolderBase]: 859/1393 cut-off events. [2024-06-04 15:44:46,119 INFO L125 PetriNetUnfolderBase]: For 14875/14877 co-relation queries the response was YES. [2024-06-04 15:44:46,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 1393 events. 859/1393 cut-off events. For 14875/14877 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6641 event pairs, 349 based on Foata normal form. 2/1395 useless extension candidates. Maximal degree in co-relation 7122. Up to 1253 conditions per place. [2024-06-04 15:44:46,128 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 135 selfloop transitions, 46 changer transitions 0/187 dead transitions. [2024-06-04 15:44:46,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 2202 flow [2024-06-04 15:44:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:44:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:44:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 15:44:46,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:44:46,129 INFO L175 Difference]: Start difference. First operand has 138 places, 159 transitions, 1466 flow. Second operand 9 states and 162 transitions. [2024-06-04 15:44:46,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 2202 flow [2024-06-04 15:44:46,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 187 transitions, 2161 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:46,147 INFO L231 Difference]: Finished difference. Result has 145 places, 170 transitions, 1709 flow [2024-06-04 15:44:46,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1709, PETRI_PLACES=145, PETRI_TRANSITIONS=170} [2024-06-04 15:44:46,148 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-04 15:44:46,148 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 170 transitions, 1709 flow [2024-06-04 15:44:46,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:46,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:46,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:46,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 15:44:46,148 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:46,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1876493048, now seen corresponding path program 2 times [2024-06-04 15:44:46,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:46,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545984889] [2024-06-04 15:44:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:47,499 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 15:44:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545984889] [2024-06-04 15:44:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545984889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:47,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:47,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869432474] [2024-06-04 15:44:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:47,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:47,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 170 transitions, 1709 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 15:44:47,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:47,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:47,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:48,451 INFO L124 PetriNetUnfolderBase]: 1208/1872 cut-off events. [2024-06-04 15:44:48,451 INFO L125 PetriNetUnfolderBase]: For 20547/20669 co-relation queries the response was YES. [2024-06-04 15:44:48,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9825 conditions, 1872 events. 1208/1872 cut-off events. For 20547/20669 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9027 event pairs, 568 based on Foata normal form. 2/1870 useless extension candidates. Maximal degree in co-relation 9756. Up to 1773 conditions per place. [2024-06-04 15:44:48,465 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 139 selfloop transitions, 34 changer transitions 0/179 dead transitions. [2024-06-04 15:44:48,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 179 transitions, 2172 flow [2024-06-04 15:44:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:44:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:44:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:44:48,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-04 15:44:48,474 INFO L175 Difference]: Start difference. First operand has 145 places, 170 transitions, 1709 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:44:48,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 179 transitions, 2172 flow [2024-06-04 15:44:48,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 179 transitions, 2045 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-04 15:44:48,497 INFO L231 Difference]: Finished difference. Result has 146 places, 175 transitions, 1739 flow [2024-06-04 15:44:48,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1739, PETRI_PLACES=146, PETRI_TRANSITIONS=175} [2024-06-04 15:44:48,498 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-04 15:44:48,498 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 175 transitions, 1739 flow [2024-06-04 15:44:48,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 15:44:48,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:48,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:48,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 15:44:48,499 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:48,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 14424630, now seen corresponding path program 2 times [2024-06-04 15:44:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689165251] [2024-06-04 15:44:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:50,502 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 15:44:50,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689165251] [2024-06-04 15:44:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689165251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:50,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:50,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:44:50,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872989329] [2024-06-04 15:44:50,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:44:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:44:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:44:50,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:50,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 175 transitions, 1739 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:50,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:50,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:50,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:51,484 INFO L124 PetriNetUnfolderBase]: 861/1390 cut-off events. [2024-06-04 15:44:51,484 INFO L125 PetriNetUnfolderBase]: For 17459/17461 co-relation queries the response was YES. [2024-06-04 15:44:51,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7640 conditions, 1390 events. 861/1390 cut-off events. For 17459/17461 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6609 event pairs, 298 based on Foata normal form. 1/1391 useless extension candidates. Maximal degree in co-relation 7569. Up to 1226 conditions per place. [2024-06-04 15:44:51,494 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 143 selfloop transitions, 72 changer transitions 0/221 dead transitions. [2024-06-04 15:44:51,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 221 transitions, 2703 flow [2024-06-04 15:44:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:44:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:44:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 15:44:51,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 15:44:51,495 INFO L175 Difference]: Start difference. First operand has 146 places, 175 transitions, 1739 flow. Second operand 8 states and 141 transitions. [2024-06-04 15:44:51,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 221 transitions, 2703 flow [2024-06-04 15:44:51,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 221 transitions, 2660 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:51,516 INFO L231 Difference]: Finished difference. Result has 154 places, 202 transitions, 2326 flow [2024-06-04 15:44:51,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2326, PETRI_PLACES=154, PETRI_TRANSITIONS=202} [2024-06-04 15:44:51,517 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-04 15:44:51,517 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 202 transitions, 2326 flow [2024-06-04 15:44:51,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:51,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:51,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:51,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 15:44:51,518 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:51,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash 14459970, now seen corresponding path program 3 times [2024-06-04 15:44:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722111776] [2024-06-04 15:44:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:53,667 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 15:44:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:53,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722111776] [2024-06-04 15:44:53,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722111776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:53,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:53,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:44:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412997898] [2024-06-04 15:44:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:53,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:44:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:44:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:44:53,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:44:53,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 202 transitions, 2326 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:53,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:53,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:44:53,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:54,886 INFO L124 PetriNetUnfolderBase]: 874/1409 cut-off events. [2024-06-04 15:44:54,886 INFO L125 PetriNetUnfolderBase]: For 21004/21006 co-relation queries the response was YES. [2024-06-04 15:44:54,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8238 conditions, 1409 events. 874/1409 cut-off events. For 21004/21006 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6679 event pairs, 298 based on Foata normal form. 2/1411 useless extension candidates. Maximal degree in co-relation 8162. Up to 1189 conditions per place. [2024-06-04 15:44:54,898 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 124 selfloop transitions, 102 changer transitions 0/232 dead transitions. [2024-06-04 15:44:54,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 232 transitions, 3303 flow [2024-06-04 15:44:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 15:44:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 15:44:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-04 15:44:54,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-04 15:44:54,900 INFO L175 Difference]: Start difference. First operand has 154 places, 202 transitions, 2326 flow. Second operand 10 states and 183 transitions. [2024-06-04 15:44:54,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 232 transitions, 3303 flow [2024-06-04 15:44:54,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 232 transitions, 3069 flow, removed 98 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:54,932 INFO L231 Difference]: Finished difference. Result has 162 places, 209 transitions, 2502 flow [2024-06-04 15:44:54,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2502, PETRI_PLACES=162, PETRI_TRANSITIONS=209} [2024-06-04 15:44:54,936 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-04 15:44:54,936 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 209 transitions, 2502 flow [2024-06-04 15:44:54,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:44:54,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:54,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 15:44:54,937 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:54,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1303599868, now seen corresponding path program 1 times [2024-06-04 15:44:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:54,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845340042] [2024-06-04 15:44:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:56,384 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 15:44:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:56,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845340042] [2024-06-04 15:44:56,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845340042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:56,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820757491] [2024-06-04 15:44:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:56,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:56,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:56,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:56,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 209 transitions, 2502 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 15:44:56,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:56,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:57,139 INFO L124 PetriNetUnfolderBase]: 1057/1698 cut-off events. [2024-06-04 15:44:57,140 INFO L125 PetriNetUnfolderBase]: For 22453/22580 co-relation queries the response was YES. [2024-06-04 15:44:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9843 conditions, 1698 events. 1057/1698 cut-off events. For 22453/22580 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8329 event pairs, 457 based on Foata normal form. 2/1697 useless extension candidates. Maximal degree in co-relation 9765. Up to 1580 conditions per place. [2024-06-04 15:44:57,152 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 188 selfloop transitions, 25 changer transitions 0/220 dead transitions. [2024-06-04 15:44:57,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 220 transitions, 3035 flow [2024-06-04 15:44:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:44:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:44:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 15:44:57,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-04 15:44:57,154 INFO L175 Difference]: Start difference. First operand has 162 places, 209 transitions, 2502 flow. Second operand 7 states and 127 transitions. [2024-06-04 15:44:57,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 220 transitions, 3035 flow [2024-06-04 15:44:57,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 220 transitions, 2770 flow, removed 59 selfloop flow, removed 8 redundant places. [2024-06-04 15:44:57,186 INFO L231 Difference]: Finished difference. Result has 163 places, 216 transitions, 2405 flow [2024-06-04 15:44:57,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2405, PETRI_PLACES=163, PETRI_TRANSITIONS=216} [2024-06-04 15:44:57,187 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-06-04 15:44:57,187 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 216 transitions, 2405 flow [2024-06-04 15:44:57,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 15:44:57,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:57,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:57,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 15:44:57,187 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:57,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1303571968, now seen corresponding path program 2 times [2024-06-04 15:44:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080196193] [2024-06-04 15:44:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:44:58,668 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 15:44:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:44:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080196193] [2024-06-04 15:44:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080196193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:44:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:44:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:44:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707926352] [2024-06-04 15:44:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:44:58,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:44:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:44:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:44:58,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:44:58,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:44:58,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 216 transitions, 2405 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 15:44:58,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:44:58,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:44:58,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:44:59,448 INFO L124 PetriNetUnfolderBase]: 1056/1694 cut-off events. [2024-06-04 15:44:59,448 INFO L125 PetriNetUnfolderBase]: For 21662/21789 co-relation queries the response was YES. [2024-06-04 15:44:59,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9871 conditions, 1694 events. 1056/1694 cut-off events. For 21662/21789 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8311 event pairs, 457 based on Foata normal form. 2/1693 useless extension candidates. Maximal degree in co-relation 9791. Up to 1589 conditions per place. [2024-06-04 15:44:59,460 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 200 selfloop transitions, 17 changer transitions 0/224 dead transitions. [2024-06-04 15:44:59,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 224 transitions, 2935 flow [2024-06-04 15:44:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:44:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:44:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 15:44:59,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:44:59,462 INFO L175 Difference]: Start difference. First operand has 163 places, 216 transitions, 2405 flow. Second operand 6 states and 108 transitions. [2024-06-04 15:44:59,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 224 transitions, 2935 flow [2024-06-04 15:44:59,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 2889 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 15:44:59,493 INFO L231 Difference]: Finished difference. Result has 166 places, 221 transitions, 2481 flow [2024-06-04 15:44:59,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2481, PETRI_PLACES=166, PETRI_TRANSITIONS=221} [2024-06-04 15:44:59,494 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places. [2024-06-04 15:44:59,494 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 221 transitions, 2481 flow [2024-06-04 15:44:59,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 15:44:59,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:44:59,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:44:59,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 15:44:59,494 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:44:59,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:44:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1876504952, now seen corresponding path program 1 times [2024-06-04 15:44:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:44:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591450470] [2024-06-04 15:44:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:44:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:44:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:44:59,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:44:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:44:59,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:44:59,546 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:44:59,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:44:59,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:44:59,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:44:59,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:44:59,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:44:59,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:44:59,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 15:44:59,550 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-06-04 15:44:59,553 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:44:59,553 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:44:59,575 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,576 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,576 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,576 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,576 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,576 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,579 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,579 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,579 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,579 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,580 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,580 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,580 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,580 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:44:59,583 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:44:59,590 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:44:59,590 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:44:59,590 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:44:59 BasicIcfg [2024-06-04 15:44:59,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:44:59,591 INFO L158 Benchmark]: Toolchain (without parser) took 78015.57ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 111.8MB in the beginning and 1.1GB in the end (delta: -950.7MB). Peak memory consumption was 369.4MB. Max. memory is 16.1GB. [2024-06-04 15:44:59,591 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:44:59,591 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:44:59,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.01ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 61.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-04 15:44:59,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.70ms. Allocated memory is still 161.5MB. Free memory was 61.4MB in the beginning and 57.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:44:59,592 INFO L158 Benchmark]: Boogie Preprocessor took 149.60ms. Allocated memory is still 161.5MB. Free memory was 57.2MB in the beginning and 123.5MB in the end (delta: -66.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-06-04 15:44:59,592 INFO L158 Benchmark]: RCFGBuilder took 960.14ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 123.5MB in the beginning and 151.9MB in the end (delta: -28.4MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-06-04 15:44:59,592 INFO L158 Benchmark]: TraceAbstraction took 76240.45ms. Allocated memory was 216.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.9MB in the beginning and 1.1GB in the end (delta: -911.6MB). Peak memory consumption was 354.0MB. Max. memory is 16.1GB. [2024-06-04 15:44:59,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.01ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 61.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.70ms. Allocated memory is still 161.5MB. Free memory was 61.4MB in the beginning and 57.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.60ms. Allocated memory is still 161.5MB. Free memory was 57.2MB in the beginning and 123.5MB in the end (delta: -66.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 960.14ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 123.5MB in the beginning and 151.9MB in the end (delta: -28.4MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * TraceAbstraction took 76240.45ms. Allocated memory was 216.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.9MB in the beginning and 1.1GB in the end (delta: -911.6MB). Peak memory consumption was 354.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 867]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2449; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] 0 //@ ghost multithreaded = 1; [L862] FCALL, FORK 0 pthread_create(&t2449, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2450; [L864] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))); [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] FCALL, FORK 0 pthread_create(&t2450, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, t2450=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 pthread_t t2451; [L866] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))); [L866] 0 x [L866] 0 x [L866] 0 x [L866] 0 x [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] FCALL, FORK 0 pthread_create(&t2451, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, t2450=-1, t2451=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L866] 0 x [L866] 0 x [L866] 0 x [L866] 0 x [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 __unbuffered_p2_EAX$read_delayed_var [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 x$flush_delayed = weak$$choice2 [L820] EXPR 3 \read(x) [L820] 3 x$mem_tmp = x [L821] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] EXPR 3 \read(x) [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L831] EXPR 3 \read(x) [L831] 3 __unbuffered_p2_EAX = x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] 3 x = x$flush_delayed ? x$mem_tmp : x [L833] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L867] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, t2450=-1, t2451=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 864]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 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: 76.1s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1198 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1019 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6372 IncrementalHoareTripleChecker+Invalid, 6514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 63 mSDtfsCounter, 6372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2502occurred in iteration=28, InterpolantAutomatonStates: 207, 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, 0.4s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 39011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 RESULT: Ultimate proved your program to be incorrect! [2024-06-04 15:44:59,622 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE