./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_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/safe018_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/safe018_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe018_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-03 20:11:31,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:11:32,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:11:32,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:11:32,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:11:32,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:11:32,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:11:32,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:11:32,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:11:32,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:11:32,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:11:32,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:11:32,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:11:32,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:11:32,100 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:11:32,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:11:32,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:11:32,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:11:32,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:11:32,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:11:32,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:11:32,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:11:32,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:11:32,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:11:32,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:11:32,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:11:32,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:11:32,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:11:32,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:11:32,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:11:32,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:11:32,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:11:32,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:11:32,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:11:32,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:11:32,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:11:32,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:11:32,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:11:32,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:11:32,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:11:32,107 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:11:32,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:11:32,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:11:32,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 20:11:32,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:11:32,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:11:32,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:11:32,334 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:11:32,335 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:11:32,336 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/safe018_power.opt.yml/witness.yml [2024-06-03 20:11:32,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:11:32,536 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:11:32,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2024-06-03 20:11:33,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:11:33,794 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:11:33,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2024-06-03 20:11:33,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb016e0d4/ce6850c33db542dfbee80a85af4bbcc3/FLAGdd59d907a [2024-06-03 20:11:33,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb016e0d4/ce6850c33db542dfbee80a85af4bbcc3 [2024-06-03 20:11:33,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:11:33,817 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:11:33,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:11:33,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:11:33,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:11:33,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:11:32" (1/2) ... [2024-06-03 20:11:33,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f41ba3b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:33, skipping insertion in model container [2024-06-03 20:11:33,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:11:32" (1/2) ... [2024-06-03 20:11:33,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49e5e635 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:33, skipping insertion in model container [2024-06-03 20:11:33,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:11:33" (2/2) ... [2024-06-03 20:11:33,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f41ba3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:33, skipping insertion in model container [2024-06-03 20:11:33,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:11:33" (2/2) ... [2024-06-03 20:11:33,825 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:11:33,988 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:11:33,989 INFO L97 edCorrectnessWitness]: Location invariant before [L862-L862] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-03 20:11:33,989 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-03 20:11:33,990 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-03 20:11:33,990 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:11:33,990 INFO L106 edCorrectnessWitness]: ghost_update [L860-L860] multithreaded = 1; [2024-06-03 20:11:34,025 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:11:34,356 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:11:34,363 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:11:34,487 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:11:34,524 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:11:34,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34 WrapperNode [2024-06-03 20:11:34,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:11:34,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:11:34,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:11:34,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:11:34,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,573 INFO L138 Inliner]: procedures = 175, calls = 88, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 248 [2024-06-03 20:11:34,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:11:34,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:11:34,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:11:34,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:11:34,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,607 INFO L175 MemorySlicer]: Split 48 memory accesses to 2 slices as follows [2, 46]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-06-03 20:11:34,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:11:34,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:11:34,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:11:34,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:11:34,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (1/1) ... [2024-06-03 20:11:34,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:11:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:11:34,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 20:11:34,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 20:11:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:11:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:11:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:11:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:11:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:11:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:11:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:11:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:11:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:11:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:11:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:11:34,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:11:34,688 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:11:34,808 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:11:34,809 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:11:35,250 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:11:35,251 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:11:35,584 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:11:35,585 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:11:35,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:11:35 BoogieIcfgContainer [2024-06-03 20:11:35,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:11:35,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:11:35,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:11:35,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:11:35,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:11:32" (1/4) ... [2024-06-03 20:11:35,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485ed9c3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:11:35, skipping insertion in model container [2024-06-03 20:11:35,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:11:33" (2/4) ... [2024-06-03 20:11:35,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485ed9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:11:35, skipping insertion in model container [2024-06-03 20:11:35,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:34" (3/4) ... [2024-06-03 20:11:35,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485ed9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:11:35, skipping insertion in model container [2024-06-03 20:11:35,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:11:35" (4/4) ... [2024-06-03 20:11:35,597 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2024-06-03 20:11:35,610 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:11:35,611 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:11:35,611 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:11:35,669 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:11:35,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-03 20:11:35,725 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-03 20:11:35,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:11:35,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:11:35,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-03 20:11:35,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-03 20:11:35,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:11:35,746 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;@2d5afa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:11:35,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:11:35,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:11:35,750 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:11:35,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:11:35,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:35,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:11:35,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1392389001, now seen corresponding path program 1 times [2024-06-03 20:11:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:35,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999114019] [2024-06-03 20:11:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:37,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999114019] [2024-06-03 20:11:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999114019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:37,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:11:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368473266] [2024-06-03 20:11:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:37,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:11:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:11:37,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:11:37,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:37,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:37,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:37,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:38,286 INFO L124 PetriNetUnfolderBase]: 556/885 cut-off events. [2024-06-03 20:11:38,286 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-03 20:11:38,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 885 events. 556/885 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3892 event pairs, 241 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1798. Up to 848 conditions per place. [2024-06-03 20:11:38,294 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 30 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 20:11:38,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 177 flow [2024-06-03 20:11:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:11:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:11:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-06-03 20:11:38,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-06-03 20:11:38,304 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 4 states and 78 transitions. [2024-06-03 20:11:38,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 177 flow [2024-06-03 20:11:38,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:11:38,308 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 115 flow [2024-06-03 20:11:38,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-06-03 20:11:38,312 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-06-03 20:11:38,312 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 115 flow [2024-06-03 20:11:38,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:38,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:38,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:38,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:11:38,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:38,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash -132479638, now seen corresponding path program 1 times [2024-06-03 20:11:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402123109] [2024-06-03 20:11:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402123109] [2024-06-03 20:11:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402123109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:11:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504035513] [2024-06-03 20:11:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:39,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:11:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:11:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:11:39,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:39,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:39,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:39,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:39,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:40,510 INFO L124 PetriNetUnfolderBase]: 582/925 cut-off events. [2024-06-03 20:11:40,511 INFO L125 PetriNetUnfolderBase]: For 163/165 co-relation queries the response was YES. [2024-06-03 20:11:40,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 925 events. 582/925 cut-off events. For 163/165 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4098 event pairs, 267 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 2099. Up to 890 conditions per place. [2024-06-03 20:11:40,517 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 29 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2024-06-03 20:11:40,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 221 flow [2024-06-03 20:11:40,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:11:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:11:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-03 20:11:40,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-06-03 20:11:40,522 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 115 flow. Second operand 5 states and 89 transitions. [2024-06-03 20:11:40,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 221 flow [2024-06-03 20:11:40,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:11:40,525 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 166 flow [2024-06-03 20:11:40,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-06-03 20:11:40,528 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2024-06-03 20:11:40,528 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 166 flow [2024-06-03 20:11:40,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:40,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:40,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:40,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:11:40,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:40,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1033901465, now seen corresponding path program 1 times [2024-06-03 20:11:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381522512] [2024-06-03 20:11:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381522512] [2024-06-03 20:11:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381522512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923978418] [2024-06-03 20:11:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:43,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:43,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:11:43,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 166 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-03 20:11:43,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:43,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:11:43,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:43,781 INFO L124 PetriNetUnfolderBase]: 715/1129 cut-off events. [2024-06-03 20:11:43,782 INFO L125 PetriNetUnfolderBase]: For 284/305 co-relation queries the response was YES. [2024-06-03 20:11:43,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 1129 events. 715/1129 cut-off events. For 284/305 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4839 event pairs, 277 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 2663. Up to 1070 conditions per place. [2024-06-03 20:11:43,787 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 34 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2024-06-03 20:11:43,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 278 flow [2024-06-03 20:11:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:11:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:11:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-03 20:11:43,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-03 20:11:43,789 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 166 flow. Second operand 5 states and 88 transitions. [2024-06-03 20:11:43,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 278 flow [2024-06-03 20:11:43,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:11:43,791 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 187 flow [2024-06-03 20:11:43,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-06-03 20:11:43,792 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2024-06-03 20:11:43,792 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 187 flow [2024-06-03 20:11:43,792 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-03 20:11:43,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:43,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:43,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:11:43,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:43,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1536131913, now seen corresponding path program 1 times [2024-06-03 20:11:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:43,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929803244] [2024-06-03 20:11:43,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929803244] [2024-06-03 20:11:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929803244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535859686] [2024-06-03 20:11:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:45,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:45,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:45,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:45,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:45,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:45,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:45,945 INFO L124 PetriNetUnfolderBase]: 587/938 cut-off events. [2024-06-03 20:11:45,945 INFO L125 PetriNetUnfolderBase]: For 323/325 co-relation queries the response was YES. [2024-06-03 20:11:45,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 938 events. 587/938 cut-off events. For 323/325 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4225 event pairs, 242 based on Foata normal form. 2/920 useless extension candidates. Maximal degree in co-relation 2244. Up to 912 conditions per place. [2024-06-03 20:11:45,949 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 39 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-03 20:11:45,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 368 flow [2024-06-03 20:11:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:11:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:11:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 20:11:45,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2024-06-03 20:11:45,953 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 187 flow. Second operand 6 states and 101 transitions. [2024-06-03 20:11:45,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 368 flow [2024-06-03 20:11:45,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 338 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 20:11:45,972 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 268 flow [2024-06-03 20:11:45,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-03 20:11:45,973 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2024-06-03 20:11:45,974 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 268 flow [2024-06-03 20:11:45,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:45,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:45,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:45,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:11:45,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:45,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1536698283, now seen corresponding path program 2 times [2024-06-03 20:11:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373335137] [2024-06-03 20:11:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373335137] [2024-06-03 20:11:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373335137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:47,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:47,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855895422] [2024-06-03 20:11:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:47,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:47,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:47,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:47,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:47,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:47,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:47,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:48,160 INFO L124 PetriNetUnfolderBase]: 604/968 cut-off events. [2024-06-03 20:11:48,160 INFO L125 PetriNetUnfolderBase]: For 441/447 co-relation queries the response was YES. [2024-06-03 20:11:48,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 968 events. 604/968 cut-off events. For 441/447 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4369 event pairs, 227 based on Foata normal form. 2/950 useless extension candidates. Maximal degree in co-relation 2520. Up to 915 conditions per place. [2024-06-03 20:11:48,167 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 51 selfloop transitions, 18 changer transitions 0/76 dead transitions. [2024-06-03 20:11:48,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 510 flow [2024-06-03 20:11:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:11:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:11:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 20:11:48,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-03 20:11:48,180 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 268 flow. Second operand 7 states and 123 transitions. [2024-06-03 20:11:48,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 510 flow [2024-06-03 20:11:48,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 504 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-03 20:11:48,183 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 380 flow [2024-06-03 20:11:48,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-06-03 20:11:48,185 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-03 20:11:48,185 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 380 flow [2024-06-03 20:11:48,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:48,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:48,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:48,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:11:48,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:48,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1032769655, now seen corresponding path program 2 times [2024-06-03 20:11:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105926903] [2024-06-03 20:11:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105926903] [2024-06-03 20:11:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105926903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:50,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:50,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:50,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720153941] [2024-06-03 20:11:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:50,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:50,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:11:50,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 380 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-03 20:11:50,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:50,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:11:50,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:51,166 INFO L124 PetriNetUnfolderBase]: 750/1199 cut-off events. [2024-06-03 20:11:51,167 INFO L125 PetriNetUnfolderBase]: For 1437/1472 co-relation queries the response was YES. [2024-06-03 20:11:51,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 1199 events. 750/1199 cut-off events. For 1437/1472 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5348 event pairs, 153 based on Foata normal form. 3/1197 useless extension candidates. Maximal degree in co-relation 3593. Up to 1091 conditions per place. [2024-06-03 20:11:51,172 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 54 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2024-06-03 20:11:51,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 558 flow [2024-06-03 20:11:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:11:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:11:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-03 20:11:51,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-06-03 20:11:51,174 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 380 flow. Second operand 5 states and 91 transitions. [2024-06-03 20:11:51,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 558 flow [2024-06-03 20:11:51,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 528 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-03 20:11:51,177 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 393 flow [2024-06-03 20:11:51,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=393, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-06-03 20:11:51,178 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-06-03 20:11:51,178 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 393 flow [2024-06-03 20:11:51,178 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-03 20:11:51,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:51,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:51,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:11:51,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:51,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 374986863, now seen corresponding path program 1 times [2024-06-03 20:11:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344910301] [2024-06-03 20:11:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:52,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344910301] [2024-06-03 20:11:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344910301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:52,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:52,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:11:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945567530] [2024-06-03 20:11:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:52,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:11:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:52,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:11:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:11:52,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:52,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:52,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:52,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:52,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:53,361 INFO L124 PetriNetUnfolderBase]: 868/1343 cut-off events. [2024-06-03 20:11:53,362 INFO L125 PetriNetUnfolderBase]: For 1859/1893 co-relation queries the response was YES. [2024-06-03 20:11:53,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 1343 events. 868/1343 cut-off events. For 1859/1893 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6278 event pairs, 481 based on Foata normal form. 4/1341 useless extension candidates. Maximal degree in co-relation 4089. Up to 1295 conditions per place. [2024-06-03 20:11:53,371 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 50 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-03 20:11:53,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 602 flow [2024-06-03 20:11:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:11:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:11:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-03 20:11:53,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 20:11:53,372 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 393 flow. Second operand 5 states and 90 transitions. [2024-06-03 20:11:53,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 602 flow [2024-06-03 20:11:53,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 554 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 20:11:53,376 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 461 flow [2024-06-03 20:11:53,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-03 20:11:53,376 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-06-03 20:11:53,376 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 461 flow [2024-06-03 20:11:53,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:53,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:53,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:53,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:11:53,377 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:53,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash 393027519, now seen corresponding path program 1 times [2024-06-03 20:11:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941860478] [2024-06-03 20:11:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941860478] [2024-06-03 20:11:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941860478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:55,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:55,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:11:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807014282] [2024-06-03 20:11:55,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:55,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:11:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:55,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:11:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:11:55,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:55,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 461 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:55,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:55,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:55,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:56,493 INFO L124 PetriNetUnfolderBase]: 617/995 cut-off events. [2024-06-03 20:11:56,493 INFO L125 PetriNetUnfolderBase]: For 1480/1486 co-relation queries the response was YES. [2024-06-03 20:11:56,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 995 events. 617/995 cut-off events. For 1480/1486 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4576 event pairs, 280 based on Foata normal form. 2/978 useless extension candidates. Maximal degree in co-relation 3301. Up to 910 conditions per place. [2024-06-03 20:11:56,499 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 59 selfloop transitions, 31 changer transitions 0/96 dead transitions. [2024-06-03 20:11:56,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 801 flow [2024-06-03 20:11:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:11:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:11:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 20:11:56,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-03 20:11:56,500 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 461 flow. Second operand 8 states and 141 transitions. [2024-06-03 20:11:56,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 801 flow [2024-06-03 20:11:56,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:11:56,503 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 609 flow [2024-06-03 20:11:56,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=609, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-03 20:11:56,505 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2024-06-03 20:11:56,506 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 609 flow [2024-06-03 20:11:56,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:56,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:56,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:56,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:11:56,506 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-03 20:11:56,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1245934296, now seen corresponding path program 1 times [2024-06-03 20:11:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:56,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421613138] [2024-06-03 20:11:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:11:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421613138] [2024-06-03 20:11:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421613138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:11:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892854919] [2024-06-03 20:11:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:58,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:11:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:11:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:11:58,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:58,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 609 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:58,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:58,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:58,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:59,002 INFO L124 PetriNetUnfolderBase]: 620/1005 cut-off events. [2024-06-03 20:11:59,003 INFO L125 PetriNetUnfolderBase]: For 2643/2649 co-relation queries the response was YES. [2024-06-03 20:11:59,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1005 events. 620/1005 cut-off events. For 2643/2649 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4595 event pairs, 307 based on Foata normal form. 6/992 useless extension candidates. Maximal degree in co-relation 3787. Up to 959 conditions per place. [2024-06-03 20:11:59,010 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 66 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-06-03 20:11:59,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 829 flow [2024-06-03 20:11:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:11:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:11:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 20:11:59,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2024-06-03 20:11:59,011 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 609 flow. Second operand 7 states and 114 transitions. [2024-06-03 20:11:59,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 829 flow [2024-06-03 20:11:59,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 780 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-03 20:11:59,018 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 626 flow [2024-06-03 20:11:59,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=626, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2024-06-03 20:11:59,019 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2024-06-03 20:11:59,019 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 626 flow [2024-06-03 20:11:59,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:11:59,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:59,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:59,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:11:59,022 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-03 20:11:59,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -701026836, now seen corresponding path program 2 times [2024-06-03 20:11:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727949752] [2024-06-03 20:11:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:01,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727949752] [2024-06-03 20:12:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727949752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:01,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449890848] [2024-06-03 20:12:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:01,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:01,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:01,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:01,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 626 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:01,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:01,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:01,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:02,282 INFO L124 PetriNetUnfolderBase]: 623/1006 cut-off events. [2024-06-03 20:12:02,282 INFO L125 PetriNetUnfolderBase]: For 2974/2980 co-relation queries the response was YES. [2024-06-03 20:12:02,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 1006 events. 623/1006 cut-off events. For 2974/2980 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4641 event pairs, 270 based on Foata normal form. 2/989 useless extension candidates. Maximal degree in co-relation 3895. Up to 917 conditions per place. [2024-06-03 20:12:02,288 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 81 selfloop transitions, 29 changer transitions 0/116 dead transitions. [2024-06-03 20:12:02,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 116 transitions, 1084 flow [2024-06-03 20:12:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-03 20:12:02,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 20:12:02,290 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 626 flow. Second operand 8 states and 140 transitions. [2024-06-03 20:12:02,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 116 transitions, 1084 flow [2024-06-03 20:12:02,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 1033 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:02,299 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 808 flow [2024-06-03 20:12:02,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=808, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-06-03 20:12:02,301 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2024-06-03 20:12:02,301 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 808 flow [2024-06-03 20:12:02,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:02,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:02,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:02,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:12:02,302 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:02,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:02,302 INFO L85 PathProgramCache]: Analyzing trace with hash -701652726, now seen corresponding path program 3 times [2024-06-03 20:12:02,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:02,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545968898] [2024-06-03 20:12:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:04,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:04,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545968898] [2024-06-03 20:12:04,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545968898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:04,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:04,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:12:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144833099] [2024-06-03 20:12:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:04,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:12:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:04,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:12:04,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:12:04,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:04,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 808 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:04,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:04,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:04,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:04,910 INFO L124 PetriNetUnfolderBase]: 639/1033 cut-off events. [2024-06-03 20:12:04,911 INFO L125 PetriNetUnfolderBase]: For 3955/3961 co-relation queries the response was YES. [2024-06-03 20:12:04,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4328 conditions, 1033 events. 639/1033 cut-off events. For 3955/3961 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4801 event pairs, 283 based on Foata normal form. 2/1016 useless extension candidates. Maximal degree in co-relation 4286. Up to 954 conditions per place. [2024-06-03 20:12:04,919 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 81 selfloop transitions, 26 changer transitions 0/113 dead transitions. [2024-06-03 20:12:04,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 1159 flow [2024-06-03 20:12:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 20:12:04,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-03 20:12:04,921 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 808 flow. Second operand 8 states and 139 transitions. [2024-06-03 20:12:04,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 1159 flow [2024-06-03 20:12:04,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 1085 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-03 20:12:04,928 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 837 flow [2024-06-03 20:12:04,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=837, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2024-06-03 20:12:04,929 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2024-06-03 20:12:04,929 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 837 flow [2024-06-03 20:12:04,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:04,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:04,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:04,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:12:04,930 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-03 20:12:04,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash -701047296, now seen corresponding path program 4 times [2024-06-03 20:12:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:04,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450959729] [2024-06-03 20:12:04,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450959729] [2024-06-03 20:12:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450959729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034241231] [2024-06-03 20:12:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:06,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:07,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:07,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 837 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:07,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:07,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:07,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:07,829 INFO L124 PetriNetUnfolderBase]: 636/1029 cut-off events. [2024-06-03 20:12:07,830 INFO L125 PetriNetUnfolderBase]: For 3749/3755 co-relation queries the response was YES. [2024-06-03 20:12:07,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 1029 events. 636/1029 cut-off events. For 3749/3755 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4752 event pairs, 283 based on Foata normal form. 2/1014 useless extension candidates. Maximal degree in co-relation 4230. Up to 967 conditions per place. [2024-06-03 20:12:07,836 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 82 selfloop transitions, 27 changer transitions 0/115 dead transitions. [2024-06-03 20:12:07,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 1172 flow [2024-06-03 20:12:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 20:12:07,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-03 20:12:07,838 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 837 flow. Second operand 8 states and 135 transitions. [2024-06-03 20:12:07,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 1172 flow [2024-06-03 20:12:07,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 1106 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 20:12:07,845 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 904 flow [2024-06-03 20:12:07,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=904, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-06-03 20:12:07,846 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-03 20:12:07,846 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 904 flow [2024-06-03 20:12:07,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:07,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:07,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:12:07,847 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:07,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1035831300, now seen corresponding path program 1 times [2024-06-03 20:12:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917349157] [2024-06-03 20:12:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:09,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917349157] [2024-06-03 20:12:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917349157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:09,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222319661] [2024-06-03 20:12:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:09,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:09,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:09,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:09,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:09,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:09,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:10,698 INFO L124 PetriNetUnfolderBase]: 812/1306 cut-off events. [2024-06-03 20:12:10,698 INFO L125 PetriNetUnfolderBase]: For 4228/4240 co-relation queries the response was YES. [2024-06-03 20:12:10,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5204 conditions, 1306 events. 812/1306 cut-off events. For 4228/4240 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5989 event pairs, 244 based on Foata normal form. 4/1293 useless extension candidates. Maximal degree in co-relation 5157. Up to 1187 conditions per place. [2024-06-03 20:12:10,707 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 87 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2024-06-03 20:12:10,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 113 transitions, 1216 flow [2024-06-03 20:12:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-03 20:12:10,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2024-06-03 20:12:10,709 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 904 flow. Second operand 6 states and 103 transitions. [2024-06-03 20:12:10,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 113 transitions, 1216 flow [2024-06-03 20:12:10,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 113 transitions, 1139 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:10,718 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 920 flow [2024-06-03 20:12:10,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2024-06-03 20:12:10,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-06-03 20:12:10,718 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 920 flow [2024-06-03 20:12:10,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:10,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:10,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:10,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:12:10,719 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:10,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:10,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1535009730, now seen corresponding path program 2 times [2024-06-03 20:12:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:10,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299155031] [2024-06-03 20:12:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:10,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299155031] [2024-06-03 20:12:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299155031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:12,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:12,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741579282] [2024-06-03 20:12:12,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:12,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:12,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 920 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:12,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:12,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:12,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:13,715 INFO L124 PetriNetUnfolderBase]: 809/1299 cut-off events. [2024-06-03 20:12:13,715 INFO L125 PetriNetUnfolderBase]: For 4326/4338 co-relation queries the response was YES. [2024-06-03 20:12:13,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 1299 events. 809/1299 cut-off events. For 4326/4338 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5914 event pairs, 321 based on Foata normal form. 12/1296 useless extension candidates. Maximal degree in co-relation 5116. Up to 1219 conditions per place. [2024-06-03 20:12:13,724 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 84 selfloop transitions, 22 changer transitions 0/111 dead transitions. [2024-06-03 20:12:13,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 111 transitions, 1175 flow [2024-06-03 20:12:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-03 20:12:13,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-03 20:12:13,732 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 920 flow. Second operand 6 states and 99 transitions. [2024-06-03 20:12:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 111 transitions, 1175 flow [2024-06-03 20:12:13,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 1113 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:13,742 INFO L231 Difference]: Finished difference. Result has 99 places, 106 transitions, 940 flow [2024-06-03 20:12:13,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=99, PETRI_TRANSITIONS=106} [2024-06-03 20:12:13,742 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2024-06-03 20:12:13,742 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 940 flow [2024-06-03 20:12:13,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:13,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:13,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:13,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:12:13,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:13,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1535006754, now seen corresponding path program 1 times [2024-06-03 20:12:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433683666] [2024-06-03 20:12:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433683666] [2024-06-03 20:12:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433683666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797168527] [2024-06-03 20:12:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:15,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:15,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:15,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 940 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:15,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:15,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:15,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:16,551 INFO L124 PetriNetUnfolderBase]: 813/1305 cut-off events. [2024-06-03 20:12:16,551 INFO L125 PetriNetUnfolderBase]: For 4389/4389 co-relation queries the response was YES. [2024-06-03 20:12:16,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 1305 events. 813/1305 cut-off events. For 4389/4389 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5954 event pairs, 327 based on Foata normal form. 0/1290 useless extension candidates. Maximal degree in co-relation 5164. Up to 1219 conditions per place. [2024-06-03 20:12:16,559 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 84 selfloop transitions, 27 changer transitions 0/116 dead transitions. [2024-06-03 20:12:16,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 116 transitions, 1232 flow [2024-06-03 20:12:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 20:12:16,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 20:12:16,572 INFO L175 Difference]: Start difference. First operand has 99 places, 106 transitions, 940 flow. Second operand 6 states and 102 transitions. [2024-06-03 20:12:16,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 116 transitions, 1232 flow [2024-06-03 20:12:16,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 116 transitions, 1171 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 20:12:16,582 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 990 flow [2024-06-03 20:12:16,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2024-06-03 20:12:16,583 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2024-06-03 20:12:16,583 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 990 flow [2024-06-03 20:12:16,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:16,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:16,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:16,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:12:16,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:16,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1534440384, now seen corresponding path program 2 times [2024-06-03 20:12:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815024220] [2024-06-03 20:12:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815024220] [2024-06-03 20:12:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815024220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:18,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:18,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:18,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976194580] [2024-06-03 20:12:18,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:18,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:18,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:18,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:18,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:18,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 990 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:18,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:18,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:18,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:19,413 INFO L124 PetriNetUnfolderBase]: 813/1293 cut-off events. [2024-06-03 20:12:19,413 INFO L125 PetriNetUnfolderBase]: For 5064/5076 co-relation queries the response was YES. [2024-06-03 20:12:19,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5372 conditions, 1293 events. 813/1293 cut-off events. For 5064/5076 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5819 event pairs, 269 based on Foata normal form. 4/1283 useless extension candidates. Maximal degree in co-relation 5321. Up to 1174 conditions per place. [2024-06-03 20:12:19,423 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 86 selfloop transitions, 42 changer transitions 0/133 dead transitions. [2024-06-03 20:12:19,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 133 transitions, 1499 flow [2024-06-03 20:12:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 20:12:19,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-03 20:12:19,424 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 990 flow. Second operand 7 states and 122 transitions. [2024-06-03 20:12:19,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 133 transitions, 1499 flow [2024-06-03 20:12:19,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 133 transitions, 1405 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 20:12:19,462 INFO L231 Difference]: Finished difference. Result has 106 places, 120 transitions, 1196 flow [2024-06-03 20:12:19,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1196, PETRI_PLACES=106, PETRI_TRANSITIONS=120} [2024-06-03 20:12:19,462 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-06-03 20:12:19,463 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 120 transitions, 1196 flow [2024-06-03 20:12:19,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:19,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:19,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:12:19,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:19,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1049591394, now seen corresponding path program 3 times [2024-06-03 20:12:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270479358] [2024-06-03 20:12:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270479358] [2024-06-03 20:12:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270479358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142588833] [2024-06-03 20:12:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:21,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:21,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:21,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:21,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 120 transitions, 1196 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:21,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:21,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:21,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:22,008 INFO L124 PetriNetUnfolderBase]: 809/1299 cut-off events. [2024-06-03 20:12:22,008 INFO L125 PetriNetUnfolderBase]: For 6523/6542 co-relation queries the response was YES. [2024-06-03 20:12:22,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1299 events. 809/1299 cut-off events. For 6523/6542 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5944 event pairs, 330 based on Foata normal form. 17/1305 useless extension candidates. Maximal degree in co-relation 5666. Up to 1231 conditions per place. [2024-06-03 20:12:22,016 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 20 changer transitions 0/136 dead transitions. [2024-06-03 20:12:22,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 1605 flow [2024-06-03 20:12:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-03 20:12:22,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-03 20:12:22,018 INFO L175 Difference]: Start difference. First operand has 106 places, 120 transitions, 1196 flow. Second operand 8 states and 123 transitions. [2024-06-03 20:12:22,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 1605 flow [2024-06-03 20:12:22,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 136 transitions, 1495 flow, removed 39 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:22,032 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 1275 flow [2024-06-03 20:12:22,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1275, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2024-06-03 20:12:22,033 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-06-03 20:12:22,033 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 1275 flow [2024-06-03 20:12:22,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:22,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:22,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:22,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:12:22,033 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:22,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -413532560, now seen corresponding path program 1 times [2024-06-03 20:12:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:22,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693882036] [2024-06-03 20:12:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693882036] [2024-06-03 20:12:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693882036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699560837] [2024-06-03 20:12:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:23,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:23,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 1275 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:23,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:23,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:23,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:24,188 INFO L124 PetriNetUnfolderBase]: 921/1425 cut-off events. [2024-06-03 20:12:24,188 INFO L125 PetriNetUnfolderBase]: For 7540/7548 co-relation queries the response was YES. [2024-06-03 20:12:24,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6219 conditions, 1425 events. 921/1425 cut-off events. For 7540/7548 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6692 event pairs, 463 based on Foata normal form. 6/1429 useless extension candidates. Maximal degree in co-relation 6162. Up to 1366 conditions per place. [2024-06-03 20:12:24,197 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 110 selfloop transitions, 32 changer transitions 0/148 dead transitions. [2024-06-03 20:12:24,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 1728 flow [2024-06-03 20:12:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 20:12:24,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-03 20:12:24,214 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 1275 flow. Second operand 7 states and 123 transitions. [2024-06-03 20:12:24,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 1728 flow [2024-06-03 20:12:24,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 148 transitions, 1646 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:24,226 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 1436 flow [2024-06-03 20:12:24,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1436, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2024-06-03 20:12:24,227 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2024-06-03 20:12:24,227 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 140 transitions, 1436 flow [2024-06-03 20:12:24,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:24,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:24,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:24,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:12:24,228 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:24,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -414813170, now seen corresponding path program 2 times [2024-06-03 20:12:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492996098] [2024-06-03 20:12:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:25,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492996098] [2024-06-03 20:12:25,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492996098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:25,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:25,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193768878] [2024-06-03 20:12:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:25,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:25,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 140 transitions, 1436 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:25,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:25,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:25,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:26,346 INFO L124 PetriNetUnfolderBase]: 920/1423 cut-off events. [2024-06-03 20:12:26,346 INFO L125 PetriNetUnfolderBase]: For 8119/8127 co-relation queries the response was YES. [2024-06-03 20:12:26,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 1423 events. 920/1423 cut-off events. For 8119/8127 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6664 event pairs, 463 based on Foata normal form. 4/1425 useless extension candidates. Maximal degree in co-relation 6584. Up to 1390 conditions per place. [2024-06-03 20:12:26,355 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 130 selfloop transitions, 16 changer transitions 0/152 dead transitions. [2024-06-03 20:12:26,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 1845 flow [2024-06-03 20:12:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 20:12:26,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 20:12:26,356 INFO L175 Difference]: Start difference. First operand has 119 places, 140 transitions, 1436 flow. Second operand 6 states and 102 transitions. [2024-06-03 20:12:26,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 152 transitions, 1845 flow [2024-06-03 20:12:26,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 152 transitions, 1772 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:26,370 INFO L231 Difference]: Finished difference. Result has 123 places, 147 transitions, 1504 flow [2024-06-03 20:12:26,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=123, PETRI_TRANSITIONS=147} [2024-06-03 20:12:26,371 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places. [2024-06-03 20:12:26,371 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 147 transitions, 1504 flow [2024-06-03 20:12:26,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:26,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:26,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:26,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:12:26,372 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:26,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash -414808210, now seen corresponding path program 1 times [2024-06-03 20:12:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521450332] [2024-06-03 20:12:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:12:26,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:12:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:12:26,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:12:26,428 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:12:26,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:12:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:12:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:12:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:12:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:12:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:12:26,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:12:26,432 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-06-03 20:12:26,435 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:12:26,435 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:12:26,456 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,457 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,457 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,457 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,457 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,457 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,457 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,458 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,458 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,458 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,458 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,459 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,459 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,459 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,459 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,459 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,460 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:26,463 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:12:26,471 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:12:26,471 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:12:26,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:12:26 BasicIcfg [2024-06-03 20:12:26,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:12:26,472 INFO L158 Benchmark]: Toolchain (without parser) took 52655.14ms. Allocated memory was 140.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 78.3MB in the beginning and 522.5MB in the end (delta: -444.2MB). Peak memory consumption was 650.1MB. Max. memory is 16.1GB. [2024-06-03 20:12:26,472 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:12:26,472 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:12:26,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.55ms. Allocated memory was 140.5MB in the beginning and 178.3MB in the end (delta: 37.7MB). Free memory was 77.9MB in the beginning and 114.9MB in the end (delta: -37.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-06-03 20:12:26,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 178.3MB. Free memory was 114.9MB in the beginning and 111.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:12:26,473 INFO L158 Benchmark]: Boogie Preprocessor took 53.52ms. Allocated memory is still 178.3MB. Free memory was 111.6MB in the beginning and 106.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:12:26,473 INFO L158 Benchmark]: RCFGBuilder took 957.89ms. Allocated memory is still 178.3MB. Free memory was 106.5MB in the beginning and 87.0MB in the end (delta: 19.5MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-06-03 20:12:26,473 INFO L158 Benchmark]: TraceAbstraction took 50883.93ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 85.9MB in the beginning and 522.5MB in the end (delta: -436.6MB). Peak memory consumption was 617.3MB. Max. memory is 16.1GB. [2024-06-03 20:12:26,474 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.55ms. Allocated memory was 140.5MB in the beginning and 178.3MB in the end (delta: 37.7MB). Free memory was 77.9MB in the beginning and 114.9MB in the end (delta: -37.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 178.3MB. Free memory was 114.9MB in the beginning and 111.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.52ms. Allocated memory is still 178.3MB. Free memory was 111.6MB in the beginning and 106.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 957.89ms. Allocated memory is still 178.3MB. Free memory was 106.5MB in the beginning and 87.0MB in the end (delta: 19.5MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50883.93ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 85.9MB in the beginning and 522.5MB in the end (delta: -436.6MB). Peak memory consumption was 617.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 865]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L860] 0 //@ ghost multithreaded = 1; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-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] [L861] 0 pthread_t t2205; [L862] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))); [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-1, t2205=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 pthread_t t2206; [L864] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))); [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-1, t2205=0, t2206=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 \read(x) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-1, t2205=0, t2206=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 862]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 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: 50.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4212 IncrementalHoareTripleChecker+Invalid, 4373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 3 mSDtfsCounter, 4212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1504occurred in iteration=19, InterpolantAutomatonStates: 122, 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, 35.2s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 24276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-03 20:12:26,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE