./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe014_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe014_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 15:36:30,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:36:30,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:36:30,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:36:30,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:36:30,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:36:30,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:36:30,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:36:30,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:36:30,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:36:30,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:36:30,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:36:30,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:36:30,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:36:30,972 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:36:30,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:36:30,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:36:30,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:36:30,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:36:30,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:36:30,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:36:30,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:36:30,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:36:30,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:36:30,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:36:30,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:36:30,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:36:30,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:36:30,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:36:30,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:36:30,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:36:30,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:36:30,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:36:30,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:36:30,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:36:30,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:36:30,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:36:30,982 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:36:31,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:36:31,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:36:31,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:36:31,240 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:36:31,241 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:36:31,242 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/safe014_rmo.opt.yml/witness.yml [2024-06-04 15:36:31,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:36:31,421 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:36:31,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i [2024-06-04 15:36:32,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:36:32,672 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:36:32,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.opt.i [2024-06-04 15:36:32,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba41456e/de289c2a4bf744c0a0cb90525bed6dd1/FLAGc6aebeb2d [2024-06-04 15:36:32,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba41456e/de289c2a4bf744c0a0cb90525bed6dd1 [2024-06-04 15:36:32,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:36:32,702 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:36:32,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:36:32,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:36:32,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:36:32,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:36:31" (1/2) ... [2024-06-04 15:36:32,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216be784 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:32, skipping insertion in model container [2024-06-04 15:36:32,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:36:31" (1/2) ... [2024-06-04 15:36:32,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e18a69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:32, skipping insertion in model container [2024-06-04 15:36:32,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:36:32" (2/2) ... [2024-06-04 15:36:32,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216be784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:32, skipping insertion in model container [2024-06-04 15:36:32,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:36:32" (2/2) ... [2024-06-04 15:36:32,716 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:36:32,849 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:36:32,850 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_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_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_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 || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 2) && __unbuffered_p0_EBX <= 127) && ((__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) || __unbuffered_p0_EBX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! 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$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-06-04 15:36:32,850 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_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_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_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 || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 2) && __unbuffered_p0_EBX <= 127) && ((__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) || __unbuffered_p0_EBX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! 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$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-06-04 15:36:32,850 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_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_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_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 || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 2) && __unbuffered_p0_EBX <= 127) && ((__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) || __unbuffered_p0_EBX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! 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$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-06-04 15:36:32,851 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:36:32,851 INFO L106 edCorrectnessWitness]: ghost_update [L853-L853] multithreaded = 1; [2024-06-04 15:36:32,889 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:36:33,166 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:36:33,173 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:36:33,314 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:36:33,344 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:36:33,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33 WrapperNode [2024-06-04 15:36:33,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:36:33,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:36:33,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:36:33,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:36:33,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,456 INFO L138 Inliner]: procedures = 175, calls = 107, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 276 [2024-06-04 15:36:33,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:36:33,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:36:33,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:36:33,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:36:33,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,509 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 11 writes are split as follows [0, 11]. [2024-06-04 15:36:33,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:36:33,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:36:33,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:36:33,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:36:33,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (1/1) ... [2024-06-04 15:36:33,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:36:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:36:33,614 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:36:33,632 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:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:36:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:36:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:36:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:36:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:36:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:36:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:36:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:36:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:36:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:36:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:36:33,662 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:36:33,839 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:36:33,842 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:36:34,393 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:36:34,393 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:36:34,764 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:36:34,764 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:36:34,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:36:34 BoogieIcfgContainer [2024-06-04 15:36:34,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:36:34,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:36:34,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:36:34,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:36:34,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:36:31" (1/4) ... [2024-06-04 15:36:34,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efacc1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:36:34, skipping insertion in model container [2024-06-04 15:36:34,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:36:32" (2/4) ... [2024-06-04 15:36:34,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efacc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:36:34, skipping insertion in model container [2024-06-04 15:36:34,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:33" (3/4) ... [2024-06-04 15:36:34,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efacc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:36:34, skipping insertion in model container [2024-06-04 15:36:34,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:36:34" (4/4) ... [2024-06-04 15:36:34,771 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.opt.i [2024-06-04 15:36:34,785 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:36:34,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:36:34,786 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:36:34,831 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:36:34,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:36:34,915 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 15:36:34,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:36:34,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:36:34,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:36:34,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 15:36:34,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:36:34,939 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;@2acf9d9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:36:34,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:36:34,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:36:34,945 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:36:34,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:36:34,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:34,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:36:34,947 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:36:34,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2103469242, now seen corresponding path program 1 times [2024-06-04 15:36:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:34,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028107844] [2024-06-04 15:36:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028107844] [2024-06-04 15:36:37,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028107844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:37,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:36:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197393842] [2024-06-04 15:36:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:37,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:36:37,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:36:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:36:37,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:36:37,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:37,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:37,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:36:37,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:37,591 INFO L124 PetriNetUnfolderBase]: 677/1066 cut-off events. [2024-06-04 15:36:37,591 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-06-04 15:36:37,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1066 events. 677/1066 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4779 event pairs, 311 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 2168. Up to 1029 conditions per place. [2024-06-04 15:36:37,603 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 31 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2024-06-04 15:36:37,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 181 flow [2024-06-04 15:36:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:36:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:36:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-06-04 15:36:37,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2024-06-04 15:36:37,613 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 79 transitions. [2024-06-04 15:36:37,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 181 flow [2024-06-04 15:36:37,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:36:37,618 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-04 15:36:37,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-04 15:36:37,621 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-04 15:36:37,621 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-04 15:36:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:37,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:37,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:37,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:36:37,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:37,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash 880304359, now seen corresponding path program 1 times [2024-06-04 15:36:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184180948] [2024-06-04 15:36:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:39,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184180948] [2024-06-04 15:36:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184180948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:39,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:36:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031371999] [2024-06-04 15:36:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:36:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:36:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:36:39,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:36:39,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:36:39,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:39,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:36:39,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:40,322 INFO L124 PetriNetUnfolderBase]: 722/1135 cut-off events. [2024-06-04 15:36:40,323 INFO L125 PetriNetUnfolderBase]: For 190/192 co-relation queries the response was YES. [2024-06-04 15:36:40,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1135 events. 722/1135 cut-off events. For 190/192 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5197 event pairs, 336 based on Foata normal form. 0/1111 useless extension candidates. Maximal degree in co-relation 2554. Up to 1094 conditions per place. [2024-06-04 15:36:40,329 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 32 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2024-06-04 15:36:40,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 251 flow [2024-06-04 15:36:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:36:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:36:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:36:40,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-04 15:36:40,331 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:36:40,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 251 flow [2024-06-04 15:36:40,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 251 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:36:40,333 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 199 flow [2024-06-04 15:36:40,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-04 15:36:40,334 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-06-04 15:36:40,334 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 199 flow [2024-06-04 15:36:40,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:36:40,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:40,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:40,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:36:40,335 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:36:40,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1334241648, now seen corresponding path program 1 times [2024-06-04 15:36:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361340898] [2024-06-04 15:36:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:43,322 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:36:43,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:43,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361340898] [2024-06-04 15:36:43,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361340898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:43,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276977223] [2024-06-04 15:36:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:43,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:43,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:43,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:36:43,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:43,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:43,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:36:43,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:44,139 INFO L124 PetriNetUnfolderBase]: 905/1419 cut-off events. [2024-06-04 15:36:44,140 INFO L125 PetriNetUnfolderBase]: For 658/665 co-relation queries the response was YES. [2024-06-04 15:36:44,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1419 events. 905/1419 cut-off events. For 658/665 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6366 event pairs, 371 based on Foata normal form. 2/1413 useless extension candidates. Maximal degree in co-relation 3619. Up to 1348 conditions per place. [2024-06-04 15:36:44,147 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 39 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2024-06-04 15:36:44,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 325 flow [2024-06-04 15:36:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:36:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:36:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-04 15:36:44,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2024-06-04 15:36:44,152 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 199 flow. Second operand 5 states and 89 transitions. [2024-06-04 15:36:44,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 325 flow [2024-06-04 15:36:44,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 321 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 15:36:44,155 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 225 flow [2024-06-04 15:36:44,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-04 15:36:44,157 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-04 15:36:44,157 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 225 flow [2024-06-04 15:36:44,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:44,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:44,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:44,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:36:44,158 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:36:44,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash -135011480, now seen corresponding path program 1 times [2024-06-04 15:36:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956651711] [2024-06-04 15:36:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:46,041 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:36:46,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956651711] [2024-06-04 15:36:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956651711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:46,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:46,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:46,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758118404] [2024-06-04 15:36:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:46,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:46,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:36:46,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 225 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:36:46,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:46,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:36:46,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:47,263 INFO L124 PetriNetUnfolderBase]: 725/1160 cut-off events. [2024-06-04 15:36:47,264 INFO L125 PetriNetUnfolderBase]: For 701/701 co-relation queries the response was YES. [2024-06-04 15:36:47,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 1160 events. 725/1160 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5319 event pairs, 239 based on Foata normal form. 3/1161 useless extension candidates. Maximal degree in co-relation 3039. Up to 1083 conditions per place. [2024-06-04 15:36:47,270 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 53 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2024-06-04 15:36:47,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 534 flow [2024-06-04 15:36:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:36:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:36:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 15:36:47,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 15:36:47,272 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 225 flow. Second operand 7 states and 124 transitions. [2024-06-04 15:36:47,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 534 flow [2024-06-04 15:36:47,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 504 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 15:36:47,279 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 383 flow [2024-06-04 15:36:47,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-04 15:36:47,280 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-04 15:36:47,280 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 383 flow [2024-06-04 15:36:47,280 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:36:47,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:47,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:36:47,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:47,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1333050318, now seen corresponding path program 2 times [2024-06-04 15:36:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339464434] [2024-06-04 15:36:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:49,923 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:36:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339464434] [2024-06-04 15:36:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339464434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:49,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734439729] [2024-06-04 15:36:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:50,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:36:50,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:50,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:50,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:36:50,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:50,669 INFO L124 PetriNetUnfolderBase]: 912/1430 cut-off events. [2024-06-04 15:36:50,670 INFO L125 PetriNetUnfolderBase]: For 1404/1435 co-relation queries the response was YES. [2024-06-04 15:36:50,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 1430 events. 912/1430 cut-off events. For 1404/1435 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6455 event pairs, 185 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 4189. Up to 1327 conditions per place. [2024-06-04 15:36:50,679 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 57 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2024-06-04 15:36:50,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 572 flow [2024-06-04 15:36:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:36:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:36:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-04 15:36:50,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-04 15:36:50,684 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 383 flow. Second operand 5 states and 92 transitions. [2024-06-04 15:36:50,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 572 flow [2024-06-04 15:36:50,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 556 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-04 15:36:50,693 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 410 flow [2024-06-04 15:36:50,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-04 15:36:50,696 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-04 15:36:50,696 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 410 flow [2024-06-04 15:36:50,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:50,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:50,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:50,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:36:50,697 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:36:50,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash 109646334, now seen corresponding path program 1 times [2024-06-04 15:36:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831439884] [2024-06-04 15:36:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:52,482 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:36:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831439884] [2024-06-04 15:36:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831439884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25053214] [2024-06-04 15:36:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:52,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:52,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:36:52,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:36:52,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:52,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:36:52,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:53,422 INFO L124 PetriNetUnfolderBase]: 721/1140 cut-off events. [2024-06-04 15:36:53,422 INFO L125 PetriNetUnfolderBase]: For 1523/1525 co-relation queries the response was YES. [2024-06-04 15:36:53,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1140 events. 721/1140 cut-off events. For 1523/1525 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5234 event pairs, 239 based on Foata normal form. 4/1142 useless extension candidates. Maximal degree in co-relation 3551. Up to 1080 conditions per place. [2024-06-04 15:36:53,428 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 21 changer transitions 0/84 dead transitions. [2024-06-04 15:36:53,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 655 flow [2024-06-04 15:36:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:36:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:36:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-04 15:36:53,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2024-06-04 15:36:53,430 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 410 flow. Second operand 6 states and 109 transitions. [2024-06-04 15:36:53,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 655 flow [2024-06-04 15:36:53,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 610 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 15:36:53,433 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 467 flow [2024-06-04 15:36:53,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=467, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2024-06-04 15:36:53,433 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-04 15:36:53,433 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 467 flow [2024-06-04 15:36:53,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:36:53,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:53,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:53,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:36:53,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:53,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 77811118, now seen corresponding path program 1 times [2024-06-04 15:36:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107120139] [2024-06-04 15:36:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:54,978 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:36:54,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107120139] [2024-06-04 15:36:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107120139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:36:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053550619] [2024-06-04 15:36:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:54,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:36:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:36:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:36:55,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:36:55,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:55,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:55,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:36:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:55,856 INFO L124 PetriNetUnfolderBase]: 1059/1615 cut-off events. [2024-06-04 15:36:55,856 INFO L125 PetriNetUnfolderBase]: For 2165/2202 co-relation queries the response was YES. [2024-06-04 15:36:55,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1615 events. 1059/1615 cut-off events. For 2165/2202 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7742 event pairs, 588 based on Foata normal form. 8/1614 useless extension candidates. Maximal degree in co-relation 4900. Up to 1570 conditions per place. [2024-06-04 15:36:55,865 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 60 selfloop transitions, 25 changer transitions 0/91 dead transitions. [2024-06-04 15:36:55,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 792 flow [2024-06-04 15:36:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:36:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:36:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 15:36:55,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:36:55,867 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 467 flow. Second operand 6 states and 108 transitions. [2024-06-04 15:36:55,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 792 flow [2024-06-04 15:36:55,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 91 transitions, 749 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-04 15:36:55,870 INFO L231 Difference]: Finished difference. Result has 74 places, 85 transitions, 647 flow [2024-06-04 15:36:55,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=74, PETRI_TRANSITIONS=85} [2024-06-04 15:36:55,871 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2024-06-04 15:36:55,871 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 647 flow [2024-06-04 15:36:55,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:55,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:55,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:55,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:36:55,872 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:36:55,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1147583345, now seen corresponding path program 1 times [2024-06-04 15:36:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:55,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308812900] [2024-06-04 15:36:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:57,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308812900] [2024-06-04 15:36:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308812900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:36:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847547389] [2024-06-04 15:36:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:36:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:36:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:36:57,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:36:57,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 647 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:36:57,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:57,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:36:57,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:59,702 INFO L124 PetriNetUnfolderBase]: 1212/1904 cut-off events. [2024-06-04 15:36:59,702 INFO L125 PetriNetUnfolderBase]: For 3976/3990 co-relation queries the response was YES. [2024-06-04 15:36:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6596 conditions, 1904 events. 1212/1904 cut-off events. For 3976/3990 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9370 event pairs, 425 based on Foata normal form. 9/1860 useless extension candidates. Maximal degree in co-relation 6560. Up to 1657 conditions per place. [2024-06-04 15:36:59,716 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 53 selfloop transitions, 60 changer transitions 0/118 dead transitions. [2024-06-04 15:36:59,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 118 transitions, 1075 flow [2024-06-04 15:36:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:36:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:36:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 15:36:59,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-04 15:36:59,719 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 647 flow. Second operand 8 states and 143 transitions. [2024-06-04 15:36:59,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 118 transitions, 1075 flow [2024-06-04 15:36:59,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 118 transitions, 1026 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-04 15:36:59,725 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 903 flow [2024-06-04 15:36:59,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=903, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2024-06-04 15:36:59,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-04 15:36:59,727 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 903 flow [2024-06-04 15:36:59,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:36:59,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:59,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:59,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:36:59,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:59,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 155730393, now seen corresponding path program 1 times [2024-06-04 15:36:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:59,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096985336] [2024-06-04 15:36:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:59,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096985336] [2024-06-04 15:37:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096985336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:02,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:37:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671360619] [2024-06-04 15:37:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:02,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:37:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:37:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:37:02,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:37:02,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 transitions, 903 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:02,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:02,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:37:02,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:03,686 INFO L124 PetriNetUnfolderBase]: 1221/1934 cut-off events. [2024-06-04 15:37:03,687 INFO L125 PetriNetUnfolderBase]: For 6885/6889 co-relation queries the response was YES. [2024-06-04 15:37:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 1934 events. 1221/1934 cut-off events. For 6885/6889 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9487 event pairs, 569 based on Foata normal form. 20/1939 useless extension candidates. Maximal degree in co-relation 7334. Up to 1778 conditions per place. [2024-06-04 15:37:03,700 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 88 selfloop transitions, 27 changer transitions 0/120 dead transitions. [2024-06-04 15:37:03,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 120 transitions, 1234 flow [2024-06-04 15:37:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 15:37:03,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 15:37:03,703 INFO L175 Difference]: Start difference. First operand has 82 places, 101 transitions, 903 flow. Second operand 7 states and 123 transitions. [2024-06-04 15:37:03,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 120 transitions, 1234 flow [2024-06-04 15:37:03,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 120 transitions, 1152 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:03,712 INFO L231 Difference]: Finished difference. Result has 86 places, 103 transitions, 910 flow [2024-06-04 15:37:03,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=910, PETRI_PLACES=86, PETRI_TRANSITIONS=103} [2024-06-04 15:37:03,713 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-04 15:37:03,713 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 910 flow [2024-06-04 15:37:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:03,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:03,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:03,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:37:03,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:03,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 156653883, now seen corresponding path program 2 times [2024-06-04 15:37:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919647909] [2024-06-04 15:37:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:06,548 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:37:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919647909] [2024-06-04 15:37:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919647909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:06,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:06,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:37:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569839963] [2024-06-04 15:37:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:06,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:37:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:37:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:37:06,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:37:06,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 910 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:06,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:06,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:37:06,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:07,813 INFO L124 PetriNetUnfolderBase]: 1228/1950 cut-off events. [2024-06-04 15:37:07,814 INFO L125 PetriNetUnfolderBase]: For 6984/6988 co-relation queries the response was YES. [2024-06-04 15:37:07,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7450 conditions, 1950 events. 1228/1950 cut-off events. For 6984/6988 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9637 event pairs, 443 based on Foata normal form. 12/1947 useless extension candidates. Maximal degree in co-relation 7409. Up to 1782 conditions per place. [2024-06-04 15:37:07,828 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 93 selfloop transitions, 22 changer transitions 0/120 dead transitions. [2024-06-04 15:37:07,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 120 transitions, 1245 flow [2024-06-04 15:37:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-04 15:37:07,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 15:37:07,829 INFO L175 Difference]: Start difference. First operand has 86 places, 103 transitions, 910 flow. Second operand 7 states and 119 transitions. [2024-06-04 15:37:07,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 120 transitions, 1245 flow [2024-06-04 15:37:07,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 120 transitions, 1157 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-04 15:37:07,838 INFO L231 Difference]: Finished difference. Result has 90 places, 107 transitions, 944 flow [2024-06-04 15:37:07,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=944, PETRI_PLACES=90, PETRI_TRANSITIONS=107} [2024-06-04 15:37:07,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-04 15:37:07,839 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 107 transitions, 944 flow [2024-06-04 15:37:07,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:07,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:07,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:07,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:37:07,839 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:07,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash 129041439, now seen corresponding path program 2 times [2024-06-04 15:37:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665630202] [2024-06-04 15:37:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:10,354 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:37:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665630202] [2024-06-04 15:37:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665630202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:37:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035979426] [2024-06-04 15:37:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:10,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:37:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:37:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:37:10,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:37:10,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 107 transitions, 944 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:10,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:10,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:37:10,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:11,692 INFO L124 PetriNetUnfolderBase]: 1245/1977 cut-off events. [2024-06-04 15:37:11,693 INFO L125 PetriNetUnfolderBase]: For 6489/6503 co-relation queries the response was YES. [2024-06-04 15:37:11,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 1977 events. 1245/1977 cut-off events. For 6489/6503 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9824 event pairs, 574 based on Foata normal form. 12/1974 useless extension candidates. Maximal degree in co-relation 7434. Up to 1838 conditions per place. [2024-06-04 15:37:11,704 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 88 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2024-06-04 15:37:11,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 1354 flow [2024-06-04 15:37:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:37:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:37:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-04 15:37:11,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 15:37:11,706 INFO L175 Difference]: Start difference. First operand has 90 places, 107 transitions, 944 flow. Second operand 9 states and 144 transitions. [2024-06-04 15:37:11,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 1354 flow [2024-06-04 15:37:11,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 129 transitions, 1311 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-04 15:37:11,715 INFO L231 Difference]: Finished difference. Result has 99 places, 119 transitions, 1120 flow [2024-06-04 15:37:11,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1120, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2024-06-04 15:37:11,715 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2024-06-04 15:37:11,715 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 1120 flow [2024-06-04 15:37:11,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:11,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:11,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:11,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:37:11,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:11,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 160437309, now seen corresponding path program 3 times [2024-06-04 15:37:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330045227] [2024-06-04 15:37:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:14,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:37:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330045227] [2024-06-04 15:37:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330045227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:37:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117161631] [2024-06-04 15:37:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:14,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:37:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:37:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:37:14,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:37:14,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 1120 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:14,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:14,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:37:14,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:15,707 INFO L124 PetriNetUnfolderBase]: 1274/2006 cut-off events. [2024-06-04 15:37:15,707 INFO L125 PetriNetUnfolderBase]: For 8047/8065 co-relation queries the response was YES. [2024-06-04 15:37:15,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8097 conditions, 2006 events. 1274/2006 cut-off events. For 8047/8065 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10021 event pairs, 486 based on Foata normal form. 13/1968 useless extension candidates. Maximal degree in co-relation 8049. Up to 1682 conditions per place. [2024-06-04 15:37:15,718 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 74 changer transitions 0/149 dead transitions. [2024-06-04 15:37:15,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 149 transitions, 1688 flow [2024-06-04 15:37:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:37:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:37:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-04 15:37:15,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-04 15:37:15,719 INFO L175 Difference]: Start difference. First operand has 99 places, 119 transitions, 1120 flow. Second operand 8 states and 137 transitions. [2024-06-04 15:37:15,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 149 transitions, 1688 flow [2024-06-04 15:37:15,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 149 transitions, 1603 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:15,731 INFO L231 Difference]: Finished difference. Result has 106 places, 136 transitions, 1434 flow [2024-06-04 15:37:15,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1434, PETRI_PLACES=106, PETRI_TRANSITIONS=136} [2024-06-04 15:37:15,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-04 15:37:15,732 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 136 transitions, 1434 flow [2024-06-04 15:37:15,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:15,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:15,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:15,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:37:15,733 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:37:15,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 160465209, now seen corresponding path program 4 times [2024-06-04 15:37:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941133963] [2024-06-04 15:37:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:18,307 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:37:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941133963] [2024-06-04 15:37:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941133963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:37:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149302634] [2024-06-04 15:37:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:18,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:37:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:37:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:37:18,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:37:18,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 136 transitions, 1434 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:18,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:18,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:37:18,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:19,780 INFO L124 PetriNetUnfolderBase]: 1276/2010 cut-off events. [2024-06-04 15:37:19,781 INFO L125 PetriNetUnfolderBase]: For 10615/10643 co-relation queries the response was YES. [2024-06-04 15:37:19,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 2010 events. 1276/2010 cut-off events. For 10615/10643 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10113 event pairs, 484 based on Foata normal form. 14/1975 useless extension candidates. Maximal degree in co-relation 8708. Up to 1684 conditions per place. [2024-06-04 15:37:19,794 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 73 selfloop transitions, 74 changer transitions 0/152 dead transitions. [2024-06-04 15:37:19,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 152 transitions, 1844 flow [2024-06-04 15:37:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:37:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:37:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-04 15:37:19,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-04 15:37:19,796 INFO L175 Difference]: Start difference. First operand has 106 places, 136 transitions, 1434 flow. Second operand 8 states and 138 transitions. [2024-06-04 15:37:19,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 152 transitions, 1844 flow [2024-06-04 15:37:19,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 152 transitions, 1738 flow, removed 52 selfloop flow, removed 1 redundant places. [2024-06-04 15:37:19,816 INFO L231 Difference]: Finished difference. Result has 114 places, 139 transitions, 1534 flow [2024-06-04 15:37:19,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1534, PETRI_PLACES=114, PETRI_TRANSITIONS=139} [2024-06-04 15:37:19,817 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-04 15:37:19,817 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 1534 flow [2024-06-04 15:37:19,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:37:19,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:19,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:19,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:37:19,817 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:19,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1762336879, now seen corresponding path program 1 times [2024-06-04 15:37:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:19,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801290987] [2024-06-04 15:37:19,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:19,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:21,653 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:37:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801290987] [2024-06-04 15:37:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801290987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522931048] [2024-06-04 15:37:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:21,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:21,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:21,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:37:21,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 1534 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:37:21,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:21,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:37:21,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:23,070 INFO L124 PetriNetUnfolderBase]: 1170/1807 cut-off events. [2024-06-04 15:37:23,070 INFO L125 PetriNetUnfolderBase]: For 7871/7874 co-relation queries the response was YES. [2024-06-04 15:37:23,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7575 conditions, 1807 events. 1170/1807 cut-off events. For 7871/7874 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8893 event pairs, 571 based on Foata normal form. 3/1805 useless extension candidates. Maximal degree in co-relation 7519. Up to 1714 conditions per place. [2024-06-04 15:37:23,079 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 118 selfloop transitions, 36 changer transitions 0/160 dead transitions. [2024-06-04 15:37:23,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 160 transitions, 2008 flow [2024-06-04 15:37:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 15:37:23,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 15:37:23,081 INFO L175 Difference]: Start difference. First operand has 114 places, 139 transitions, 1534 flow. Second operand 7 states and 124 transitions. [2024-06-04 15:37:23,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 160 transitions, 2008 flow [2024-06-04 15:37:23,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 160 transitions, 1833 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-04 15:37:23,092 INFO L231 Difference]: Finished difference. Result has 118 places, 146 transitions, 1557 flow [2024-06-04 15:37:23,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1557, PETRI_PLACES=118, PETRI_TRANSITIONS=146} [2024-06-04 15:37:23,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-04 15:37:23,093 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 146 transitions, 1557 flow [2024-06-04 15:37:23,093 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:37:23,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:23,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:23,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:37:23,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:23,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1762507441, now seen corresponding path program 1 times [2024-06-04 15:37:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050273976] [2024-06-04 15:37:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:37:23,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:37:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:37:23,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:37:23,146 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:37:23,146 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:37:23,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:37:23,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:37:23,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:37:23,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:37:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:37:23,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:37:23,153 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:23,160 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:37:23,160 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:37:23,196 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,201 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,202 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,202 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,202 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,206 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,207 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,208 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,208 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,210 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,210 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,210 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:23,213 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:37:23,226 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:37:23,230 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:37:23,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:37:23 BasicIcfg [2024-06-04 15:37:23,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:37:23,231 INFO L158 Benchmark]: Toolchain (without parser) took 50529.22ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 103.2MB in the beginning and 556.0MB in the end (delta: -452.8MB). Peak memory consumption was 210.9MB. Max. memory is 16.1GB. [2024-06-04 15:37:23,231 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:37:23,231 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:37:23,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.33ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 49.2MB in the end (delta: 53.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-06-04 15:37:23,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.97ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 48.7MB in the beginning and 211.8MB in the end (delta: -163.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-06-04 15:37:23,232 INFO L158 Benchmark]: Boogie Preprocessor took 92.15ms. Allocated memory is still 245.4MB. Free memory was 211.8MB in the beginning and 206.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:37:23,232 INFO L158 Benchmark]: RCFGBuilder took 1209.68ms. Allocated memory is still 245.4MB. Free memory was 206.5MB in the beginning and 99.4MB in the end (delta: 107.1MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2024-06-04 15:37:23,232 INFO L158 Benchmark]: TraceAbstraction took 48464.82ms. Allocated memory was 245.4MB in the beginning and 828.4MB in the end (delta: 583.0MB). Free memory was 99.4MB in the beginning and 556.0MB in the end (delta: -456.6MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2024-06-04 15:37:23,234 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.33ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 49.2MB in the end (delta: 53.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.97ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 48.7MB in the beginning and 211.8MB in the end (delta: -163.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.15ms. Allocated memory is still 245.4MB. Free memory was 211.8MB in the beginning and 206.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1209.68ms. Allocated memory is still 245.4MB. Free memory was 206.5MB in the beginning and 99.4MB in the end (delta: 107.1MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48464.82ms. Allocated memory was 245.4MB in the beginning and 828.4MB in the end (delta: 583.0MB). Free memory was 99.4MB in the beginning and 556.0MB in the end (delta: -456.6MB). Peak memory consumption was 126.4MB. 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: 858]: 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [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; [L852] 0 pthread_t t2112; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, 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] [L853] 0 //@ ghost multithreaded = 1; [L853] FCALL, FORK 0 pthread_create(&t2112, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, t2112=-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] [L854] 0 pthread_t t2113; [L855] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_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_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_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 || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 2)) && (__unbuffered_p0_EBX <= 127)) && (((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)) || (__unbuffered_p0_EBX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!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$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] FCALL, FORK 0 pthread_create(&t2113, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, t2112=-2, t2113=-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] [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 x [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 pthread_t t2114; [L857] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_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_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_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 || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 2)) && (__unbuffered_p0_EBX <= 127)) && (((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)) || (__unbuffered_p0_EBX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!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$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] FCALL, FORK 0 pthread_create(&t2114, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, t2112=-2, t2113=-1, t2114=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] [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] EXPR 3 \read(x) [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0: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] [L858] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_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_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_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 || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 2)) && (__unbuffered_p0_EBX <= 127)) && (((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)) || (__unbuffered_p0_EBX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!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$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112=-2, t2113=-1, t2114=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] - UnprovableResult [Line: 855]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 853]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2888 IncrementalHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 2 mSDtfsCounter, 2888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=14, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 19475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:37:23,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE