./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe025_power.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i ./goblint.2024-05-21_14-57-05.files/protection/safe025_power.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 15:41:32,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:41:32,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:41:32,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:41:32,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:41:32,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:41:32,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:41:32,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:41:32,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:41:32,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:41:32,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:41:32,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:41:32,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:41:32,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:41:32,758 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:41:32,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:41:32,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:41:32,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:41:32,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:41:32,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:41:32,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:41:32,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:41:32,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:41:32,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:41:32,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:41:32,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:41:32,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:41:32,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:41:32,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:41:32,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:41:32,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:41:32,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:41:32,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:41:32,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:41:32,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:41:32,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:41:32,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:41:32,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:41:32,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:41:32,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:41:32,765 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:41:32,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:41:32,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:41:32,771 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 15:41:32,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:41:32,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:41:32,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:41:32,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:41:32,990 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:41:32,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i [2024-06-04 15:41:34,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:41:34,307 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:41:34,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i [2024-06-04 15:41:34,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000b9fa10/c59f584742e64227a4aa3359ac61c260/FLAGc23ef50c8 [2024-06-04 15:41:34,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000b9fa10/c59f584742e64227a4aa3359ac61c260 [2024-06-04 15:41:34,331 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:41:34,332 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:41:34,332 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/safe025_power.yml/witness.yml [2024-06-04 15:41:34,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:41:34,501 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:41:34,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:41:34,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:41:34,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:41:34,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:41:34" (1/2) ... [2024-06-04 15:41:34,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449d3448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:41:34, skipping insertion in model container [2024-06-04 15:41:34,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:41:34" (1/2) ... [2024-06-04 15:41:34,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27258f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:41:34, skipping insertion in model container [2024-06-04 15:41:34,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:41:34" (2/2) ... [2024-06-04 15:41:34,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449d3448 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:34, skipping insertion in model container [2024-06-04 15:41:34,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:41:34" (2/2) ... [2024-06-04 15:41:34,511 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:41:34,645 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:41:34,647 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2))) [2024-06-04 15:41:34,647 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2))) [2024-06-04 15:41:34,647 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2))) [2024-06-04 15:41:34,647 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:41:34,648 INFO L106 edCorrectnessWitness]: ghost_update [L874-L874] multithreaded = 1; [2024-06-04 15:41:34,699 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:41:35,012 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:41:35,021 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:41:35,198 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:41:35,255 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:41:35,256 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35 WrapperNode [2024-06-04 15:41:35,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:41:35,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:41:35,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:41:35,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:41:35,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,315 INFO L138 Inliner]: procedures = 175, calls = 111, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 339 [2024-06-04 15:41:35,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:41:35,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:41:35,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:41:35,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:41:35,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,364 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [2, 64]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-06-04 15:41:35,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:41:35,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:41:35,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:41:35,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:41:35,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (1/1) ... [2024-06-04 15:41:35,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:41:35,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:41:35,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 15:41:35,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 15:41:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:41:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:41:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:41:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:41:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:41:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:41:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:41:35,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:41:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:41:35,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:41:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:41:35,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:41:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:41:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:41:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:41:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:41:35,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:41:35,521 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 15:41:35,681 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:41:35,682 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:41:36,270 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:41:36,270 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:41:36,792 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:41:36,792 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:41:36,793 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:41:36 BoogieIcfgContainer [2024-06-04 15:41:36,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:41:36,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:41:36,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:41:36,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:41:36,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:41:34" (1/4) ... [2024-06-04 15:41:36,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b65b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:41:36, skipping insertion in model container [2024-06-04 15:41:36,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:41:34" (2/4) ... [2024-06-04 15:41:36,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b65b81 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:41:36, skipping insertion in model container [2024-06-04 15:41:36,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:41:35" (3/4) ... [2024-06-04 15:41:36,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b65b81 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:41:36, skipping insertion in model container [2024-06-04 15:41:36,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:41:36" (4/4) ... [2024-06-04 15:41:36,801 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2024-06-04 15:41:36,815 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:41:36,816 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:41:36,816 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:41:36,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:41:36,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-04 15:41:36,956 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-04 15:41:36,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:41:36,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:41:36,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-04 15:41:36,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-04 15:41:36,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:41:36,980 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;@e1bcb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:41:36,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:41:36,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:41:36,986 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:41:36,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:41:36,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:36,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:41:36,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:36,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1090535608, now seen corresponding path program 1 times [2024-06-04 15:41:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123589289] [2024-06-04 15:41:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123589289] [2024-06-04 15:41:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123589289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:38,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:41:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649644270] [2024-06-04 15:41:38,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:41:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:41:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:41:39,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:41:39,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:39,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:39,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:41:39,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:39,521 INFO L124 PetriNetUnfolderBase]: 743/1226 cut-off events. [2024-06-04 15:41:39,521 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 15:41:39,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1226 events. 743/1226 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5811 event pairs, 414 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 2443. Up to 1145 conditions per place. [2024-06-04 15:41:39,531 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 29 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-04 15:41:39,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow [2024-06-04 15:41:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:41:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:41:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-06-04 15:41:39,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-04 15:41:39,541 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 81 transitions. [2024-06-04 15:41:39,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow [2024-06-04 15:41:39,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:39,545 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 119 flow [2024-06-04 15:41:39,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-04 15:41:39,549 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-04 15:41:39,549 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 119 flow [2024-06-04 15:41:39,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:39,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:39,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:39,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:41:39,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:39,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -32646425, now seen corresponding path program 1 times [2024-06-04 15:41:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291453415] [2024-06-04 15:41:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291453415] [2024-06-04 15:41:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291453415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:41,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:41,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:41:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306300253] [2024-06-04 15:41:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:41,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:41:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:41,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:41:41,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:41:41,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:41:41,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:41,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:41,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:41:41,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:41,737 INFO L124 PetriNetUnfolderBase]: 873/1368 cut-off events. [2024-06-04 15:41:41,737 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-06-04 15:41:41,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1368 events. 873/1368 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6314 event pairs, 317 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 3038. Up to 1301 conditions per place. [2024-06-04 15:41:41,743 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-04 15:41:41,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 267 flow [2024-06-04 15:41:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:41:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:41:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-04 15:41:41,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-04 15:41:41,745 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 119 flow. Second operand 5 states and 96 transitions. [2024-06-04 15:41:41,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 267 flow [2024-06-04 15:41:41,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:41:41,747 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 199 flow [2024-06-04 15:41:41,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-04 15:41:41,747 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-04 15:41:41,748 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 199 flow [2024-06-04 15:41:41,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:41,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:41,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:41,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:41:41,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:41,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash -31693175, now seen corresponding path program 2 times [2024-06-04 15:41:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:41,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462326764] [2024-06-04 15:41:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:43,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-04 15:41:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462326764] [2024-06-04 15:41:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462326764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:43,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:41:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634500234] [2024-06-04 15:41:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:43,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:41:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:41:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:41:43,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:41:43,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:43,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:43,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:41:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:43,644 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-04 15:41:43,644 INFO L125 PetriNetUnfolderBase]: For 529/531 co-relation queries the response was YES. [2024-06-04 15:41:43,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1364 events. 871/1364 cut-off events. For 529/531 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6182 event pairs, 351 based on Foata normal form. 4/1368 useless extension candidates. Maximal degree in co-relation 3306. Up to 1300 conditions per place. [2024-06-04 15:41:43,652 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-06-04 15:41:43,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 335 flow [2024-06-04 15:41:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:41:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:41:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-04 15:41:43,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-04 15:41:43,654 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 199 flow. Second operand 5 states and 101 transitions. [2024-06-04 15:41:43,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 335 flow [2024-06-04 15:41:43,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 15:41:43,659 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 220 flow [2024-06-04 15:41:43,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-04 15:41:43,660 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-04 15:41:43,660 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 220 flow [2024-06-04 15:41:43,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:43,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:43,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:43,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:41:43,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:43,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1012522697, now seen corresponding path program 1 times [2024-06-04 15:41:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:43,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803701426] [2024-06-04 15:41:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803701426] [2024-06-04 15:41:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803701426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:41:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689848265] [2024-06-04 15:41:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:45,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:41:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:41:45,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:41:45,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:41:45,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:45,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:45,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:41:45,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:46,093 INFO L124 PetriNetUnfolderBase]: 789/1281 cut-off events. [2024-06-04 15:41:46,093 INFO L125 PetriNetUnfolderBase]: For 415/417 co-relation queries the response was YES. [2024-06-04 15:41:46,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 1281 events. 789/1281 cut-off events. For 415/417 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6122 event pairs, 425 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 3023. Up to 1218 conditions per place. [2024-06-04 15:41:46,100 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 36 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-04 15:41:46,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 343 flow [2024-06-04 15:41:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:41:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:41:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-04 15:41:46,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-04 15:41:46,103 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 220 flow. Second operand 5 states and 93 transitions. [2024-06-04 15:41:46,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 343 flow [2024-06-04 15:41:46,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:41:46,107 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 240 flow [2024-06-04 15:41:46,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-04 15:41:46,108 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-04 15:41:46,108 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 240 flow [2024-06-04 15:41:46,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:46,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:46,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:46,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:41:46,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:46,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1902657544, now seen corresponding path program 1 times [2024-06-04 15:41:46,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:46,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39499535] [2024-06-04 15:41:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:46,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39499535] [2024-06-04 15:41:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39499535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406181194] [2024-06-04 15:41:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:47,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:47,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:47,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:41:47,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:47,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:47,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:41:47,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:48,816 INFO L124 PetriNetUnfolderBase]: 921/1443 cut-off events. [2024-06-04 15:41:48,817 INFO L125 PetriNetUnfolderBase]: For 460/462 co-relation queries the response was YES. [2024-06-04 15:41:48,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1443 events. 921/1443 cut-off events. For 460/462 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6686 event pairs, 401 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 3471. Up to 1373 conditions per place. [2024-06-04 15:41:48,825 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 41 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-04 15:41:48,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 408 flow [2024-06-04 15:41:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-04 15:41:48,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-04 15:41:48,831 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 240 flow. Second operand 6 states and 113 transitions. [2024-06-04 15:41:48,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 408 flow [2024-06-04 15:41:48,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:41:48,838 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 305 flow [2024-06-04 15:41:48,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-06-04 15:41:48,842 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-04 15:41:48,842 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 305 flow [2024-06-04 15:41:48,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:48,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:48,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:48,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:41:48,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:48,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1923302614, now seen corresponding path program 2 times [2024-06-04 15:41:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274013246] [2024-06-04 15:41:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:50,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:50,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274013246] [2024-06-04 15:41:50,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274013246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:50,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:50,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855908503] [2024-06-04 15:41:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:50,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:41:50,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:50,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:50,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:41:50,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:51,710 INFO L124 PetriNetUnfolderBase]: 917/1437 cut-off events. [2024-06-04 15:41:51,710 INFO L125 PetriNetUnfolderBase]: For 700/702 co-relation queries the response was YES. [2024-06-04 15:41:51,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1437 events. 917/1437 cut-off events. For 700/702 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6720 event pairs, 346 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 3594. Up to 1370 conditions per place. [2024-06-04 15:41:51,717 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 37 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2024-06-04 15:41:51,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 459 flow [2024-06-04 15:41:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:41:51,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-04 15:41:51,718 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 305 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:41:51,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 459 flow [2024-06-04 15:41:51,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 433 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:51,721 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 351 flow [2024-06-04 15:41:51,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-06-04 15:41:51,721 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-06-04 15:41:51,722 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 351 flow [2024-06-04 15:41:51,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:51,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:51,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:41:51,722 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:51,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1924289778, now seen corresponding path program 1 times [2024-06-04 15:41:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568538702] [2024-06-04 15:41:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568538702] [2024-06-04 15:41:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568538702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992927683] [2024-06-04 15:41:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:53,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:53,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:41:53,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:53,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:53,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:41:53,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:54,038 INFO L124 PetriNetUnfolderBase]: 791/1286 cut-off events. [2024-06-04 15:41:54,039 INFO L125 PetriNetUnfolderBase]: For 774/776 co-relation queries the response was YES. [2024-06-04 15:41:54,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3321 conditions, 1286 events. 791/1286 cut-off events. For 774/776 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6111 event pairs, 416 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 3292. Up to 1220 conditions per place. [2024-06-04 15:41:54,045 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 43 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-04 15:41:54,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 487 flow [2024-06-04 15:41:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:41:54,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-04 15:41:54,047 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 351 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:41:54,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 487 flow [2024-06-04 15:41:54,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 460 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:54,050 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 376 flow [2024-06-04 15:41:54,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-06-04 15:41:54,052 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-04 15:41:54,052 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 376 flow [2024-06-04 15:41:54,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:54,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:54,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:54,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:41:54,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:54,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1924322328, now seen corresponding path program 2 times [2024-06-04 15:41:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22824184] [2024-06-04 15:41:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22824184] [2024-06-04 15:41:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22824184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:55,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:55,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151240549] [2024-06-04 15:41:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:55,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:55,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:41:55,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:55,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:55,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:41:55,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:56,400 INFO L124 PetriNetUnfolderBase]: 789/1309 cut-off events. [2024-06-04 15:41:56,401 INFO L125 PetriNetUnfolderBase]: For 1108/1110 co-relation queries the response was YES. [2024-06-04 15:41:56,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 1309 events. 789/1309 cut-off events. For 1108/1110 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6293 event pairs, 408 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 3490. Up to 1208 conditions per place. [2024-06-04 15:41:56,409 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-04 15:41:56,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 562 flow [2024-06-04 15:41:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-04 15:41:56,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 15:41:56,411 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 376 flow. Second operand 6 states and 112 transitions. [2024-06-04 15:41:56,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 562 flow [2024-06-04 15:41:56,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 532 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:41:56,415 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 445 flow [2024-06-04 15:41:56,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-06-04 15:41:56,417 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-04 15:41:56,417 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 445 flow [2024-06-04 15:41:56,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:56,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:56,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:56,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:41:56,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:56,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1063904805, now seen corresponding path program 1 times [2024-06-04 15:41:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:56,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774598272] [2024-06-04 15:41:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774598272] [2024-06-04 15:41:58,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774598272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:58,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637725544] [2024-06-04 15:41:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:58,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:58,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:41:58,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:58,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:58,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:41:58,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:59,144 INFO L124 PetriNetUnfolderBase]: 892/1412 cut-off events. [2024-06-04 15:41:59,144 INFO L125 PetriNetUnfolderBase]: For 1963/2059 co-relation queries the response was YES. [2024-06-04 15:41:59,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 1412 events. 892/1412 cut-off events. For 1963/2059 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6550 event pairs, 316 based on Foata normal form. 2/1408 useless extension candidates. Maximal degree in co-relation 4019. Up to 1335 conditions per place. [2024-06-04 15:41:59,151 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-04 15:41:59,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 615 flow [2024-06-04 15:41:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:41:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:41:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 15:41:59,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-06-04 15:41:59,155 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 445 flow. Second operand 7 states and 118 transitions. [2024-06-04 15:41:59,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 615 flow [2024-06-04 15:41:59,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 575 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:59,160 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 474 flow [2024-06-04 15:41:59,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-06-04 15:41:59,161 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-04 15:41:59,161 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 474 flow [2024-06-04 15:41:59,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:59,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:59,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:59,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:41:59,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:59,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash 942002375, now seen corresponding path program 2 times [2024-06-04 15:41:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:59,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922943739] [2024-06-04 15:41:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922943739] [2024-06-04 15:42:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922943739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142783560] [2024-06-04 15:42:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:01,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:01,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 474 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:01,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:01,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:01,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:01,735 INFO L124 PetriNetUnfolderBase]: 894/1417 cut-off events. [2024-06-04 15:42:01,735 INFO L125 PetriNetUnfolderBase]: For 1957/2055 co-relation queries the response was YES. [2024-06-04 15:42:01,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 1417 events. 894/1417 cut-off events. For 1957/2055 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6546 event pairs, 370 based on Foata normal form. 4/1416 useless extension candidates. Maximal degree in co-relation 4079. Up to 1339 conditions per place. [2024-06-04 15:42:01,746 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 22 changer transitions 0/83 dead transitions. [2024-06-04 15:42:01,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 683 flow [2024-06-04 15:42:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-04 15:42:01,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-04 15:42:01,748 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 474 flow. Second operand 7 states and 125 transitions. [2024-06-04 15:42:01,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 683 flow [2024-06-04 15:42:01,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 635 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:42:01,751 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 513 flow [2024-06-04 15:42:01,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2024-06-04 15:42:01,753 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-04 15:42:01,753 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 513 flow [2024-06-04 15:42:01,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:01,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:01,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:01,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:42:01,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:01,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1915274345, now seen corresponding path program 3 times [2024-06-04 15:42:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775536400] [2024-06-04 15:42:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:03,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:03,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775536400] [2024-06-04 15:42:03,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775536400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:03,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:03,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:03,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486579197] [2024-06-04 15:42:03,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:03,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:03,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:03,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:04,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:04,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 513 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:04,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:04,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:04,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:04,647 INFO L124 PetriNetUnfolderBase]: 895/1421 cut-off events. [2024-06-04 15:42:04,647 INFO L125 PetriNetUnfolderBase]: For 2174/2272 co-relation queries the response was YES. [2024-06-04 15:42:04,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 1421 events. 895/1421 cut-off events. For 2174/2272 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6603 event pairs, 310 based on Foata normal form. 2/1418 useless extension candidates. Maximal degree in co-relation 4201. Up to 1342 conditions per place. [2024-06-04 15:42:04,657 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 62 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-04 15:42:04,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 96 transitions, 822 flow [2024-06-04 15:42:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 15:42:04,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-04 15:42:04,658 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 513 flow. Second operand 7 states and 131 transitions. [2024-06-04 15:42:04,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 96 transitions, 822 flow [2024-06-04 15:42:04,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 762 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:42:04,666 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 626 flow [2024-06-04 15:42:04,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=626, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2024-06-04 15:42:04,667 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2024-06-04 15:42:04,667 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 626 flow [2024-06-04 15:42:04,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:04,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:04,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:04,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:42:04,668 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-04 15:42:04,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1916346635, now seen corresponding path program 4 times [2024-06-04 15:42:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712792368] [2024-06-04 15:42:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712792368] [2024-06-04 15:42:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712792368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833035292] [2024-06-04 15:42:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:06,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:06,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:06,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 626 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:06,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:06,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:06,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:07,504 INFO L124 PetriNetUnfolderBase]: 894/1418 cut-off events. [2024-06-04 15:42:07,504 INFO L125 PetriNetUnfolderBase]: For 2460/2548 co-relation queries the response was YES. [2024-06-04 15:42:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1418 events. 894/1418 cut-off events. For 2460/2548 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6607 event pairs, 207 based on Foata normal form. 2/1415 useless extension candidates. Maximal degree in co-relation 4323. Up to 1298 conditions per place. [2024-06-04 15:42:07,516 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 67 selfloop transitions, 28 changer transitions 0/102 dead transitions. [2024-06-04 15:42:07,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 102 transitions, 891 flow [2024-06-04 15:42:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 15:42:07,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-04 15:42:07,519 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 626 flow. Second operand 7 states and 135 transitions. [2024-06-04 15:42:07,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 102 transitions, 891 flow [2024-06-04 15:42:07,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 840 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 15:42:07,538 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 641 flow [2024-06-04 15:42:07,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=641, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2024-06-04 15:42:07,539 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-04 15:42:07,539 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 641 flow [2024-06-04 15:42:07,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:07,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:07,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:07,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:42:07,540 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-04 15:42:07,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -506944373, now seen corresponding path program 1 times [2024-06-04 15:42:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035321586] [2024-06-04 15:42:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035321586] [2024-06-04 15:42:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035321586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:09,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478939634] [2024-06-04 15:42:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:09,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:09,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:09,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:42:09,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 641 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:09,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:09,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:42:09,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:10,310 INFO L124 PetriNetUnfolderBase]: 801/1316 cut-off events. [2024-06-04 15:42:10,310 INFO L125 PetriNetUnfolderBase]: For 2411/2413 co-relation queries the response was YES. [2024-06-04 15:42:10,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4199 conditions, 1316 events. 801/1316 cut-off events. For 2411/2413 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6300 event pairs, 254 based on Foata normal form. 0/1289 useless extension candidates. Maximal degree in co-relation 4161. Up to 1215 conditions per place. [2024-06-04 15:42:10,321 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 65 selfloop transitions, 33 changer transitions 0/105 dead transitions. [2024-06-04 15:42:10,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 975 flow [2024-06-04 15:42:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:42:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:42:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-04 15:42:10,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2024-06-04 15:42:10,324 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 641 flow. Second operand 9 states and 156 transitions. [2024-06-04 15:42:10,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 975 flow [2024-06-04 15:42:10,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 897 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 15:42:10,331 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 774 flow [2024-06-04 15:42:10,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2024-06-04 15:42:10,332 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-04 15:42:10,332 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 774 flow [2024-06-04 15:42:10,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:10,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:10,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:10,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:42:10,333 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-04 15:42:10,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -475548503, now seen corresponding path program 2 times [2024-06-04 15:42:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914753041] [2024-06-04 15:42:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914753041] [2024-06-04 15:42:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914753041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:11,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:11,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995362346] [2024-06-04 15:42:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:11,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:12,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:42:12,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 774 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:12,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:12,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:42:12,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:12,904 INFO L124 PetriNetUnfolderBase]: 805/1320 cut-off events. [2024-06-04 15:42:12,904 INFO L125 PetriNetUnfolderBase]: For 3571/3575 co-relation queries the response was YES. [2024-06-04 15:42:12,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4572 conditions, 1320 events. 805/1320 cut-off events. For 3571/3575 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6303 event pairs, 246 based on Foata normal form. 4/1324 useless extension candidates. Maximal degree in co-relation 4533. Up to 1223 conditions per place. [2024-06-04 15:42:12,912 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 30 changer transitions 0/112 dead transitions. [2024-06-04 15:42:12,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 112 transitions, 1069 flow [2024-06-04 15:42:12,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:42:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:42:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 15:42:12,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-04 15:42:12,914 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 774 flow. Second operand 8 states and 143 transitions. [2024-06-04 15:42:12,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 112 transitions, 1069 flow [2024-06-04 15:42:12,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 112 transitions, 1025 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-04 15:42:12,921 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 863 flow [2024-06-04 15:42:12,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=863, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2024-06-04 15:42:12,921 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-06-04 15:42:12,921 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 863 flow [2024-06-04 15:42:12,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:12,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:12,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:12,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:42:12,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:12,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -475515023, now seen corresponding path program 3 times [2024-06-04 15:42:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228632547] [2024-06-04 15:42:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228632547] [2024-06-04 15:42:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228632547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:42:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065782637] [2024-06-04 15:42:12,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:12,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 15:42:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:12,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 15:42:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 15:42:12,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-06-04 15:42:12,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:12,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:12,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-06-04 15:42:12,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:13,185 INFO L124 PetriNetUnfolderBase]: 434/890 cut-off events. [2024-06-04 15:42:13,185 INFO L125 PetriNetUnfolderBase]: For 1957/2023 co-relation queries the response was YES. [2024-06-04 15:42:13,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 890 events. 434/890 cut-off events. For 1957/2023 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5088 event pairs, 176 based on Foata normal form. 61/925 useless extension candidates. Maximal degree in co-relation 2662. Up to 508 conditions per place. [2024-06-04 15:42:13,190 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 51 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-06-04 15:42:13,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 816 flow [2024-06-04 15:42:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 15:42:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 15:42:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-04 15:42:13,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-06-04 15:42:13,191 INFO L175 Difference]: Start difference. First operand has 98 places, 106 transitions, 863 flow. Second operand 3 states and 79 transitions. [2024-06-04 15:42:13,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 816 flow [2024-06-04 15:42:13,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 764 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 15:42:13,196 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 654 flow [2024-06-04 15:42:13,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2024-06-04 15:42:13,196 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2024-06-04 15:42:13,196 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 654 flow [2024-06-04 15:42:13,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:13,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:13,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:13,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:42:13,197 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:13,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -507202173, now seen corresponding path program 1 times [2024-06-04 15:42:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124147581] [2024-06-04 15:42:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124147581] [2024-06-04 15:42:14,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124147581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:14,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:14,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:42:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758451455] [2024-06-04 15:42:14,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:14,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:42:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:42:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:42:14,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:42:14,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 654 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:14,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:14,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:42:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:15,208 INFO L124 PetriNetUnfolderBase]: 1212/1929 cut-off events. [2024-06-04 15:42:15,208 INFO L125 PetriNetUnfolderBase]: For 4916/5002 co-relation queries the response was YES. [2024-06-04 15:42:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6552 conditions, 1929 events. 1212/1929 cut-off events. For 4916/5002 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9807 event pairs, 704 based on Foata normal form. 1/1927 useless extension candidates. Maximal degree in co-relation 6515. Up to 1855 conditions per place. [2024-06-04 15:42:15,219 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 72 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-06-04 15:42:15,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 91 transitions, 870 flow [2024-06-04 15:42:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:42:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:42:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-04 15:42:15,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-04 15:42:15,233 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 654 flow. Second operand 5 states and 94 transitions. [2024-06-04 15:42:15,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 91 transitions, 870 flow [2024-06-04 15:42:15,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 91 transitions, 845 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-04 15:42:15,241 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 709 flow [2024-06-04 15:42:15,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=709, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-06-04 15:42:15,242 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-06-04 15:42:15,242 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 709 flow [2024-06-04 15:42:15,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:15,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:15,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:15,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 15:42:15,243 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:15,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1863656329, now seen corresponding path program 1 times [2024-06-04 15:42:15,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:15,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546180863] [2024-06-04 15:42:15,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:16,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546180863] [2024-06-04 15:42:16,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546180863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:16,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776770545] [2024-06-04 15:42:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:16,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:16,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:16,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 709 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:16,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:16,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:16,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:17,845 INFO L124 PetriNetUnfolderBase]: 995/1615 cut-off events. [2024-06-04 15:42:17,845 INFO L125 PetriNetUnfolderBase]: For 4031/4033 co-relation queries the response was YES. [2024-06-04 15:42:17,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5727 conditions, 1615 events. 995/1615 cut-off events. For 4031/4033 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7994 event pairs, 340 based on Foata normal form. 2/1617 useless extension candidates. Maximal degree in co-relation 5686. Up to 1525 conditions per place. [2024-06-04 15:42:17,854 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 79 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-04 15:42:17,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 111 transitions, 1066 flow [2024-06-04 15:42:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 15:42:17,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-04 15:42:17,855 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 709 flow. Second operand 7 states and 130 transitions. [2024-06-04 15:42:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 111 transitions, 1066 flow [2024-06-04 15:42:17,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 111 transitions, 1054 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:42:17,861 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 842 flow [2024-06-04 15:42:17,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=842, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2024-06-04 15:42:17,862 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2024-06-04 15:42:17,862 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 842 flow [2024-06-04 15:42:17,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:17,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:17,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:17,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 15:42:17,863 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:17,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2063970889, now seen corresponding path program 2 times [2024-06-04 15:42:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:17,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096121184] [2024-06-04 15:42:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096121184] [2024-06-04 15:42:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096121184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:19,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:19,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775047354] [2024-06-04 15:42:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:19,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:19,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:19,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:19,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 842 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:19,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:19,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:19,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:20,249 INFO L124 PetriNetUnfolderBase]: 996/1617 cut-off events. [2024-06-04 15:42:20,249 INFO L125 PetriNetUnfolderBase]: For 5246/5248 co-relation queries the response was YES. [2024-06-04 15:42:20,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6093 conditions, 1617 events. 996/1617 cut-off events. For 5246/5248 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8028 event pairs, 347 based on Foata normal form. 1/1618 useless extension candidates. Maximal degree in co-relation 6049. Up to 1551 conditions per place. [2024-06-04 15:42:20,257 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 23 changer transitions 0/108 dead transitions. [2024-06-04 15:42:20,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 1117 flow [2024-06-04 15:42:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-04 15:42:20,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-04 15:42:20,265 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 842 flow. Second operand 7 states and 122 transitions. [2024-06-04 15:42:20,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 1117 flow [2024-06-04 15:42:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 1053 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-04 15:42:20,273 INFO L231 Difference]: Finished difference. Result has 102 places, 102 transitions, 899 flow [2024-06-04 15:42:20,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=899, PETRI_PLACES=102, PETRI_TRANSITIONS=102} [2024-06-04 15:42:20,274 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-04 15:42:20,274 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 102 transitions, 899 flow [2024-06-04 15:42:20,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:20,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:20,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 15:42:20,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:20,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1457919957, now seen corresponding path program 3 times [2024-06-04 15:42:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:20,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433933724] [2024-06-04 15:42:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:21,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-04 15:42:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433933724] [2024-06-04 15:42:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433933724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131318291] [2024-06-04 15:42:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:21,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:21,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:21,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 899 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:21,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:21,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:21,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:22,605 INFO L124 PetriNetUnfolderBase]: 995/1615 cut-off events. [2024-06-04 15:42:22,606 INFO L125 PetriNetUnfolderBase]: For 5582/5584 co-relation queries the response was YES. [2024-06-04 15:42:22,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 1615 events. 995/1615 cut-off events. For 5582/5584 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8008 event pairs, 349 based on Foata normal form. 1/1615 useless extension candidates. Maximal degree in co-relation 6123. Up to 1549 conditions per place. [2024-06-04 15:42:22,615 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 24 changer transitions 0/109 dead transitions. [2024-06-04 15:42:22,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 1160 flow [2024-06-04 15:42:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 15:42:22,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-04 15:42:22,617 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 899 flow. Second operand 7 states and 116 transitions. [2024-06-04 15:42:22,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 1160 flow [2024-06-04 15:42:22,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 1101 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 15:42:22,626 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 946 flow [2024-06-04 15:42:22,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=946, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2024-06-04 15:42:22,626 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-04 15:42:22,626 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 946 flow [2024-06-04 15:42:22,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:22,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:22,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:22,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 15:42:22,627 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:22,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1510980689, now seen corresponding path program 4 times [2024-06-04 15:42:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051081753] [2024-06-04 15:42:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051081753] [2024-06-04 15:42:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051081753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615034055] [2024-06-04 15:42:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:24,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:24,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:24,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 946 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:24,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:24,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:24,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:24,934 INFO L124 PetriNetUnfolderBase]: 996/1617 cut-off events. [2024-06-04 15:42:24,934 INFO L125 PetriNetUnfolderBase]: For 5944/5946 co-relation queries the response was YES. [2024-06-04 15:42:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6260 conditions, 1617 events. 996/1617 cut-off events. For 5944/5946 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8002 event pairs, 348 based on Foata normal form. 1/1617 useless extension candidates. Maximal degree in co-relation 6210. Up to 1548 conditions per place. [2024-06-04 15:42:24,943 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 76 selfloop transitions, 29 changer transitions 0/111 dead transitions. [2024-06-04 15:42:24,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 1196 flow [2024-06-04 15:42:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 15:42:24,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-04 15:42:24,949 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 946 flow. Second operand 7 states and 116 transitions. [2024-06-04 15:42:24,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 1196 flow [2024-06-04 15:42:24,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 1148 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-04 15:42:24,957 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 993 flow [2024-06-04 15:42:24,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=993, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-06-04 15:42:24,958 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-04 15:42:24,958 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 993 flow [2024-06-04 15:42:24,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:24,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:24,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:24,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 15:42:24,959 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:24,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1856304679, now seen corresponding path program 5 times [2024-06-04 15:42:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:24,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964394871] [2024-06-04 15:42:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964394871] [2024-06-04 15:42:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964394871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:26,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643162869] [2024-06-04 15:42:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:26,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:26,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 993 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:26,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:26,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:26,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:27,359 INFO L124 PetriNetUnfolderBase]: 999/1623 cut-off events. [2024-06-04 15:42:27,360 INFO L125 PetriNetUnfolderBase]: For 6673/6675 co-relation queries the response was YES. [2024-06-04 15:42:27,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 1623 events. 999/1623 cut-off events. For 6673/6675 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8062 event pairs, 316 based on Foata normal form. 2/1624 useless extension candidates. Maximal degree in co-relation 6325. Up to 1495 conditions per place. [2024-06-04 15:42:27,370 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 90 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-04 15:42:27,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 130 transitions, 1471 flow [2024-06-04 15:42:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 15:42:27,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-04 15:42:27,372 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 993 flow. Second operand 7 states and 131 transitions. [2024-06-04 15:42:27,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 130 transitions, 1471 flow [2024-06-04 15:42:27,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 130 transitions, 1394 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 15:42:27,408 INFO L231 Difference]: Finished difference. Result has 113 places, 116 transitions, 1099 flow [2024-06-04 15:42:27,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1099, PETRI_PLACES=113, PETRI_TRANSITIONS=116} [2024-06-04 15:42:27,408 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-04 15:42:27,409 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 116 transitions, 1099 flow [2024-06-04 15:42:27,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:27,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:27,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:27,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 15:42:27,409 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:27,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1857109129, now seen corresponding path program 6 times [2024-06-04 15:42:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956431664] [2024-06-04 15:42:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956431664] [2024-06-04 15:42:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956431664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:29,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:42:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080484305] [2024-06-04 15:42:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:29,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:42:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:42:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:42:29,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:29,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 1099 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:29,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:29,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:29,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:29,824 INFO L124 PetriNetUnfolderBase]: 1000/1624 cut-off events. [2024-06-04 15:42:29,825 INFO L125 PetriNetUnfolderBase]: For 8099/8101 co-relation queries the response was YES. [2024-06-04 15:42:29,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6706 conditions, 1624 events. 1000/1624 cut-off events. For 8099/8101 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8061 event pairs, 317 based on Foata normal form. 2/1625 useless extension candidates. Maximal degree in co-relation 6652. Up to 1497 conditions per place. [2024-06-04 15:42:29,834 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-06-04 15:42:29,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 129 transitions, 1487 flow [2024-06-04 15:42:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:42:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:42:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 15:42:29,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-04 15:42:29,836 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 1099 flow. Second operand 7 states and 127 transitions. [2024-06-04 15:42:29,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 129 transitions, 1487 flow [2024-06-04 15:42:29,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 129 transitions, 1368 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-04 15:42:29,846 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 1112 flow [2024-06-04 15:42:29,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1112, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2024-06-04 15:42:29,847 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-04 15:42:29,847 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 1112 flow [2024-06-04 15:42:29,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:29,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:29,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:29,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 15:42:29,848 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:29,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2107470366, now seen corresponding path program 1 times [2024-06-04 15:42:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027062701] [2024-06-04 15:42:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:31,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:31,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027062701] [2024-06-04 15:42:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027062701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:31,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70534105] [2024-06-04 15:42:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:31,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:31,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:31,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 1112 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:31,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:31,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:31,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:32,115 INFO L124 PetriNetUnfolderBase]: 1501/2339 cut-off events. [2024-06-04 15:42:32,115 INFO L125 PetriNetUnfolderBase]: For 8744/8902 co-relation queries the response was YES. [2024-06-04 15:42:32,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8921 conditions, 2339 events. 1501/2339 cut-off events. For 8744/8902 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11802 event pairs, 839 based on Foata normal form. 2/2340 useless extension candidates. Maximal degree in co-relation 8866. Up to 2246 conditions per place. [2024-06-04 15:42:32,129 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 31 changer transitions 0/131 dead transitions. [2024-06-04 15:42:32,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 131 transitions, 1473 flow [2024-06-04 15:42:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:42:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:42:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-04 15:42:32,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-04 15:42:32,130 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 1112 flow. Second operand 6 states and 113 transitions. [2024-06-04 15:42:32,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 131 transitions, 1473 flow [2024-06-04 15:42:32,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 131 transitions, 1398 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 15:42:32,146 INFO L231 Difference]: Finished difference. Result has 119 places, 125 transitions, 1206 flow [2024-06-04 15:42:32,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1206, PETRI_PLACES=119, PETRI_TRANSITIONS=125} [2024-06-04 15:42:32,147 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-06-04 15:42:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 1206 flow [2024-06-04 15:42:32,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:32,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:32,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 15:42:32,148 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:32,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2089941726, now seen corresponding path program 2 times [2024-06-04 15:42:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594694060] [2024-06-04 15:42:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:33,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:33,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594694060] [2024-06-04 15:42:33,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594694060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:33,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675369218] [2024-06-04 15:42:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:33,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:33,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:33,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:42:33,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 125 transitions, 1206 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:33,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:33,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:42:33,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:34,641 INFO L124 PetriNetUnfolderBase]: 1495/2330 cut-off events. [2024-06-04 15:42:34,641 INFO L125 PetriNetUnfolderBase]: For 9580/9762 co-relation queries the response was YES. [2024-06-04 15:42:34,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9295 conditions, 2330 events. 1495/2330 cut-off events. For 9580/9762 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11752 event pairs, 834 based on Foata normal form. 2/2328 useless extension candidates. Maximal degree in co-relation 9238. Up to 2241 conditions per place. [2024-06-04 15:42:34,657 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2024-06-04 15:42:34,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 134 transitions, 1580 flow [2024-06-04 15:42:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:42:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:42:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 15:42:34,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 15:42:34,659 INFO L175 Difference]: Start difference. First operand has 119 places, 125 transitions, 1206 flow. Second operand 6 states and 108 transitions. [2024-06-04 15:42:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 134 transitions, 1580 flow [2024-06-04 15:42:34,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 1536 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 15:42:34,672 INFO L231 Difference]: Finished difference. Result has 122 places, 130 transitions, 1322 flow [2024-06-04 15:42:34,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=122, PETRI_TRANSITIONS=130} [2024-06-04 15:42:34,673 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-06-04 15:42:34,673 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 130 transitions, 1322 flow [2024-06-04 15:42:34,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:34,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:34,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:34,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 15:42:34,674 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:34,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2088832732, now seen corresponding path program 1 times [2024-06-04 15:42:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464993799] [2024-06-04 15:42:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464993799] [2024-06-04 15:42:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464993799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494075203] [2024-06-04 15:42:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:36,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:36,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:42:36,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 1322 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:36,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:36,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:42:36,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:37,097 INFO L124 PetriNetUnfolderBase]: 1246/2003 cut-off events. [2024-06-04 15:42:37,097 INFO L125 PetriNetUnfolderBase]: For 9372/9554 co-relation queries the response was YES. [2024-06-04 15:42:37,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8307 conditions, 2003 events. 1246/2003 cut-off events. For 9372/9554 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10310 event pairs, 633 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 8249. Up to 1906 conditions per place. [2024-06-04 15:42:37,112 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 112 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-06-04 15:42:37,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 137 transitions, 1630 flow [2024-06-04 15:42:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:42:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:42:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-04 15:42:37,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-04 15:42:37,114 INFO L175 Difference]: Start difference. First operand has 122 places, 130 transitions, 1322 flow. Second operand 6 states and 111 transitions. [2024-06-04 15:42:37,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 137 transitions, 1630 flow [2024-06-04 15:42:37,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 137 transitions, 1588 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:42:37,130 INFO L231 Difference]: Finished difference. Result has 126 places, 133 transitions, 1359 flow [2024-06-04 15:42:37,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1359, PETRI_PLACES=126, PETRI_TRANSITIONS=133} [2024-06-04 15:42:37,131 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-04 15:42:37,131 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 133 transitions, 1359 flow [2024-06-04 15:42:37,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:37,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:37,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:37,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 15:42:37,132 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:37,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2089934782, now seen corresponding path program 2 times [2024-06-04 15:42:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:37,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411842493] [2024-06-04 15:42:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:42:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:42:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:42:38,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411842493] [2024-06-04 15:42:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411842493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:42:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:42:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:42:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645666914] [2024-06-04 15:42:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:42:38,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:42:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:42:38,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:42:38,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:42:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-04 15:42:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 133 transitions, 1359 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:42:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-04 15:42:38,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:42:39,191 INFO L124 PetriNetUnfolderBase]: 1244/2000 cut-off events. [2024-06-04 15:42:39,191 INFO L125 PetriNetUnfolderBase]: For 10794/10976 co-relation queries the response was YES. [2024-06-04 15:42:39,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8647 conditions, 2000 events. 1244/2000 cut-off events. For 10794/10976 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10269 event pairs, 633 based on Foata normal form. 1/1999 useless extension candidates. Maximal degree in co-relation 8586. Up to 1913 conditions per place. [2024-06-04 15:42:39,204 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 116 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2024-06-04 15:42:39,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 1655 flow [2024-06-04 15:42:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:42:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:42:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:42:39,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-04 15:42:39,205 INFO L175 Difference]: Start difference. First operand has 126 places, 133 transitions, 1359 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:42:39,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 1655 flow [2024-06-04 15:42:39,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 137 transitions, 1624 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:42:39,218 INFO L231 Difference]: Finished difference. Result has 129 places, 135 transitions, 1393 flow [2024-06-04 15:42:39,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1393, PETRI_PLACES=129, PETRI_TRANSITIONS=135} [2024-06-04 15:42:39,219 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places. [2024-06-04 15:42:39,219 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 135 transitions, 1393 flow [2024-06-04 15:42:39,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:42:39,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:42:39,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:42:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 15:42:39,219 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:42:39,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:42:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2089928830, now seen corresponding path program 1 times [2024-06-04 15:42:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:42:39,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020319310] [2024-06-04 15:42:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:42:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:42:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:42:39,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:42:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:42:39,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:42:39,404 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:42:39,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:42:39,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:42:39,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:42:39,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:42:39,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:42:39,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:42:39,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 15:42:39,409 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-06-04 15:42:39,413 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:42:39,413 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:42:39,463 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,467 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,468 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,468 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,468 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,468 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,471 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,471 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,472 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,475 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,475 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,475 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,475 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,476 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:42:39,481 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:42:39,494 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:42:39,495 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:42:39,496 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:42:39 BasicIcfg [2024-06-04 15:42:39,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:42:39,496 INFO L158 Benchmark]: Toolchain (without parser) took 64995.03ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 69.9MB in the beginning and 975.5MB in the end (delta: -905.6MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. [2024-06-04 15:42:39,496 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:42:39,496 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:42:39,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 754.12ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 69.9MB in the beginning and 128.0MB in the end (delta: -58.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-06-04 15:42:39,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.92ms. Allocated memory is still 188.7MB. Free memory was 126.9MB in the beginning and 122.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:42:39,497 INFO L158 Benchmark]: Boogie Preprocessor took 87.57ms. Allocated memory is still 188.7MB. Free memory was 122.7MB in the beginning and 117.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:42:39,498 INFO L158 Benchmark]: RCFGBuilder took 1383.84ms. Allocated memory was 188.7MB in the beginning and 264.2MB in the end (delta: 75.5MB). Free memory was 116.4MB in the beginning and 212.2MB in the end (delta: -95.7MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-06-04 15:42:39,498 INFO L158 Benchmark]: TraceAbstraction took 62699.82ms. Allocated memory was 264.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 212.2MB in the beginning and 975.5MB in the end (delta: -763.3MB). Peak memory consumption was 252.7MB. Max. memory is 16.1GB. [2024-06-04 15:42:39,499 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 754.12ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 69.9MB in the beginning and 128.0MB in the end (delta: -58.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.92ms. Allocated memory is still 188.7MB. Free memory was 126.9MB in the beginning and 122.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.57ms. Allocated memory is still 188.7MB. Free memory was 122.7MB in the beginning and 117.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1383.84ms. Allocated memory was 188.7MB in the beginning and 264.2MB in the end (delta: 75.5MB). Free memory was 116.4MB in the beginning and 212.2MB in the end (delta: -95.7MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * TraceAbstraction took 62699.82ms. Allocated memory was 264.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 212.2MB in the beginning and 975.5MB in the end (delta: -763.3MB). Peak memory consumption was 252.7MB. 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: 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: 879]: 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; [L873] 0 pthread_t t2369; 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] [L874] 0 //@ ghost multithreaded = 1; [L874] FCALL, FORK 0 pthread_create(&t2369, ((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, t2369=-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] [L875] 0 pthread_t t2370; [L876] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))); [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] FCALL, FORK 0 pthread_create(&t2370, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, t2370=-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] [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L877] 0 pthread_t t2371; [L878] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))); [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] FCALL, FORK 0 pthread_create(&t2371, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, t2370=-1, t2371=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] [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L829] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 3 x$flush_delayed = weak$$choice2 [L832] EXPR 3 \read(x) [L832] 3 x$mem_tmp = x [L833] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L834] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L834] EXPR 3 \read(x) [L834] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L834] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L835] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L836] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L837] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L838] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L839] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L840] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L841] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L842] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L843] EXPR 3 \read(x) [L843] 3 __unbuffered_p2_EAX = x [L844] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L844] EXPR 3 \read(x) [L844] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L844] 3 x = x$flush_delayed ? x$mem_tmp : x [L845] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=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] [L879] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, t2370=-1, t2371=0, weak$$choice0=1, weak$$choice1=1, 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: 876]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 878]: 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: 876]: 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, 68 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: 62.5s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 765 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5001 IncrementalHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 85 mSDtfsCounter, 5001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=26, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 30952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-04 15:42:39,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE