./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.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_rmo.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_rmo.i ./goblint.2024-05-21_14-57-05.files/protection/safe028_rmo.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-03 20:16:41,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:16:41,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:16:41,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:16:41,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:16:41,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:16:41,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:16:41,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:16:41,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:16:41,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:16:41,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:16:41,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:16:41,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:16:41,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:16:41,534 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:16:41,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:16:41,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:16:41,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:16:41,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:16:41,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:16:41,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:16:41,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:16:41,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:16:41,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:16:41,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:16:41,537 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:16:41,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:16:41,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:16:41,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:16:41,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:16:41,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:16:41,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:16:41,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:16:41,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:16:41,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:16:41,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:16:41,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:16:41,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:16:41,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:16:41,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:16:41,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:16:41,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:16:41,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:16:41,542 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-03 20:16:41,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:16:41,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:16:41,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:16:41,731 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:16:41,731 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:16:41,732 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_rmo.yml/witness.yml [2024-06-03 20:16:41,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:16:41,911 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:16:41,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2024-06-03 20:16:43,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:16:43,312 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:16:43,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2024-06-03 20:16:43,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360fd33fc/0317acd9a57f4033b783e44d4666a959/FLAG72318dd1d [2024-06-03 20:16:43,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360fd33fc/0317acd9a57f4033b783e44d4666a959 [2024-06-03 20:16:43,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:16:43,345 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:16:43,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:16:43,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:16:43,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:16:43,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:16:41" (1/2) ... [2024-06-03 20:16:43,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442645dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:16:43, skipping insertion in model container [2024-06-03 20:16:43,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:16:41" (1/2) ... [2024-06-03 20:16:43,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f37724a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:16:43, skipping insertion in model container [2024-06-03 20:16:43,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:16:43" (2/2) ... [2024-06-03 20:16:43,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442645dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:43, skipping insertion in model container [2024-06-03 20:16:43,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:16:43" (2/2) ... [2024-06-03 20:16:43,357 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:16:43,480 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:16:43,481 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)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 <= 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 || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_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 || x$w_buff1 == 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 || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-03 20:16:43,481 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)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 <= 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 || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_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 || x$w_buff1 == 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 || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-03 20:16:43,481 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)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 <= 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 || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_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 || x$w_buff1 == 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 || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-03 20:16:43,481 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:16:43,481 INFO L106 edCorrectnessWitness]: ghost_update [L852-L852] multithreaded = 1; [2024-06-03 20:16:43,516 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:16:43,826 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:16:43,839 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:16:43,992 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:16:44,043 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:16:44,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44 WrapperNode [2024-06-03 20:16:44,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:16:44,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:16:44,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:16:44,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:16:44,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,099 INFO L138 Inliner]: procedures = 175, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 205 [2024-06-03 20:16:44,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:16:44,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:16:44,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:16:44,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:16:44,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,149 INFO L175 MemorySlicer]: Split 47 memory accesses to 2 slices as follows [2, 45]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-06-03 20:16:44,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:16:44,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:16:44,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:16:44,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:16:44,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (1/1) ... [2024-06-03 20:16:44,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:16:44,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:16:44,220 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-03 20:16:44,236 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-03 20:16:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:16:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:16:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:16:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:16:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:16:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:16:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:16:44,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:16:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:16:44,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:16:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:16:44,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:16:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:16:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:16:44,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:16:44,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:16:44,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:16:44,256 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:16:44,408 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:16:44,409 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:16:44,861 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:16:44,862 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:16:45,251 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:16:45,251 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:16:45,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:16:45 BoogieIcfgContainer [2024-06-03 20:16:45,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:16:45,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:16:45,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:16:45,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:16:45,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:16:41" (1/4) ... [2024-06-03 20:16:45,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e24e74e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:16:45, skipping insertion in model container [2024-06-03 20:16:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:16:43" (2/4) ... [2024-06-03 20:16:45,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e24e74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:16:45, skipping insertion in model container [2024-06-03 20:16:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:16:44" (3/4) ... [2024-06-03 20:16:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e24e74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:16:45, skipping insertion in model container [2024-06-03 20:16:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:16:45" (4/4) ... [2024-06-03 20:16:45,261 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2024-06-03 20:16:45,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:16:45,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:16:45,278 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:16:45,374 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:16:45,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 20:16:45,428 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 20:16:45,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:16:45,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 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-03 20:16:45,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 20:16:45,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 20:16:45,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:16:45,443 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;@4aedf1b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:16:45,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:16:45,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:16:45,447 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 20:16:45,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:16:45,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:45,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:16:45,448 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-03 20:16:45,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1849669587, now seen corresponding path program 1 times [2024-06-03 20:16:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508527899] [2024-06-03 20:16:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:47,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-03 20:16:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508527899] [2024-06-03 20:16:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508527899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:47,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:16:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914805728] [2024-06-03 20:16:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:16:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:16:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:16:47,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:16:47,765 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-03 20:16:47,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:47,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:16:47,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:48,232 INFO L124 PetriNetUnfolderBase]: 611/1029 cut-off events. [2024-06-03 20:16:48,233 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-03 20:16:48,236 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 4805 event pairs, 335 based on Foata normal form. 0/1023 useless extension candidates. Maximal degree in co-relation 2039. Up to 948 conditions per place. [2024-06-03 20:16:48,241 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 20:16:48,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-03 20:16:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:16:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:16:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-06-03 20:16:48,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-03 20:16:48,251 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 80 transitions. [2024-06-03 20:16:48,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-03 20:16:48,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:16:48,254 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-03 20:16:48,256 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-03 20:16:48,258 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-03 20:16:48,258 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-03 20:16:48,258 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-03 20:16:48,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:48,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:48,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:16:48,259 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-03 20:16:48,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash -583931342, now seen corresponding path program 1 times [2024-06-03 20:16:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083893040] [2024-06-03 20:16:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:49,902 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-03 20:16:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083893040] [2024-06-03 20:16:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083893040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:49,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:16:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432551130] [2024-06-03 20:16:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:49,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:16:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:16:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:16:49,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:16:49,966 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-03 20:16:49,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:49,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:16:49,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:50,523 INFO L124 PetriNetUnfolderBase]: 718/1136 cut-off events. [2024-06-03 20:16:50,523 INFO L125 PetriNetUnfolderBase]: For 182/184 co-relation queries the response was YES. [2024-06-03 20:16:50,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1136 events. 718/1136 cut-off events. For 182/184 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5167 event pairs, 251 based on Foata normal form. 2/1129 useless extension candidates. Maximal degree in co-relation 2541. Up to 1071 conditions per place. [2024-06-03 20:16:50,531 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 34 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2024-06-03 20:16:50,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 263 flow [2024-06-03 20:16:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:16:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:16:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-03 20:16:50,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 20:16:50,535 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 5 states and 95 transitions. [2024-06-03 20:16:50,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 263 flow [2024-06-03 20:16:50,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:16:50,539 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 197 flow [2024-06-03 20:16:50,539 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-03 20:16:50,541 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-03 20:16:50,541 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 197 flow [2024-06-03 20:16:50,542 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-03 20:16:50,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:50,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:16:50,547 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-03 20:16:50,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -583722092, now seen corresponding path program 2 times [2024-06-03 20:16:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493957907] [2024-06-03 20:16:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:52,184 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-03 20:16:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493957907] [2024-06-03 20:16:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493957907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:16:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232334393] [2024-06-03 20:16:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:16:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:16:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:16:52,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:16:52,223 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-03 20:16:52,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:52,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:16:52,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:52,666 INFO L124 PetriNetUnfolderBase]: 716/1134 cut-off events. [2024-06-03 20:16:52,666 INFO L125 PetriNetUnfolderBase]: For 469/471 co-relation queries the response was YES. [2024-06-03 20:16:52,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 1134 events. 716/1134 cut-off events. For 469/471 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5073 event pairs, 271 based on Foata normal form. 4/1137 useless extension candidates. Maximal degree in co-relation 2786. Up to 1070 conditions per place. [2024-06-03 20:16:52,672 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 39 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-03 20:16:52,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 331 flow [2024-06-03 20:16:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:16:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:16:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-03 20:16:52,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-03 20:16:52,673 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 197 flow. Second operand 5 states and 100 transitions. [2024-06-03 20:16:52,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 331 flow [2024-06-03 20:16:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 323 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 20:16:52,676 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 218 flow [2024-06-03 20:16:52,676 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-03 20:16:52,677 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-03 20:16:52,677 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 218 flow [2024-06-03 20:16:52,677 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-03 20:16:52,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:52,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:52,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:16:52,678 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-03 20:16:52,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash -922935027, now seen corresponding path program 1 times [2024-06-03 20:16:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811286712] [2024-06-03 20:16:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:54,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811286712] [2024-06-03 20:16:54,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811286712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:54,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:16:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8693585] [2024-06-03 20:16:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:54,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:16:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:16:54,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:16:54,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:16:54,326 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-03 20:16:54,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:54,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:16:54,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:54,948 INFO L124 PetriNetUnfolderBase]: 652/1076 cut-off events. [2024-06-03 20:16:54,948 INFO L125 PetriNetUnfolderBase]: For 379/381 co-relation queries the response was YES. [2024-06-03 20:16:54,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 1076 events. 652/1076 cut-off events. For 379/381 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5042 event pairs, 334 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 2567. Up to 1011 conditions per place. [2024-06-03 20:16:54,953 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 36 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2024-06-03 20:16:54,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 357 flow [2024-06-03 20:16:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:16:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:16:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:16:54,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 20:16:54,955 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 218 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:16:54,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 357 flow [2024-06-03 20:16:54,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 319 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:16:54,958 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 262 flow [2024-06-03 20:16:54,958 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-06-03 20:16:54,959 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-03 20:16:54,959 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 262 flow [2024-06-03 20:16:54,959 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-03 20:16:54,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:54,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:54,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:16:54,960 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-03 20:16:54,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2099216260, now seen corresponding path program 1 times [2024-06-03 20:16:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304371406] [2024-06-03 20:16:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:56,889 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-03 20:16:56,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304371406] [2024-06-03 20:16:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304371406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844163371] [2024-06-03 20:16:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:56,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:56,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:16:56,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 262 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-03 20:16:56,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:56,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:16:56,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:57,956 INFO L124 PetriNetUnfolderBase]: 769/1217 cut-off events. [2024-06-03 20:16:57,956 INFO L125 PetriNetUnfolderBase]: For 689/693 co-relation queries the response was YES. [2024-06-03 20:16:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3176 conditions, 1217 events. 769/1217 cut-off events. For 689/693 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5495 event pairs, 310 based on Foata normal form. 6/1223 useless extension candidates. Maximal degree in co-relation 3150. Up to 1143 conditions per place. [2024-06-03 20:16:57,964 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 44 selfloop transitions, 21 changer transitions 0/72 dead transitions. [2024-06-03 20:16:57,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 462 flow [2024-06-03 20:16:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 20:16:57,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-03 20:16:57,972 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 262 flow. Second operand 7 states and 128 transitions. [2024-06-03 20:16:57,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 462 flow [2024-06-03 20:16:57,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 20:16:57,978 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 369 flow [2024-06-03 20:16:57,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-03 20:16:57,979 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-03 20:16:57,980 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 369 flow [2024-06-03 20:16:57,980 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-03 20:16:57,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:57,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:57,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:16:57,981 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-03 20:16:57,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2117715820, now seen corresponding path program 2 times [2024-06-03 20:16:57,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:57,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126557711] [2024-06-03 20:16:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126557711] [2024-06-03 20:16:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126557711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170068138] [2024-06-03 20:16:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:59,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:59,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:59,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:59,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:16:59,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 369 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-03 20:16:59,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:59,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:16:59,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:00,702 INFO L124 PetriNetUnfolderBase]: 773/1223 cut-off events. [2024-06-03 20:17:00,702 INFO L125 PetriNetUnfolderBase]: For 1464/1468 co-relation queries the response was YES. [2024-06-03 20:17:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 1223 events. 773/1223 cut-off events. For 1464/1468 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5589 event pairs, 266 based on Foata normal form. 8/1230 useless extension candidates. Maximal degree in co-relation 3619. Up to 1144 conditions per place. [2024-06-03 20:17:00,708 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 38 selfloop transitions, 31 changer transitions 0/76 dead transitions. [2024-06-03 20:17:00,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 583 flow [2024-06-03 20:17:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:17:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:17:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 20:17:00,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 20:17:00,710 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 369 flow. Second operand 8 states and 138 transitions. [2024-06-03 20:17:00,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 583 flow [2024-06-03 20:17:00,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 548 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:00,713 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 468 flow [2024-06-03 20:17:00,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=468, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-03 20:17:00,716 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-03 20:17:00,716 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 468 flow [2024-06-03 20:17:00,716 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-03 20:17:00,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:00,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:00,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:17:00,717 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-03 20:17:00,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2118199854, now seen corresponding path program 1 times [2024-06-03 20:17:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871901118] [2024-06-03 20:17:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:02,400 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-03 20:17:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:02,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871901118] [2024-06-03 20:17:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871901118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351838205] [2024-06-03 20:17:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:02,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:17:02,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 468 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-03 20:17:02,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:02,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:17:02,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:03,430 INFO L124 PetriNetUnfolderBase]: 664/1112 cut-off events. [2024-06-03 20:17:03,430 INFO L125 PetriNetUnfolderBase]: For 2092/2096 co-relation queries the response was YES. [2024-06-03 20:17:03,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1112 events. 664/1112 cut-off events. For 2092/2096 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5246 event pairs, 308 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 3551. Up to 1010 conditions per place. [2024-06-03 20:17:03,436 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2024-06-03 20:17:03,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 82 transitions, 684 flow [2024-06-03 20:17:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:17:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:17:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-03 20:17:03,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2024-06-03 20:17:03,437 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 468 flow. Second operand 6 states and 113 transitions. [2024-06-03 20:17:03,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 82 transitions, 684 flow [2024-06-03 20:17:03,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 632 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:03,440 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 523 flow [2024-06-03 20:17:03,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2024-06-03 20:17:03,441 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2024-06-03 20:17:03,441 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 523 flow [2024-06-03 20:17:03,441 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-03 20:17:03,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:03,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:03,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:17:03,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:03,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash 689876546, now seen corresponding path program 1 times [2024-06-03 20:17:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596446106] [2024-06-03 20:17:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:06,323 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-03 20:17:06,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:06,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596446106] [2024-06-03 20:17:06,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596446106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:06,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119972673] [2024-06-03 20:17:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:06,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:06,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 523 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-03 20:17:06,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:06,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:06,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:06,846 INFO L124 PetriNetUnfolderBase]: 754/1203 cut-off events. [2024-06-03 20:17:06,846 INFO L125 PetriNetUnfolderBase]: For 2807/2811 co-relation queries the response was YES. [2024-06-03 20:17:06,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1203 events. 754/1203 cut-off events. For 2807/2811 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5488 event pairs, 243 based on Foata normal form. 4/1202 useless extension candidates. Maximal degree in co-relation 4064. Up to 1121 conditions per place. [2024-06-03 20:17:06,853 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 55 selfloop transitions, 22 changer transitions 0/84 dead transitions. [2024-06-03 20:17:06,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 719 flow [2024-06-03 20:17:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:17:06,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 20:17:06,854 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 523 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:17:06,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 719 flow [2024-06-03 20:17:06,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 673 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:06,858 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 550 flow [2024-06-03 20:17:06,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-06-03 20:17:06,859 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-03 20:17:06,859 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 550 flow [2024-06-03 20:17:06,859 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-03 20:17:06,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:06,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:06,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:17:06,860 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-03 20:17:06,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash -770456706, now seen corresponding path program 2 times [2024-06-03 20:17:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95133712] [2024-06-03 20:17:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:09,718 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-03 20:17:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95133712] [2024-06-03 20:17:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95133712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:09,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:09,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532802322] [2024-06-03 20:17:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:09,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:09,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 550 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-03 20:17:09,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:09,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:09,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:10,476 INFO L124 PetriNetUnfolderBase]: 756/1210 cut-off events. [2024-06-03 20:17:10,476 INFO L125 PetriNetUnfolderBase]: For 2925/2927 co-relation queries the response was YES. [2024-06-03 20:17:10,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 1210 events. 756/1210 cut-off events. For 2925/2927 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5522 event pairs, 239 based on Foata normal form. 2/1208 useless extension candidates. Maximal degree in co-relation 4114. Up to 1125 conditions per place. [2024-06-03 20:17:10,483 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 68 selfloop transitions, 26 changer transitions 0/101 dead transitions. [2024-06-03 20:17:10,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 895 flow [2024-06-03 20:17:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:17:10,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-03 20:17:10,485 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 550 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:17:10,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 895 flow [2024-06-03 20:17:10,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 101 transitions, 831 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:10,491 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 672 flow [2024-06-03 20:17:10,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2024-06-03 20:17:10,493 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-03 20:17:10,493 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 672 flow [2024-06-03 20:17:10,493 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-03 20:17:10,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:10,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:10,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:17:10,496 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-03 20:17:10,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1029061806, now seen corresponding path program 3 times [2024-06-03 20:17:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:10,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313241440] [2024-06-03 20:17:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:17:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313241440] [2024-06-03 20:17:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313241440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71898225] [2024-06-03 20:17:13,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:13,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:13,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:13,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 672 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-03 20:17:13,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:13,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:13,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:13,643 INFO L124 PetriNetUnfolderBase]: 757/1212 cut-off events. [2024-06-03 20:17:13,643 INFO L125 PetriNetUnfolderBase]: For 3342/3352 co-relation queries the response was YES. [2024-06-03 20:17:13,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4296 conditions, 1212 events. 757/1212 cut-off events. For 3342/3352 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5560 event pairs, 241 based on Foata normal form. 6/1214 useless extension candidates. Maximal degree in co-relation 4255. Up to 1128 conditions per place. [2024-06-03 20:17:13,652 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 62 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2024-06-03 20:17:13,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 97 transitions, 905 flow [2024-06-03 20:17:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 20:17:13,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 20:17:13,653 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 672 flow. Second operand 7 states and 124 transitions. [2024-06-03 20:17:13,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 97 transitions, 905 flow [2024-06-03 20:17:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 97 transitions, 868 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-03 20:17:13,660 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 736 flow [2024-06-03 20:17:13,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=736, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-06-03 20:17:13,661 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-03 20:17:13,661 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 736 flow [2024-06-03 20:17:13,661 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-03 20:17:13,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:13,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:13,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:17:13,661 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:13,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1224047012, now seen corresponding path program 1 times [2024-06-03 20:17:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130858068] [2024-06-03 20:17:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:15,147 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-03 20:17:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130858068] [2024-06-03 20:17:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130858068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:17:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265338919] [2024-06-03 20:17:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:15,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:17:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:17:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:17:15,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:17:15,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 736 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-03 20:17:15,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:15,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:17:15,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:15,976 INFO L124 PetriNetUnfolderBase]: 954/1554 cut-off events. [2024-06-03 20:17:15,976 INFO L125 PetriNetUnfolderBase]: For 3831/3870 co-relation queries the response was YES. [2024-06-03 20:17:15,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 1554 events. 954/1554 cut-off events. For 3831/3870 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7671 event pairs, 527 based on Foata normal form. 3/1551 useless extension candidates. Maximal degree in co-relation 5086. Up to 1440 conditions per place. [2024-06-03 20:17:15,995 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 77 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2024-06-03 20:17:15,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 991 flow [2024-06-03 20:17:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:17:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:17:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-03 20:17:15,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2024-06-03 20:17:15,998 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 736 flow. Second operand 6 states and 109 transitions. [2024-06-03 20:17:15,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 991 flow [2024-06-03 20:17:16,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 919 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:16,011 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 783 flow [2024-06-03 20:17:16,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2024-06-03 20:17:16,012 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-03 20:17:16,012 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 783 flow [2024-06-03 20:17:16,012 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-03 20:17:16,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:16,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:17:16,013 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:16,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash -770445546, now seen corresponding path program 4 times [2024-06-03 20:17:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:16,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480968874] [2024-06-03 20:17:16,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:18,661 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-03 20:17:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:18,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480968874] [2024-06-03 20:17:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480968874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:18,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199931790] [2024-06-03 20:17:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:18,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:18,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:18,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:18,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 783 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-03 20:17:18,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:18,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:19,494 INFO L124 PetriNetUnfolderBase]: 893/1455 cut-off events. [2024-06-03 20:17:19,494 INFO L125 PetriNetUnfolderBase]: For 3813/3838 co-relation queries the response was YES. [2024-06-03 20:17:19,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5175 conditions, 1455 events. 893/1455 cut-off events. For 3813/3838 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7119 event pairs, 309 based on Foata normal form. 2/1453 useless extension candidates. Maximal degree in co-relation 5128. Up to 1320 conditions per place. [2024-06-03 20:17:19,503 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 77 selfloop transitions, 31 changer transitions 0/115 dead transitions. [2024-06-03 20:17:19,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 115 transitions, 1078 flow [2024-06-03 20:17:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-03 20:17:19,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-03 20:17:19,505 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 783 flow. Second operand 7 states and 134 transitions. [2024-06-03 20:17:19,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 115 transitions, 1078 flow [2024-06-03 20:17:19,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 1044 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 20:17:19,511 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 821 flow [2024-06-03 20:17:19,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=735, 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=821, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-06-03 20:17:19,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-03 20:17:19,512 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 821 flow [2024-06-03 20:17:19,512 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-03 20:17:19,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:19,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:19,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:17:19,513 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:19,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash -231474995, now seen corresponding path program 1 times [2024-06-03 20:17:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185831086] [2024-06-03 20:17:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:21,517 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-03 20:17:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185831086] [2024-06-03 20:17:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185831086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:21,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:17:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325817859] [2024-06-03 20:17:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:21,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:17:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:21,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:17:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:17:21,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:21,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 821 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-03 20:17:21,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:21,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:21,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:22,868 INFO L124 PetriNetUnfolderBase]: 945/1533 cut-off events. [2024-06-03 20:17:22,868 INFO L125 PetriNetUnfolderBase]: For 4585/4594 co-relation queries the response was YES. [2024-06-03 20:17:22,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 1533 events. 945/1533 cut-off events. For 4585/4594 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7533 event pairs, 320 based on Foata normal form. 2/1534 useless extension candidates. Maximal degree in co-relation 5564. Up to 1382 conditions per place. [2024-06-03 20:17:22,878 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 41 changer transitions 0/133 dead transitions. [2024-06-03 20:17:22,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 1293 flow [2024-06-03 20:17:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 20:17:22,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 20:17:22,880 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 821 flow. Second operand 7 states and 133 transitions. [2024-06-03 20:17:22,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 1293 flow [2024-06-03 20:17:22,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 133 transitions, 1209 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 20:17:22,887 INFO L231 Difference]: Finished difference. Result has 98 places, 112 transitions, 959 flow [2024-06-03 20:17:22,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=959, PETRI_PLACES=98, PETRI_TRANSITIONS=112} [2024-06-03 20:17:22,888 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-03 20:17:22,888 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 112 transitions, 959 flow [2024-06-03 20:17:22,888 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-03 20:17:22,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:22,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:22,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:17:22,889 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:22,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:22,889 INFO L85 PathProgramCache]: Analyzing trace with hash -224123345, now seen corresponding path program 2 times [2024-06-03 20:17:22,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:22,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093573983] [2024-06-03 20:17:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:22,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:24,895 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-03 20:17:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093573983] [2024-06-03 20:17:24,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093573983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:24,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:17:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494935554] [2024-06-03 20:17:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:24,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:17:24,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:17:24,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:17:24,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:24,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 112 transitions, 959 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-03 20:17:24,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:24,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:24,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:26,119 INFO L124 PetriNetUnfolderBase]: 812/1303 cut-off events. [2024-06-03 20:17:26,119 INFO L125 PetriNetUnfolderBase]: For 5101/5110 co-relation queries the response was YES. [2024-06-03 20:17:26,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 1303 events. 812/1303 cut-off events. For 5101/5110 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6093 event pairs, 211 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 5141. Up to 1150 conditions per place. [2024-06-03 20:17:26,128 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 42 changer transitions 0/134 dead transitions. [2024-06-03 20:17:26,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 134 transitions, 1359 flow [2024-06-03 20:17:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 20:17:26,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-03 20:17:26,129 INFO L175 Difference]: Start difference. First operand has 98 places, 112 transitions, 959 flow. Second operand 7 states and 129 transitions. [2024-06-03 20:17:26,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 134 transitions, 1359 flow [2024-06-03 20:17:26,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1292 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-03 20:17:26,137 INFO L231 Difference]: Finished difference. Result has 104 places, 116 transitions, 1041 flow [2024-06-03 20:17:26,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1041, PETRI_PLACES=104, PETRI_TRANSITIONS=116} [2024-06-03 20:17:26,138 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-03 20:17:26,138 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 116 transitions, 1041 flow [2024-06-03 20:17:26,139 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-03 20:17:26,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:26,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:26,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:17:26,139 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-03 20:17:26,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:26,139 INFO L85 PathProgramCache]: Analyzing trace with hash -224392115, now seen corresponding path program 3 times [2024-06-03 20:17:26,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957764908] [2024-06-03 20:17:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:28,114 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-03 20:17:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:28,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957764908] [2024-06-03 20:17:28,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957764908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:28,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:28,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:17:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083969371] [2024-06-03 20:17:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:28,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:17:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:17:28,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:17:28,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:28,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 116 transitions, 1041 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-03 20:17:28,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:28,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:28,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:29,266 INFO L124 PetriNetUnfolderBase]: 808/1295 cut-off events. [2024-06-03 20:17:29,266 INFO L125 PetriNetUnfolderBase]: For 5348/5357 co-relation queries the response was YES. [2024-06-03 20:17:29,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 1295 events. 808/1295 cut-off events. For 5348/5357 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6048 event pairs, 216 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 5170. Up to 1147 conditions per place. [2024-06-03 20:17:29,273 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 80 selfloop transitions, 46 changer transitions 0/132 dead transitions. [2024-06-03 20:17:29,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 1390 flow [2024-06-03 20:17:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:17:29,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 20:17:29,275 INFO L175 Difference]: Start difference. First operand has 104 places, 116 transitions, 1041 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:17:29,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 1390 flow [2024-06-03 20:17:29,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 132 transitions, 1242 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 20:17:29,282 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 1033 flow [2024-06-03 20:17:29,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1033, PETRI_PLACES=105, PETRI_TRANSITIONS=119} [2024-06-03 20:17:29,283 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-03 20:17:29,283 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 1033 flow [2024-06-03 20:17:29,283 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-03 20:17:29,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:29,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:29,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:17:29,284 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-03 20:17:29,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash -682866677, now seen corresponding path program 1 times [2024-06-03 20:17:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792833061] [2024-06-03 20:17:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:31,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-03 20:17:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792833061] [2024-06-03 20:17:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792833061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:17:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410689818] [2024-06-03 20:17:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:31,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:17:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:17:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:17:32,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:17:32,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 119 transitions, 1033 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:17:32,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:32,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:17:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:32,760 INFO L124 PetriNetUnfolderBase]: 706/1184 cut-off events. [2024-06-03 20:17:32,760 INFO L125 PetriNetUnfolderBase]: For 5057/5066 co-relation queries the response was YES. [2024-06-03 20:17:32,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 1184 events. 706/1184 cut-off events. For 5057/5066 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5745 event pairs, 317 based on Foata normal form. 4/1188 useless extension candidates. Maximal degree in co-relation 4733. Up to 1092 conditions per place. [2024-06-03 20:17:32,766 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 100 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-06-03 20:17:32,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 1303 flow [2024-06-03 20:17:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-03 20:17:32,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-03 20:17:32,770 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 1033 flow. Second operand 7 states and 121 transitions. [2024-06-03 20:17:32,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 1303 flow [2024-06-03 20:17:32,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 125 transitions, 1225 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:32,779 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1022 flow [2024-06-03 20:17:32,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1022, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2024-06-03 20:17:32,780 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-06-03 20:17:32,780 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1022 flow [2024-06-03 20:17:32,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:17:32,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:32,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:17:32,781 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-03 20:17:32,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -223864247, now seen corresponding path program 2 times [2024-06-03 20:17:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415621507] [2024-06-03 20:17:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:17:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415621507] [2024-06-03 20:17:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415621507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:35,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:35,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:17:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489655348] [2024-06-03 20:17:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:35,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:17:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:17:35,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:17:35,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:17:35,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1022 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-03 20:17:35,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:35,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:17:35,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:36,867 INFO L124 PetriNetUnfolderBase]: 709/1190 cut-off events. [2024-06-03 20:17:36,867 INFO L125 PetriNetUnfolderBase]: For 5508/5517 co-relation queries the response was YES. [2024-06-03 20:17:36,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4833 conditions, 1190 events. 709/1190 cut-off events. For 5508/5517 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5782 event pairs, 293 based on Foata normal form. 2/1190 useless extension candidates. Maximal degree in co-relation 4784. Up to 1077 conditions per place. [2024-06-03 20:17:36,874 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 98 selfloop transitions, 25 changer transitions 0/130 dead transitions. [2024-06-03 20:17:36,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 130 transitions, 1316 flow [2024-06-03 20:17:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 20:17:36,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-03 20:17:36,876 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1022 flow. Second operand 7 states and 127 transitions. [2024-06-03 20:17:36,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 130 transitions, 1316 flow [2024-06-03 20:17:36,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 130 transitions, 1261 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:17:36,887 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 1052 flow [2024-06-03 20:17:36,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2024-06-03 20:17:36,888 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-03 20:17:36,888 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 1052 flow [2024-06-03 20:17:36,888 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-03 20:17:36,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:36,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:36,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:17:36,888 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-03 20:17:36,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -223846577, now seen corresponding path program 3 times [2024-06-03 20:17:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468734313] [2024-06-03 20:17:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:17:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468734313] [2024-06-03 20:17:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468734313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:17:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746147634] [2024-06-03 20:17:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:17:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:17:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:17:40,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:17:40,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 1052 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-03 20:17:40,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:40,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:17:40,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:41,094 INFO L124 PetriNetUnfolderBase]: 706/1186 cut-off events. [2024-06-03 20:17:41,094 INFO L125 PetriNetUnfolderBase]: For 5913/5922 co-relation queries the response was YES. [2024-06-03 20:17:41,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 1186 events. 706/1186 cut-off events. For 5913/5922 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5741 event pairs, 282 based on Foata normal form. 2/1184 useless extension candidates. Maximal degree in co-relation 4841. Up to 1047 conditions per place. [2024-06-03 20:17:41,101 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 102 selfloop transitions, 28 changer transitions 0/137 dead transitions. [2024-06-03 20:17:41,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 137 transitions, 1404 flow [2024-06-03 20:17:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:17:41,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-03 20:17:41,105 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 1052 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:17:41,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 137 transitions, 1404 flow [2024-06-03 20:17:41,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 1335 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:17:41,114 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 1124 flow [2024-06-03 20:17:41,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1124, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2024-06-03 20:17:41,114 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 20:17:41,114 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 1124 flow [2024-06-03 20:17:41,115 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-03 20:17:41,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:41,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:41,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:17:41,115 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:41,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash -510699547, now seen corresponding path program 1 times [2024-06-03 20:17:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838380666] [2024-06-03 20:17:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:42,827 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-03 20:17:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838380666] [2024-06-03 20:17:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838380666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:42,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:42,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208656610] [2024-06-03 20:17:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:42,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:42,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:42,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 1124 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-03 20:17:42,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:42,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:42,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:43,972 INFO L124 PetriNetUnfolderBase]: 1173/1809 cut-off events. [2024-06-03 20:17:43,973 INFO L125 PetriNetUnfolderBase]: For 8518/8603 co-relation queries the response was YES. [2024-06-03 20:17:43,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7382 conditions, 1809 events. 1173/1809 cut-off events. For 8518/8603 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8646 event pairs, 591 based on Foata normal form. 6/1811 useless extension candidates. Maximal degree in co-relation 7330. Up to 1716 conditions per place. [2024-06-03 20:17:43,982 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 104 selfloop transitions, 37 changer transitions 0/147 dead transitions. [2024-06-03 20:17:43,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 147 transitions, 1568 flow [2024-06-03 20:17:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 20:17:43,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-03 20:17:43,986 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 1124 flow. Second operand 7 states and 128 transitions. [2024-06-03 20:17:43,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 147 transitions, 1568 flow [2024-06-03 20:17:43,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 147 transitions, 1495 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:43,998 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 1302 flow [2024-06-03 20:17:43,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1302, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2024-06-03 20:17:43,998 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-03 20:17:43,999 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 140 transitions, 1302 flow [2024-06-03 20:17:43,999 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-03 20:17:43,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:43,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:43,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:17:43,999 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:43,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -816072915, now seen corresponding path program 2 times [2024-06-03 20:17:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457264177] [2024-06-03 20:17:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:17:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457264177] [2024-06-03 20:17:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457264177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412645149] [2024-06-03 20:17:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:45,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:45,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:45,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:45,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:17:45,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 140 transitions, 1302 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-03 20:17:45,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:45,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:17:45,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:46,733 INFO L124 PetriNetUnfolderBase]: 1179/1821 cut-off events. [2024-06-03 20:17:46,734 INFO L125 PetriNetUnfolderBase]: For 10750/10835 co-relation queries the response was YES. [2024-06-03 20:17:46,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8162 conditions, 1821 events. 1179/1821 cut-off events. For 10750/10835 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8756 event pairs, 594 based on Foata normal form. 8/1824 useless extension candidates. Maximal degree in co-relation 8106. Up to 1720 conditions per place. [2024-06-03 20:17:46,744 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 102 selfloop transitions, 52 changer transitions 0/160 dead transitions. [2024-06-03 20:17:46,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 160 transitions, 1817 flow [2024-06-03 20:17:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:17:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:17:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 20:17:46,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 20:17:46,746 INFO L175 Difference]: Start difference. First operand has 119 places, 140 transitions, 1302 flow. Second operand 8 states and 139 transitions. [2024-06-03 20:17:46,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 160 transitions, 1817 flow [2024-06-03 20:17:46,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 160 transitions, 1739 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:46,760 INFO L231 Difference]: Finished difference. Result has 125 places, 154 transitions, 1539 flow [2024-06-03 20:17:46,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1539, PETRI_PLACES=125, PETRI_TRANSITIONS=154} [2024-06-03 20:17:46,761 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-03 20:17:46,761 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 154 transitions, 1539 flow [2024-06-03 20:17:46,761 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-03 20:17:46,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:46,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:46,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:17:46,762 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:46,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash -524783963, now seen corresponding path program 1 times [2024-06-03 20:17:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227411323] [2024-06-03 20:17:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:48,515 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-03 20:17:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:48,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227411323] [2024-06-03 20:17:48,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227411323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:48,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:48,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:48,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132525634] [2024-06-03 20:17:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:48,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:48,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:17:48,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 154 transitions, 1539 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-03 20:17:48,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:48,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:17:48,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:49,525 INFO L124 PetriNetUnfolderBase]: 1001/1608 cut-off events. [2024-06-03 20:17:49,526 INFO L125 PetriNetUnfolderBase]: For 11787/11796 co-relation queries the response was YES. [2024-06-03 20:17:49,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 1608 events. 1001/1608 cut-off events. For 11787/11796 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7853 event pairs, 450 based on Foata normal form. 2/1607 useless extension candidates. Maximal degree in co-relation 7680. Up to 1490 conditions per place. [2024-06-03 20:17:49,536 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 131 selfloop transitions, 25 changer transitions 0/163 dead transitions. [2024-06-03 20:17:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 163 transitions, 1908 flow [2024-06-03 20:17:49,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:17:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:17:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-03 20:17:49,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2024-06-03 20:17:49,537 INFO L175 Difference]: Start difference. First operand has 125 places, 154 transitions, 1539 flow. Second operand 6 states and 113 transitions. [2024-06-03 20:17:49,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 163 transitions, 1908 flow [2024-06-03 20:17:49,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 163 transitions, 1796 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:49,553 INFO L231 Difference]: Finished difference. Result has 128 places, 158 transitions, 1540 flow [2024-06-03 20:17:49,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1540, PETRI_PLACES=128, PETRI_TRANSITIONS=158} [2024-06-03 20:17:49,554 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-03 20:17:49,554 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 158 transitions, 1540 flow [2024-06-03 20:17:49,554 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-03 20:17:49,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:49,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:49,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:17:49,555 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:17:49,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash -511789693, now seen corresponding path program 1 times [2024-06-03 20:17:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:49,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846075762] [2024-06-03 20:17:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:17:49,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:17:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:17:49,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:17:49,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:17:49,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:17:49,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:17:49,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:17:49,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:17:49,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:17:49,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:17:49,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:17:49,608 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:49,611 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:17:49,611 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:17:49,640 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,642 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,644 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,644 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,644 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,645 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,645 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,645 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,645 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,645 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:49,652 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:17:49,664 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:17:49,665 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:17:49,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:17:49 BasicIcfg [2024-06-03 20:17:49,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:17:49,666 INFO L158 Benchmark]: Toolchain (without parser) took 66321.65ms. Allocated memory was 224.4MB in the beginning and 1.2GB in the end (delta: 966.8MB). Free memory was 195.2MB in the beginning and 529.5MB in the end (delta: -334.3MB). Peak memory consumption was 631.7MB. Max. memory is 16.1GB. [2024-06-03 20:17:49,667 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:17:49,667 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:17:49,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.02ms. Allocated memory is still 224.4MB. Free memory was 194.2MB in the beginning and 144.1MB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-03 20:17:49,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.58ms. Allocated memory is still 224.4MB. Free memory was 144.1MB in the beginning and 140.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 20:17:49,668 INFO L158 Benchmark]: Boogie Preprocessor took 86.83ms. Allocated memory is still 224.4MB. Free memory was 140.9MB in the beginning and 135.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 20:17:49,669 INFO L158 Benchmark]: RCFGBuilder took 1054.41ms. Allocated memory is still 224.4MB. Free memory was 135.7MB in the beginning and 89.7MB in the end (delta: 46.0MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-06-03 20:17:49,670 INFO L158 Benchmark]: TraceAbstraction took 64410.79ms. Allocated memory was 224.4MB in the beginning and 1.2GB in the end (delta: 966.8MB). Free memory was 89.7MB in the beginning and 529.5MB in the end (delta: -439.8MB). Peak memory consumption was 529.1MB. Max. memory is 16.1GB. [2024-06-03 20:17:49,671 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.02ms. Allocated memory is still 224.4MB. Free memory was 194.2MB in the beginning and 144.1MB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.58ms. Allocated memory is still 224.4MB. Free memory was 144.1MB in the beginning and 140.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.83ms. Allocated memory is still 224.4MB. Free memory was 140.9MB in the beginning and 135.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1054.41ms. Allocated memory is still 224.4MB. Free memory was 135.7MB in the beginning and 89.7MB in the end (delta: 46.0MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 64410.79ms. Allocated memory was 224.4MB in the beginning and 1.2GB in the end (delta: 966.8MB). Free memory was 89.7MB in the beginning and 529.5MB in the end (delta: -439.8MB). Peak memory consumption was 529.1MB. 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: 857]: 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; [L851] 0 pthread_t t2461; 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] [L852] 0 //@ ghost multithreaded = 1; [L852] FCALL, FORK 0 pthread_create(&t2461, ((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, t2461=-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] [L853] 0 pthread_t t2462; [L854] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 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 <= 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 || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_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 || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_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 || (x$w_buff1 == 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 || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((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, t2461=-2, t2462=-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] [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 pthread_t t2463; [L856] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 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 <= 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 || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_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 || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_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 || (x$w_buff1 == 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 || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \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, t2461=-2, t2462=-1, t2463=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] [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \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=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] [L857] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 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 <= 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 || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_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 || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_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 || (x$w_buff1 == 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 || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); VAL [\old(arg)={0:0}, \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, t2461=-2, t2462=-1, t2463=0, weak$$choice0=1, 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] - UnprovableResult [Line: 854]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 854]: 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: 852]: 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: 64.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 789 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3797 IncrementalHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 44 mSDtfsCounter, 3797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1540occurred in iteration=21, InterpolantAutomatonStates: 138, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 44.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 30538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-03 20:17:49,711 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