./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.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/safe008_power.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/safe008_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe008_power.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:34:13,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:34:13,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:34:13,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:34:13,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:34:13,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:34:13,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:34:13,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:34:13,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:34:13,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:34:13,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:34:13,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:34:13,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:34:13,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:34:13,931 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:34:13,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:34:13,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:34:13,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:34:13,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:34:13,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:34:13,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:34:13,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:34:13,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:34:13,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:34:13,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:34:13,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:34:13,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:34:13,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:34:13,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:34:13,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:34:13,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:34:13,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:34:13,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:34:13,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:34:13,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:34:13,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:34:13,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:34:13,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:34:13,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:34:13,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:34:13,937 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:34:13,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:34:13,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:34:13,947 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:34:14,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:34:14,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:34:14,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:34:14,116 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:34:14,116 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:34:14,117 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/safe008_power.opt.yml/witness.yml [2024-06-04 15:34:14,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:34:14,337 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:34:14,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i [2024-06-04 15:34:15,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:34:15,594 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:34:15,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i [2024-06-04 15:34:15,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54b98efa/d2da1767bd644789a0515cec0a8964ca/FLAG4ff63d3ad [2024-06-04 15:34:15,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54b98efa/d2da1767bd644789a0515cec0a8964ca [2024-06-04 15:34:15,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:34:15,626 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:34:15,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:34:15,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:34:15,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:34:15,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:34:14" (1/2) ... [2024-06-04 15:34:15,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d393e5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:34:15, skipping insertion in model container [2024-06-04 15:34:15,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:34:14" (1/2) ... [2024-06-04 15:34:15,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7122dec7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:34:15, skipping insertion in model container [2024-06-04 15:34:15,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:34:15" (2/2) ... [2024-06-04 15:34:15,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d393e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:15, skipping insertion in model container [2024-06-04 15:34:15,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:34:15" (2/2) ... [2024-06-04 15:34:15,638 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:34:15,738 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:34:15,739 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0) [2024-06-04 15:34:15,739 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0) [2024-06-04 15:34:15,740 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0) [2024-06-04 15:34:15,740 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:34:15,740 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-04 15:34:15,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:34:16,064 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:34:16,083 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:34:16,214 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:34:16,256 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:34:16,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16 WrapperNode [2024-06-04 15:34:16,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:34:16,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:34:16,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:34:16,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:34:16,266 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:34:16" (1/1) ... [2024-06-04 15:34:16,286 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:34:16" (1/1) ... [2024-06-04 15:34:16,316 INFO L138 Inliner]: procedures = 175, calls = 86, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 251 [2024-06-04 15:34:16,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:34:16,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:34:16,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:34:16,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:34:16,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,377 INFO L175 MemorySlicer]: Split 44 memory accesses to 2 slices as follows [2, 42]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-06-04 15:34:16,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:34:16,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:34:16,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:34:16,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:34:16,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (1/1) ... [2024-06-04 15:34:16,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:34:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:34:16,459 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:34:16,481 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:34:16,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:34:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:34:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:34:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:34:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:34:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:34:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:34:16,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:34:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:34:16,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:34:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:34:16,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:34:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:34:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:34:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:34:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:34:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:34:16,500 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:34:16,642 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:34:16,644 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:34:17,169 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:34:17,169 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:34:17,482 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:34:17,482 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:34:17,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:34:17 BoogieIcfgContainer [2024-06-04 15:34:17,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:34:17,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:34:17,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:34:17,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:34:17,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:34:14" (1/4) ... [2024-06-04 15:34:17,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100f14a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:34:17, skipping insertion in model container [2024-06-04 15:34:17,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:34:15" (2/4) ... [2024-06-04 15:34:17,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100f14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:34:17, skipping insertion in model container [2024-06-04 15:34:17,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:34:16" (3/4) ... [2024-06-04 15:34:17,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100f14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:34:17, skipping insertion in model container [2024-06-04 15:34:17,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:34:17" (4/4) ... [2024-06-04 15:34:17,491 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2024-06-04 15:34:17,504 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:34:17,505 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:34:17,505 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:34:17,569 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:34:17,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:34:17,636 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 15:34:17,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:34:17,639 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 61 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:34:17,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:34:17,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 15:34:17,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:34:17,693 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;@47beb260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:34:17,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:34:17,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:34:17,697 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:34:17,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:34:17,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:17,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:34:17,698 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:34:17,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash 286037497, now seen corresponding path program 1 times [2024-06-04 15:34:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952485056] [2024-06-04 15:34:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:19,989 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:34:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952485056] [2024-06-04 15:34:19,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952485056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:19,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:19,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:34:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191277963] [2024-06-04 15:34:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:19,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:34:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:34:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:34:20,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:20,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:34:20,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:20,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:20,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:20,519 INFO L124 PetriNetUnfolderBase]: 908/1408 cut-off events. [2024-06-04 15:34:20,519 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-04 15:34:20,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1408 events. 908/1408 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6119 event pairs, 528 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 2886. Up to 1392 conditions per place. [2024-06-04 15:34:20,530 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 30 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 15:34:20,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow [2024-06-04 15:34:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:34:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:34:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-04 15:34:20,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-04 15:34:20,541 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 74 transitions. [2024-06-04 15:34:20,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow [2024-06-04 15:34:20,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:20,546 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-04 15:34:20,547 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:34:20,550 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-04 15:34:20,550 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-04 15:34:20,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:34:20,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:20,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:20,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:34:20,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:20,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 4179096, now seen corresponding path program 1 times [2024-06-04 15:34:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72982996] [2024-06-04 15:34:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:22,253 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:34:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72982996] [2024-06-04 15:34:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72982996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:34:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774713064] [2024-06-04 15:34:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:22,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:34:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:34:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:34:22,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:22,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:22,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:22,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:22,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:22,868 INFO L124 PetriNetUnfolderBase]: 909/1417 cut-off events. [2024-06-04 15:34:22,868 INFO L125 PetriNetUnfolderBase]: For 215/224 co-relation queries the response was YES. [2024-06-04 15:34:22,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 1417 events. 909/1417 cut-off events. For 215/224 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6167 event pairs, 449 based on Foata normal form. 2/1409 useless extension candidates. Maximal degree in co-relation 3163. Up to 1361 conditions per place. [2024-06-04 15:34:22,874 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 36 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2024-06-04 15:34:22,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 267 flow [2024-06-04 15:34:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-04 15:34:22,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:34:22,875 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 5 states and 90 transitions. [2024-06-04 15:34:22,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 267 flow [2024-06-04 15:34:22,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:34:22,877 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 192 flow [2024-06-04 15:34:22,877 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-04 15:34:22,878 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-04 15:34:22,878 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 192 flow [2024-06-04 15:34:22,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:22,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:22,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:22,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:34:22,879 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:34:22,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash 5221626, now seen corresponding path program 2 times [2024-06-04 15:34:22,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:22,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647363805] [2024-06-04 15:34:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:24,185 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:34:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647363805] [2024-06-04 15:34:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647363805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:34:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471894834] [2024-06-04 15:34:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:24,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:34:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:34:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:34:24,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:24,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:24,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:24,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:24,706 INFO L124 PetriNetUnfolderBase]: 918/1424 cut-off events. [2024-06-04 15:34:24,707 INFO L125 PetriNetUnfolderBase]: For 420/428 co-relation queries the response was YES. [2024-06-04 15:34:24,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 1424 events. 918/1424 cut-off events. For 420/428 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6114 event pairs, 450 based on Foata normal form. 4/1427 useless extension candidates. Maximal degree in co-relation 3492. Up to 1370 conditions per place. [2024-06-04 15:34:24,713 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 41 selfloop transitions, 16 changer transitions 0/63 dead transitions. [2024-06-04 15:34:24,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 363 flow [2024-06-04 15:34:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-04 15:34:24,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2024-06-04 15:34:24,718 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 192 flow. Second operand 5 states and 99 transitions. [2024-06-04 15:34:24,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 363 flow [2024-06-04 15:34:24,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 361 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-04 15:34:24,721 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 275 flow [2024-06-04 15:34:24,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-04 15:34:24,722 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-06-04 15:34:24,723 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 275 flow [2024-06-04 15:34:24,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:24,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:24,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:34:24,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:24,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 160834194, now seen corresponding path program 1 times [2024-06-04 15:34:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390710340] [2024-06-04 15:34:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390710340] [2024-06-04 15:34:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390710340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967957145] [2024-06-04 15:34:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:26,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:26,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:26,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:34:26,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:26,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:26,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:26,750 INFO L124 PetriNetUnfolderBase]: 920/1433 cut-off events. [2024-06-04 15:34:26,751 INFO L125 PetriNetUnfolderBase]: For 875/910 co-relation queries the response was YES. [2024-06-04 15:34:26,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 1433 events. 920/1433 cut-off events. For 875/910 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6248 event pairs, 453 based on Foata normal form. 8/1436 useless extension candidates. Maximal degree in co-relation 3771. Up to 1383 conditions per place. [2024-06-04 15:34:26,758 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 42 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-04 15:34:26,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 463 flow [2024-06-04 15:34:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 15:34:26,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 15:34:26,759 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 275 flow. Second operand 6 states and 100 transitions. [2024-06-04 15:34:26,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 463 flow [2024-06-04 15:34:26,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 431 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:26,762 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 354 flow [2024-06-04 15:34:26,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2024-06-04 15:34:26,763 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-06-04 15:34:26,763 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 354 flow [2024-06-04 15:34:26,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:34:26,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:26,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:26,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:34:26,764 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:34:26,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:26,765 INFO L85 PathProgramCache]: Analyzing trace with hash 161872074, now seen corresponding path program 2 times [2024-06-04 15:34:26,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:26,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520833585] [2024-06-04 15:34:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:28,217 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:34:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:28,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520833585] [2024-06-04 15:34:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520833585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:28,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:28,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966226895] [2024-06-04 15:34:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:28,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:28,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:28,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:28,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:28,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:34:28,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:28,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:28,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:28,697 INFO L124 PetriNetUnfolderBase]: 922/1432 cut-off events. [2024-06-04 15:34:28,698 INFO L125 PetriNetUnfolderBase]: For 861/876 co-relation queries the response was YES. [2024-06-04 15:34:28,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 1432 events. 922/1432 cut-off events. For 861/876 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6122 event pairs, 448 based on Foata normal form. 8/1439 useless extension candidates. Maximal degree in co-relation 3902. Up to 1387 conditions per place. [2024-06-04 15:34:28,705 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 49 selfloop transitions, 18 changer transitions 0/73 dead transitions. [2024-06-04 15:34:28,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 543 flow [2024-06-04 15:34:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-04 15:34:28,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2024-06-04 15:34:28,706 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 354 flow. Second operand 6 states and 109 transitions. [2024-06-04 15:34:28,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 543 flow [2024-06-04 15:34:28,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 519 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:28,709 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 411 flow [2024-06-04 15:34:28,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2024-06-04 15:34:28,710 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-04 15:34:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 411 flow [2024-06-04 15:34:28,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:34:28,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:28,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:28,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:34:28,711 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:34:28,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash 128854844, now seen corresponding path program 1 times [2024-06-04 15:34:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:28,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652976359] [2024-06-04 15:34:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:29,934 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:34:29,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:29,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652976359] [2024-06-04 15:34:29,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652976359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:29,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:29,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:29,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178561928] [2024-06-04 15:34:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:29,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:29,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:29,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:29,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:34:29,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:29,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:29,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:30,631 INFO L124 PetriNetUnfolderBase]: 978/1519 cut-off events. [2024-06-04 15:34:30,631 INFO L125 PetriNetUnfolderBase]: For 1165/1186 co-relation queries the response was YES. [2024-06-04 15:34:30,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4270 conditions, 1519 events. 978/1519 cut-off events. For 1165/1186 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6633 event pairs, 521 based on Foata normal form. 3/1486 useless extension candidates. Maximal degree in co-relation 4239. Up to 1501 conditions per place. [2024-06-04 15:34:30,639 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 53 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2024-06-04 15:34:30,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 578 flow [2024-06-04 15:34:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-04 15:34:30,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097560975609756 [2024-06-04 15:34:30,641 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 411 flow. Second operand 5 states and 84 transitions. [2024-06-04 15:34:30,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 578 flow [2024-06-04 15:34:30,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 553 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:30,645 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 454 flow [2024-06-04 15:34:30,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-06-04 15:34:30,648 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-04 15:34:30,648 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 454 flow [2024-06-04 15:34:30,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:34:30,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:30,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:30,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:34:30,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:30,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash 161906484, now seen corresponding path program 3 times [2024-06-04 15:34:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938634753] [2024-06-04 15:34:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:32,244 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:34:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938634753] [2024-06-04 15:34:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938634753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:32,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595652342] [2024-06-04 15:34:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:32,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:32,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:32,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:32,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:34:32,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:32,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:32,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:32,834 INFO L124 PetriNetUnfolderBase]: 932/1447 cut-off events. [2024-06-04 15:34:32,834 INFO L125 PetriNetUnfolderBase]: For 1272/1319 co-relation queries the response was YES. [2024-06-04 15:34:32,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4166 conditions, 1447 events. 932/1447 cut-off events. For 1272/1319 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6244 event pairs, 365 based on Foata normal form. 8/1454 useless extension candidates. Maximal degree in co-relation 4131. Up to 1378 conditions per place. [2024-06-04 15:34:32,843 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 60 selfloop transitions, 25 changer transitions 0/91 dead transitions. [2024-06-04 15:34:32,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 734 flow [2024-06-04 15:34:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 15:34:32,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-04 15:34:32,845 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 454 flow. Second operand 7 states and 130 transitions. [2024-06-04 15:34:32,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 734 flow [2024-06-04 15:34:32,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:32,849 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 580 flow [2024-06-04 15:34:32,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=580, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2024-06-04 15:34:32,851 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2024-06-04 15:34:32,851 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 580 flow [2024-06-04 15:34:32,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:34:32,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:32,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:32,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:34:32,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:32,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 724170747, now seen corresponding path program 1 times [2024-06-04 15:34:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:32,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299770911] [2024-06-04 15:34:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:35,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:35,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299770911] [2024-06-04 15:34:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299770911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:35,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:35,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170570198] [2024-06-04 15:34:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:35,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:35,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:35,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 580 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:34:35,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:35,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:35,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:35,920 INFO L124 PetriNetUnfolderBase]: 941/1459 cut-off events. [2024-06-04 15:34:35,920 INFO L125 PetriNetUnfolderBase]: For 2145/2192 co-relation queries the response was YES. [2024-06-04 15:34:35,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4663 conditions, 1459 events. 941/1459 cut-off events. For 2145/2192 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6271 event pairs, 284 based on Foata normal form. 7/1465 useless extension candidates. Maximal degree in co-relation 4625. Up to 1363 conditions per place. [2024-06-04 15:34:35,930 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 64 selfloop transitions, 34 changer transitions 0/104 dead transitions. [2024-06-04 15:34:35,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 104 transitions, 914 flow [2024-06-04 15:34:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:34:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:34:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-04 15:34:35,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-04 15:34:35,932 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 580 flow. Second operand 8 states and 150 transitions. [2024-06-04 15:34:35,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 104 transitions, 914 flow [2024-06-04 15:34:35,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 859 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:35,936 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 681 flow [2024-06-04 15:34:35,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2024-06-04 15:34:35,937 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-04 15:34:35,937 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 681 flow [2024-06-04 15:34:35,937 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:34:35,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:35,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:35,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:34:35,938 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:34:35,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:35,938 INFO L85 PathProgramCache]: Analyzing trace with hash -723484227, now seen corresponding path program 1 times [2024-06-04 15:34:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376945729] [2024-06-04 15:34:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:35,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:37,497 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:34:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376945729] [2024-06-04 15:34:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376945729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962335240] [2024-06-04 15:34:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:37,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:37,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 681 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:34:37,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:37,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:37,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:38,608 INFO L124 PetriNetUnfolderBase]: 1000/1551 cut-off events. [2024-06-04 15:34:38,609 INFO L125 PetriNetUnfolderBase]: For 3055/3071 co-relation queries the response was YES. [2024-06-04 15:34:38,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5311 conditions, 1551 events. 1000/1551 cut-off events. For 3055/3071 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6775 event pairs, 346 based on Foata normal form. 6/1521 useless extension candidates. Maximal degree in co-relation 5270. Up to 1495 conditions per place. [2024-06-04 15:34:38,622 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2024-06-04 15:34:38,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 94 transitions, 920 flow [2024-06-04 15:34:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-04 15:34:38,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-04 15:34:38,624 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 681 flow. Second operand 6 states and 110 transitions. [2024-06-04 15:34:38,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 94 transitions, 920 flow [2024-06-04 15:34:38,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 94 transitions, 848 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-04 15:34:38,631 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 721 flow [2024-06-04 15:34:38,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=721, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2024-06-04 15:34:38,631 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-04 15:34:38,632 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 721 flow [2024-06-04 15:34:38,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:34:38,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:38,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:38,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:34:38,632 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:34:38,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -724496997, now seen corresponding path program 2 times [2024-06-04 15:34:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:38,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369278470] [2024-06-04 15:34:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:40,178 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:34:40,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:40,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369278470] [2024-06-04 15:34:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369278470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:40,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:40,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419417573] [2024-06-04 15:34:40,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:40,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:40,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:40,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:40,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 721 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:34:40,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:40,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:41,179 INFO L124 PetriNetUnfolderBase]: 998/1552 cut-off events. [2024-06-04 15:34:41,180 INFO L125 PetriNetUnfolderBase]: For 3276/3323 co-relation queries the response was YES. [2024-06-04 15:34:41,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 1552 events. 998/1552 cut-off events. For 3276/3323 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6803 event pairs, 351 based on Foata normal form. 12/1527 useless extension candidates. Maximal degree in co-relation 5364. Up to 1493 conditions per place. [2024-06-04 15:34:41,189 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 60 selfloop transitions, 26 changer transitions 0/92 dead transitions. [2024-06-04 15:34:41,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 939 flow [2024-06-04 15:34:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 15:34:41,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 15:34:41,190 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 721 flow. Second operand 6 states and 100 transitions. [2024-06-04 15:34:41,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 939 flow [2024-06-04 15:34:41,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 92 transitions, 900 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:41,195 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 778 flow [2024-06-04 15:34:41,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=778, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-06-04 15:34:41,196 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-04 15:34:41,196 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 778 flow [2024-06-04 15:34:41,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:34:41,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:41,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:41,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:34:41,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:41,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash -52945301, now seen corresponding path program 1 times [2024-06-04 15:34:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:41,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824806188] [2024-06-04 15:34:41,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:43,056 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:34:43,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:43,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824806188] [2024-06-04 15:34:43,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824806188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:43,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:43,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917362408] [2024-06-04 15:34:43,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:43,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:43,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:43,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 778 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:34:43,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:43,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:43,612 INFO L124 PetriNetUnfolderBase]: 944/1472 cut-off events. [2024-06-04 15:34:43,613 INFO L125 PetriNetUnfolderBase]: For 3519/3696 co-relation queries the response was YES. [2024-06-04 15:34:43,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5197 conditions, 1472 events. 944/1472 cut-off events. For 3519/3696 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6381 event pairs, 313 based on Foata normal form. 16/1485 useless extension candidates. Maximal degree in co-relation 5151. Up to 1416 conditions per place. [2024-06-04 15:34:43,621 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 65 selfloop transitions, 24 changer transitions 0/95 dead transitions. [2024-06-04 15:34:43,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 989 flow [2024-06-04 15:34:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 15:34:43,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-04 15:34:43,623 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 778 flow. Second operand 7 states and 111 transitions. [2024-06-04 15:34:43,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 989 flow [2024-06-04 15:34:43,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 956 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:43,631 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 813 flow [2024-06-04 15:34:43,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=813, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-06-04 15:34:43,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-04 15:34:43,633 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 813 flow [2024-06-04 15:34:43,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:34:43,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:43,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:43,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:34:43,634 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:34:43,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash -724491045, now seen corresponding path program 1 times [2024-06-04 15:34:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643452783] [2024-06-04 15:34:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:34:43,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:34:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:34:43,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:34:43,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:34:43,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:34:43,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:34:43,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:34:43,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:34:43,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:34:43,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:34:43,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:34:43,733 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2024-06-04 15:34:43,737 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:34:43,737 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:34:43,768 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,772 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,776 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:34:43,783 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:34:43,797 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:34:43,797 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:34:43,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:34:43 BasicIcfg [2024-06-04 15:34:43,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:34:43,798 INFO L158 Benchmark]: Toolchain (without parser) took 28172.64ms. Allocated memory was 165.7MB in the beginning and 935.3MB in the end (delta: 769.7MB). Free memory was 114.5MB in the beginning and 453.1MB in the end (delta: -338.6MB). Peak memory consumption was 431.4MB. Max. memory is 16.1GB. [2024-06-04 15:34:43,799 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:34:43,799 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:34:43,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.89ms. Allocated memory is still 165.7MB. Free memory was 114.5MB in the beginning and 64.7MB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-04 15:34:43,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.20ms. Allocated memory is still 165.7MB. Free memory was 64.7MB in the beginning and 61.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:34:43,799 INFO L158 Benchmark]: Boogie Preprocessor took 97.83ms. Allocated memory is still 165.7MB. Free memory was 61.0MB in the beginning and 55.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:34:43,800 INFO L158 Benchmark]: RCFGBuilder took 1067.56ms. Allocated memory was 165.7MB in the beginning and 237.0MB in the end (delta: 71.3MB). Free memory was 55.8MB in the beginning and 191.4MB in the end (delta: -135.6MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-06-04 15:34:43,800 INFO L158 Benchmark]: TraceAbstraction took 26312.93ms. Allocated memory was 237.0MB in the beginning and 935.3MB in the end (delta: 698.4MB). Free memory was 190.5MB in the beginning and 453.1MB in the end (delta: -262.7MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. [2024-06-04 15:34:43,801 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.15ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.89ms. Allocated memory is still 165.7MB. Free memory was 114.5MB in the beginning and 64.7MB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.20ms. Allocated memory is still 165.7MB. Free memory was 64.7MB in the beginning and 61.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.83ms. Allocated memory is still 165.7MB. Free memory was 61.0MB in the beginning and 55.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1067.56ms. Allocated memory was 165.7MB in the beginning and 237.0MB in the end (delta: 71.3MB). Free memory was 55.8MB in the beginning and 191.4MB in the end (delta: -135.6MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26312.93ms. Allocated memory was 237.0MB in the beginning and 935.3MB in the end (delta: 698.4MB). Free memory was 190.5MB in the beginning and 453.1MB in the end (delta: -262.7MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L753] 0 int z = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1964; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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, z=0] [L854] 0 //@ ghost multithreaded = 1; [L854] FCALL, FORK 0 pthread_create(&t1964, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1964=-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, z=0] [L855] 0 pthread_t t1965; [L856] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= z) && (z <= 2)) && (z <= 127)) && (((z == 0) || (z == 1)) || (z == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))); [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] FCALL, FORK 0 pthread_create(&t1965, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1964=-2, t1965=-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, z=0] [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 __unbuffered_p1_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L857] 0 pthread_t t1966; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0, z=0] [L858] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= z) && (z <= 2)) && (z <= 127)) && (((z == 0) || (z == 1)) || (z == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1964=-2, t1965=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0, z=0] - UnprovableResult [Line: 856]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 26.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1877 IncrementalHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 41 mSDtfsCounter, 1877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 10088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:34:43,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE