./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe018_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe018_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 20:11:41,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:11:41,560 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:41,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:11:41,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:11:41,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:11:41,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:11:41,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:11:41,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:11:41,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:11:41,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:11:41,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:11:41,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:11:41,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:11:41,579 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:11:41,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:11:41,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:11:41,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:11:41,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:11:41,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:11:41,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:11:41,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:11:41,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:11:41,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:11:41,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:11:41,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:11:41,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:11:41,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:11:41,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:11:41,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:11:41,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:11:41,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:11:41,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:11:41,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:11:41,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:11:41,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:11:41,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:11:41,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:11:41,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:11:41,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:11:41,585 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:11:41,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:11:41,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:11:41,588 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:41,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:11:41,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:11:41,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:11:41,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:11:41,831 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:11:41,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2024-06-03 20:11:42,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:11:43,015 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:11:43,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2024-06-03 20:11:43,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a0ef1ff/4261d83106324b4ca587a297ab129f23/FLAG8b364e909 [2024-06-03 20:11:43,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a0ef1ff/4261d83106324b4ca587a297ab129f23 [2024-06-03 20:11:43,038 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:11:43,041 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:11:43,042 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_rmo.opt.yml/witness.yml [2024-06-03 20:11:43,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:11:43,210 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:11:43,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:11:43,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:11:43,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:11:43,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:11:43" (1/2) ... [2024-06-03 20:11:43,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19921631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:43, skipping insertion in model container [2024-06-03 20:11:43,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:11:43" (1/2) ... [2024-06-03 20:11:43,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34232ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:11:43, skipping insertion in model container [2024-06-03 20:11:43,221 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:43" (2/2) ... [2024-06-03 20:11:43,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19921631 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43, skipping insertion in model container [2024-06-03 20:11:43,221 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:43" (2/2) ... [2024-06-03 20:11:43,221 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:11:43,332 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:11:43,334 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! 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 || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= 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 || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-03 20:11:43,334 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! 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 || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= 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 || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-03 20:11:43,334 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! 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 || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= 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 || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-03 20:11:43,334 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:11:43,334 INFO L106 edCorrectnessWitness]: ghost_update [L850-L850] multithreaded = 1; [2024-06-03 20:11:43,371 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:11:43,663 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:11:43,676 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:43,809 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:11:43,847 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:11:43,847 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43 WrapperNode [2024-06-03 20:11:43,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:11:43,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:11:43,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:11:43,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:11:43,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,897 INFO L138 Inliner]: procedures = 175, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 205 [2024-06-03 20:11:43,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:11:43,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:11:43,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:11:43,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:11:43,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,973 INFO L175 MemorySlicer]: Split 47 memory accesses to 2 slices as follows [2, 45]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-06-03 20:11:43,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:43,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:11:43,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:11:43,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:11:43,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:11:44,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (1/1) ... [2024-06-03 20:11:44,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:11:44,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:11:44,041 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:44,054 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:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:11:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:11:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:11:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:11:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:11:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:11:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:11:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:11:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:11:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:11:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:11:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:11:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:11:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:11:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:11:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:11:44,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:11:44,079 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:44,197 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:11:44,199 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:11:44,633 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:11:44,634 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:11:44,976 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:11:44,976 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:11:44,977 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:11:44 BoogieIcfgContainer [2024-06-03 20:11:44,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:11:44,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:11:44,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:11:44,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:11:44,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:11:43" (1/4) ... [2024-06-03 20:11:44,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342e8f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:11:44, skipping insertion in model container [2024-06-03 20:11:44,982 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:43" (2/4) ... [2024-06-03 20:11:44,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342e8f9a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:11:44, skipping insertion in model container [2024-06-03 20:11:44,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:11:43" (3/4) ... [2024-06-03 20:11:44,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342e8f9a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:11:44, skipping insertion in model container [2024-06-03 20:11:44,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:11:44" (4/4) ... [2024-06-03 20:11:44,984 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2024-06-03 20:11:44,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:11:44,998 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:11:44,998 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:11:45,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:11:45,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-03 20:11:45,112 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-03 20:11:45,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:11:45,114 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 58 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:45,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-03 20:11:45,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-03 20:11:45,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:11:45,136 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;@3102d2ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:11:45,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:11:45,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:11:45,142 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 20:11:45,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:11:45,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:45,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:11:45,144 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:45,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1679828141, now seen corresponding path program 1 times [2024-06-03 20:11:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315184366] [2024-06-03 20:11:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:47,167 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,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315184366] [2024-06-03 20:11:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315184366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:11:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985329604] [2024-06-03 20:11:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:11:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:47,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:11:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:11:47,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:47,261 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:47,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:47,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:47,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:47,660 INFO L124 PetriNetUnfolderBase]: 556/885 cut-off events. [2024-06-03 20:11:47,660 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-03 20:11:47,663 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 3835 event pairs, 241 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1798. Up to 848 conditions per place. [2024-06-03 20:11:47,667 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 30 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 20:11:47,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 177 flow [2024-06-03 20:11:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:11:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:11:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-06-03 20:11:47,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-06-03 20:11:47,677 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:47,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 177 flow [2024-06-03 20:11:47,680 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:47,682 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 115 flow [2024-06-03 20:11:47,683 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:47,685 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-06-03 20:11:47,686 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 115 flow [2024-06-03 20:11:47,686 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:47,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:47,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:47,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:11:47,687 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:47,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1197981734, now seen corresponding path program 1 times [2024-06-03 20:11:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:47,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135287937] [2024-06-03 20:11:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:49,383 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:49,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:49,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135287937] [2024-06-03 20:11:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135287937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:49,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:49,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:11:49,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888617656] [2024-06-03 20:11:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:49,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:11:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:11:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:11:49,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:49,470 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:49,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:49,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:49,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:50,207 INFO L124 PetriNetUnfolderBase]: 590/937 cut-off events. [2024-06-03 20:11:50,207 INFO L125 PetriNetUnfolderBase]: For 165/167 co-relation queries the response was YES. [2024-06-03 20:11:50,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 937 events. 590/937 cut-off events. For 165/167 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4167 event pairs, 260 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 2125. Up to 898 conditions per place. [2024-06-03 20:11:50,213 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 30 selfloop transitions, 14 changer transitions 0/51 dead transitions. [2024-06-03 20:11:50,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 243 flow [2024-06-03 20:11:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:11:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:11:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-03 20:11:50,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 20:11:50,215 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 115 flow. Second operand 6 states and 105 transitions. [2024-06-03 20:11:50,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 243 flow [2024-06-03 20:11:50,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:11:50,217 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 197 flow [2024-06-03 20:11:50,217 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-03 20:11:50,218 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2024-06-03 20:11:50,218 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 197 flow [2024-06-03 20:11:50,218 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:50,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:50,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:50,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:11:50,219 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:50,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1428732665, now seen corresponding path program 1 times [2024-06-03 20:11:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145776296] [2024-06-03 20:11:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:53,198 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:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145776296] [2024-06-03 20:11:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145776296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:53,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322986728] [2024-06-03 20:11:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:53,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:53,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:53,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:11:53,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 197 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:53,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:53,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:11:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:53,933 INFO L124 PetriNetUnfolderBase]: 742/1175 cut-off events. [2024-06-03 20:11:53,933 INFO L125 PetriNetUnfolderBase]: For 572/577 co-relation queries the response was YES. [2024-06-03 20:11:53,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 1175 events. 742/1175 cut-off events. For 572/577 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5153 event pairs, 281 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 3037. Up to 1107 conditions per place. [2024-06-03 20:11:53,940 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 38 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-03 20:11:53,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 321 flow [2024-06-03 20:11:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:11:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:11:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-03 20:11:53,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-03 20:11:53,945 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 197 flow. Second operand 5 states and 88 transitions. [2024-06-03 20:11:53,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 321 flow [2024-06-03 20:11:53,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 20:11:53,948 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 223 flow [2024-06-03 20:11:53,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-03 20:11:53,950 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2024-06-03 20:11:53,950 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 223 flow [2024-06-03 20:11:53,950 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:53,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:53,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:53,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:11:53,951 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:53,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash -208075813, now seen corresponding path program 1 times [2024-06-03 20:11:53,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405773468] [2024-06-03 20:11:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:55,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:11:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405773468] [2024-06-03 20:11:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405773468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446141729] [2024-06-03 20:11:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:55,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:55,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:11:55,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 223 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:55,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:55,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:11:55,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:11:56,792 INFO L124 PetriNetUnfolderBase]: 587/939 cut-off events. [2024-06-03 20:11:56,792 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2024-06-03 20:11:56,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 939 events. 587/939 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4175 event pairs, 206 based on Foata normal form. 2/939 useless extension candidates. Maximal degree in co-relation 2516. Up to 893 conditions per place. [2024-06-03 20:11:56,797 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 48 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2024-06-03 20:11:56,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 470 flow [2024-06-03 20:11:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:11:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:11:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 20:11:56,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-03 20:11:56,799 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 223 flow. Second operand 6 states and 107 transitions. [2024-06-03 20:11:56,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 470 flow [2024-06-03 20:11:56,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 440 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 20:11:56,802 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 333 flow [2024-06-03 20:11:56,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-06-03 20:11:56,802 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-06-03 20:11:56,803 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 333 flow [2024-06-03 20:11:56,803 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:56,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:11:56,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:11:56,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:11:56,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:11:56,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:11:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1428404375, now seen corresponding path program 2 times [2024-06-03 20:11:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:11:56,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228345903] [2024-06-03 20:11:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:11:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:11:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:11:59,519 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:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:11:59,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228345903] [2024-06-03 20:11:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228345903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:11:59,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:11:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:11:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535742787] [2024-06-03 20:11:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:11:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:11:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:11:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:11:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:11:59,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:11:59,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 333 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:59,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:11:59,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:11:59,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:00,211 INFO L124 PetriNetUnfolderBase]: 735/1162 cut-off events. [2024-06-03 20:12:00,212 INFO L125 PetriNetUnfolderBase]: For 1080/1086 co-relation queries the response was YES. [2024-06-03 20:12:00,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 1162 events. 735/1162 cut-off events. For 1080/1086 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5109 event pairs, 152 based on Foata normal form. 0/1158 useless extension candidates. Maximal degree in co-relation 3349. Up to 1064 conditions per place. [2024-06-03 20:12:00,218 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 49 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2024-06-03 20:12:00,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 497 flow [2024-06-03 20:12:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-03 20:12:00,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-06-03 20:12:00,223 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 333 flow. Second operand 5 states and 91 transitions. [2024-06-03 20:12:00,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 497 flow [2024-06-03 20:12:00,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 483 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-03 20:12:00,232 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 362 flow [2024-06-03 20:12:00,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-03 20:12:00,234 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2024-06-03 20:12:00,234 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 362 flow [2024-06-03 20:12:00,234 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:12:00,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:00,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:00,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:12:00,235 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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:00,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2105197361, now seen corresponding path program 1 times [2024-06-03 20:12:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:00,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583432125] [2024-06-03 20:12:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:01,680 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,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:01,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583432125] [2024-06-03 20:12:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583432125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:01,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:01,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:12:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763439988] [2024-06-03 20:12:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:01,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:12:01,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:12:01,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:12:01,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:01,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 362 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:12:01,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:01,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:01,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:02,462 INFO L124 PetriNetUnfolderBase]: 860/1323 cut-off events. [2024-06-03 20:12:02,462 INFO L125 PetriNetUnfolderBase]: For 1634/1636 co-relation queries the response was YES. [2024-06-03 20:12:02,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1323 events. 860/1323 cut-off events. For 1634/1636 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6155 event pairs, 476 based on Foata normal form. 6/1324 useless extension candidates. Maximal degree in co-relation 3915. Up to 1277 conditions per place. [2024-06-03 20:12:02,469 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 46 selfloop transitions, 23 changer transitions 0/75 dead transitions. [2024-06-03 20:12:02,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 618 flow [2024-06-03 20:12:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 20:12:02,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-03 20:12:02,471 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 362 flow. Second operand 6 states and 106 transitions. [2024-06-03 20:12:02,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 618 flow [2024-06-03 20:12:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 570 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:02,475 INFO L231 Difference]: Finished difference. Result has 66 places, 71 transitions, 506 flow [2024-06-03 20:12:02,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=66, PETRI_TRANSITIONS=71} [2024-06-03 20:12:02,478 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-03 20:12:02,478 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 71 transitions, 506 flow [2024-06-03 20:12:02,478 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:12:02,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:02,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:02,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:12:02,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:02,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 872200856, now seen corresponding path program 1 times [2024-06-03 20:12:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089662609] [2024-06-03 20:12:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:04,925 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,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089662609] [2024-06-03 20:12:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089662609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:04,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:12:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013572506] [2024-06-03 20:12:04,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:12:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:12:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:12:05,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:05,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 71 transitions, 506 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:05,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:05,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:05,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:05,849 INFO L124 PetriNetUnfolderBase]: 778/1241 cut-off events. [2024-06-03 20:12:05,849 INFO L125 PetriNetUnfolderBase]: For 2601/2603 co-relation queries the response was YES. [2024-06-03 20:12:05,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 1241 events. 778/1241 cut-off events. For 2601/2603 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6005 event pairs, 400 based on Foata normal form. 14/1219 useless extension candidates. Maximal degree in co-relation 4244. Up to 1152 conditions per place. [2024-06-03 20:12:05,857 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 52 selfloop transitions, 25 changer transitions 0/83 dead transitions. [2024-06-03 20:12:05,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 713 flow [2024-06-03 20:12:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 20:12:05,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-03 20:12:05,860 INFO L175 Difference]: Start difference. First operand has 66 places, 71 transitions, 506 flow. Second operand 7 states and 122 transitions. [2024-06-03 20:12:05,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 713 flow [2024-06-03 20:12:05,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 678 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-03 20:12:05,866 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 545 flow [2024-06-03 20:12:05,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2024-06-03 20:12:05,867 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2024-06-03 20:12:05,867 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 545 flow [2024-06-03 20:12:05,867 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:05,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:05,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:05,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:12:05,868 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:12:05,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1902671546, now seen corresponding path program 2 times [2024-06-03 20:12:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:05,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044016636] [2024-06-03 20:12:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:08,695 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:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044016636] [2024-06-03 20:12:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044016636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776837060] [2024-06-03 20:12:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:08,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:08,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:08,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:08,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 545 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:08,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:08,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:08,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:09,863 INFO L124 PetriNetUnfolderBase]: 765/1234 cut-off events. [2024-06-03 20:12:09,863 INFO L125 PetriNetUnfolderBase]: For 2881/2881 co-relation queries the response was YES. [2024-06-03 20:12:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4342 conditions, 1234 events. 765/1234 cut-off events. For 2881/2881 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6010 event pairs, 385 based on Foata normal form. 2/1218 useless extension candidates. Maximal degree in co-relation 4308. Up to 1156 conditions per place. [2024-06-03 20:12:09,871 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 60 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2024-06-03 20:12:09,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 784 flow [2024-06-03 20:12:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-03 20:12:09,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 20:12:09,872 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 545 flow. Second operand 7 states and 120 transitions. [2024-06-03 20:12:09,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 784 flow [2024-06-03 20:12:09,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 730 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:09,876 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 566 flow [2024-06-03 20:12:09,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2024-06-03 20:12:09,877 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-03 20:12:09,877 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 566 flow [2024-06-03 20:12:09,877 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:09,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:09,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:09,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:12:09,878 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:12:09,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1903803356, now seen corresponding path program 3 times [2024-06-03 20:12:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743151907] [2024-06-03 20:12:09,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:09,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:12,682 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,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:12,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743151907] [2024-06-03 20:12:12,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743151907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:12,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:12,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:12,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142333631] [2024-06-03 20:12:12,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:12,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:12,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:12,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 566 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:12,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:12,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:12,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:13,830 INFO L124 PetriNetUnfolderBase]: 762/1229 cut-off events. [2024-06-03 20:12:13,831 INFO L125 PetriNetUnfolderBase]: For 3193/3193 co-relation queries the response was YES. [2024-06-03 20:12:13,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 1229 events. 762/1229 cut-off events. For 3193/3193 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5960 event pairs, 373 based on Foata normal form. 2/1217 useless extension candidates. Maximal degree in co-relation 4355. Up to 1126 conditions per place. [2024-06-03 20:12:13,839 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 65 selfloop transitions, 25 changer transitions 0/96 dead transitions. [2024-06-03 20:12:13,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 96 transitions, 857 flow [2024-06-03 20:12:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 20:12:13,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-03 20:12:13,840 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 566 flow. Second operand 7 states and 123 transitions. [2024-06-03 20:12:13,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 96 transitions, 857 flow [2024-06-03 20:12:13,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 804 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:13,847 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 632 flow [2024-06-03 20:12:13,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2024-06-03 20:12:13,849 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-06-03 20:12:13,849 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 632 flow [2024-06-03 20:12:13,849 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:13,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:13,849 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,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:12:13,850 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:12:13,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -898664134, now seen corresponding path program 1 times [2024-06-03 20:12:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068422069] [2024-06-03 20:12:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:16,420 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:16,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:16,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068422069] [2024-06-03 20:12:16,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068422069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:16,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:16,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:16,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266069993] [2024-06-03 20:12:16,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:16,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:16,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:16,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:16,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:16,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 632 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:16,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:16,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:16,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:17,493 INFO L124 PetriNetUnfolderBase]: 979/1554 cut-off events. [2024-06-03 20:12:17,493 INFO L125 PetriNetUnfolderBase]: For 4764/4764 co-relation queries the response was YES. [2024-06-03 20:12:17,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5638 conditions, 1554 events. 979/1554 cut-off events. For 4764/4764 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7408 event pairs, 357 based on Foata normal form. 10/1524 useless extension candidates. Maximal degree in co-relation 5601. Up to 1414 conditions per place. [2024-06-03 20:12:17,502 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 69 selfloop transitions, 22 changer transitions 0/96 dead transitions. [2024-06-03 20:12:17,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 890 flow [2024-06-03 20:12:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:12:17,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-03 20:12:17,504 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 632 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:12:17,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 890 flow [2024-06-03 20:12:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 96 transitions, 834 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:17,511 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 677 flow [2024-06-03 20:12:17,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=677, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2024-06-03 20:12:17,512 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2024-06-03 20:12:17,512 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 677 flow [2024-06-03 20:12:17,512 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:17,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:17,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:12:17,513 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:17,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1397273218, now seen corresponding path program 1 times [2024-06-03 20:12:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244095344] [2024-06-03 20:12:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:20,004 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:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244095344] [2024-06-03 20:12:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244095344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029274684] [2024-06-03 20:12:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:20,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:20,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:20,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 677 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:20,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:20,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:20,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:21,041 INFO L124 PetriNetUnfolderBase]: 1003/1598 cut-off events. [2024-06-03 20:12:21,041 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2024-06-03 20:12:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 1598 events. 1003/1598 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7702 event pairs, 375 based on Foata normal form. 2/1560 useless extension candidates. Maximal degree in co-relation 5816. Up to 1417 conditions per place. [2024-06-03 20:12:21,051 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 55 selfloop transitions, 40 changer transitions 0/100 dead transitions. [2024-06-03 20:12:21,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 961 flow [2024-06-03 20:12:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:12:21,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 20:12:21,053 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 677 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:12:21,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 961 flow [2024-06-03 20:12:21,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 100 transitions, 916 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-03 20:12:21,060 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 826 flow [2024-06-03 20:12:21,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2024-06-03 20:12:21,060 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-06-03 20:12:21,061 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 826 flow [2024-06-03 20:12:21,061 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:21,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:21,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:21,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:12:21,061 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:21,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash -928123558, now seen corresponding path program 2 times [2024-06-03 20:12:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705293357] [2024-06-03 20:12:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:23,459 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,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705293357] [2024-06-03 20:12:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705293357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:23,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424212085] [2024-06-03 20:12:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:23,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:23,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:23,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:23,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:23,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 826 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:23,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:23,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:23,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:24,458 INFO L124 PetriNetUnfolderBase]: 1013/1612 cut-off events. [2024-06-03 20:12:24,459 INFO L125 PetriNetUnfolderBase]: For 6290/6290 co-relation queries the response was YES. [2024-06-03 20:12:24,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6381 conditions, 1612 events. 1013/1612 cut-off events. For 6290/6290 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7732 event pairs, 461 based on Foata normal form. 2/1574 useless extension candidates. Maximal degree in co-relation 6337. Up to 1499 conditions per place. [2024-06-03 20:12:24,468 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 71 selfloop transitions, 26 changer transitions 0/102 dead transitions. [2024-06-03 20:12:24,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 102 transitions, 1080 flow [2024-06-03 20:12:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-03 20:12:24,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-03 20:12:24,470 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 826 flow. Second operand 7 states and 115 transitions. [2024-06-03 20:12:24,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 102 transitions, 1080 flow [2024-06-03 20:12:24,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 102 transitions, 1000 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:24,480 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 846 flow [2024-06-03 20:12:24,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=846, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2024-06-03 20:12:24,481 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2024-06-03 20:12:24,481 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 846 flow [2024-06-03 20:12:24,482 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:24,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:24,482 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,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:12:24,482 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:24,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash -894882568, now seen corresponding path program 3 times [2024-06-03 20:12:24,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:24,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585167566] [2024-06-03 20:12:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:24,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:26,712 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:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585167566] [2024-06-03 20:12:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585167566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461667273] [2024-06-03 20:12:26,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:26,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:26,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:26,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 846 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:26,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:26,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:26,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:27,888 INFO L124 PetriNetUnfolderBase]: 1014/1613 cut-off events. [2024-06-03 20:12:27,888 INFO L125 PetriNetUnfolderBase]: For 6360/6366 co-relation queries the response was YES. [2024-06-03 20:12:27,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 1613 events. 1014/1613 cut-off events. For 6360/6366 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7791 event pairs, 384 based on Foata normal form. 2/1574 useless extension candidates. Maximal degree in co-relation 6387. Up to 1394 conditions per place. [2024-06-03 20:12:27,897 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 61 selfloop transitions, 49 changer transitions 0/115 dead transitions. [2024-06-03 20:12:27,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 1234 flow [2024-06-03 20:12:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 20:12:27,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-03 20:12:27,898 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 846 flow. Second operand 7 states and 122 transitions. [2024-06-03 20:12:27,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 1234 flow [2024-06-03 20:12:27,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 1160 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:27,909 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 1037 flow [2024-06-03 20:12:27,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1037, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2024-06-03 20:12:27,909 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-03 20:12:27,909 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 1037 flow [2024-06-03 20:12:27,910 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:27,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:27,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:27,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:12:27,910 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:27,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -894852808, now seen corresponding path program 4 times [2024-06-03 20:12:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914895637] [2024-06-03 20:12:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:30,279 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:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914895637] [2024-06-03 20:12:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914895637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108501982] [2024-06-03 20:12:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:30,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:30,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:12:30,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 1037 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:30,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:30,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:12:30,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:31,483 INFO L124 PetriNetUnfolderBase]: 1010/1609 cut-off events. [2024-06-03 20:12:31,484 INFO L125 PetriNetUnfolderBase]: For 7983/7983 co-relation queries the response was YES. [2024-06-03 20:12:31,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6827 conditions, 1609 events. 1010/1609 cut-off events. For 7983/7983 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7849 event pairs, 380 based on Foata normal form. 2/1570 useless extension candidates. Maximal degree in co-relation 6780. Up to 1391 conditions per place. [2024-06-03 20:12:31,492 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 63 selfloop transitions, 47 changer transitions 0/115 dead transitions. [2024-06-03 20:12:31,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 1291 flow [2024-06-03 20:12:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 20:12:31,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-03 20:12:31,493 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 1037 flow. Second operand 7 states and 123 transitions. [2024-06-03 20:12:31,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 1291 flow [2024-06-03 20:12:31,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 1178 flow, removed 39 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:31,506 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 1024 flow [2024-06-03 20:12:31,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1024, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2024-06-03 20:12:31,507 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2024-06-03 20:12:31,507 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 1024 flow [2024-06-03 20:12:31,507 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:31,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:31,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:31,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:12:31,508 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:31,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash 165678578, now seen corresponding path program 1 times [2024-06-03 20:12:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:31,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320629335] [2024-06-03 20:12:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:33,177 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:33,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:33,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320629335] [2024-06-03 20:12:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320629335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:33,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424216876] [2024-06-03 20:12:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:33,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-03 20:12:33,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 1024 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:33,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:33,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-03 20:12:33,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:34,144 INFO L124 PetriNetUnfolderBase]: 917/1429 cut-off events. [2024-06-03 20:12:34,145 INFO L125 PetriNetUnfolderBase]: For 6140/6140 co-relation queries the response was YES. [2024-06-03 20:12:34,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 1429 events. 917/1429 cut-off events. For 6140/6140 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6770 event pairs, 465 based on Foata normal form. 2/1429 useless extension candidates. Maximal degree in co-relation 5920. Up to 1368 conditions per place. [2024-06-03 20:12:34,152 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 91 selfloop transitions, 22 changer transitions 0/119 dead transitions. [2024-06-03 20:12:34,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 119 transitions, 1350 flow [2024-06-03 20:12:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 20:12:34,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-03 20:12:34,157 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 1024 flow. Second operand 6 states and 107 transitions. [2024-06-03 20:12:34,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 119 transitions, 1350 flow [2024-06-03 20:12:34,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 1173 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 20:12:34,166 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 967 flow [2024-06-03 20:12:34,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=967, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2024-06-03 20:12:34,167 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2024-06-03 20:12:34,167 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 967 flow [2024-06-03 20:12:34,167 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:34,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:34,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:34,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:12:34,167 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:34,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 165117168, now seen corresponding path program 1 times [2024-06-03 20:12:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:34,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955466742] [2024-06-03 20:12:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:12:34,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:12:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:12:34,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:12:34,240 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:12:34,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:12:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:12:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:12:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:12:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:12:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:12:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:12:34,245 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:34,249 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:12:34,249 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:12:34,285 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,285 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,286 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,286 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,286 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,286 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,286 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,286 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,287 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,287 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,287 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,287 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,287 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,287 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,288 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,288 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,288 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,289 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:12:34,292 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:12:34,307 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:12:34,307 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:12:34,307 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:12:34 BasicIcfg [2024-06-03 20:12:34,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:12:34,308 INFO L158 Benchmark]: Toolchain (without parser) took 51098.37ms. Allocated memory was 161.5MB in the beginning and 937.4MB in the end (delta: 775.9MB). Free memory was 111.5MB in the beginning and 375.6MB in the end (delta: -264.1MB). Peak memory consumption was 512.8MB. Max. memory is 16.1GB. [2024-06-03 20:12:34,308 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory was 122.7MB in the beginning and 122.6MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:12:34,308 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:12:34,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.25ms. Allocated memory is still 161.5MB. Free memory was 111.5MB in the beginning and 61.0MB in the end (delta: 50.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-03 20:12:34,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.36ms. Allocated memory is still 161.5MB. Free memory was 60.1MB in the beginning and 57.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 20:12:34,309 INFO L158 Benchmark]: Boogie Preprocessor took 95.59ms. Allocated memory is still 161.5MB. Free memory was 57.0MB in the beginning and 124.4MB in the end (delta: -67.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 20:12:34,309 INFO L158 Benchmark]: RCFGBuilder took 977.60ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 124.4MB in the beginning and 156.9MB in the end (delta: -32.5MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-06-03 20:12:34,309 INFO L158 Benchmark]: TraceAbstraction took 49329.09ms. Allocated memory was 199.2MB in the beginning and 937.4MB in the end (delta: 738.2MB). Free memory was 155.8MB in the beginning and 375.6MB in the end (delta: -219.7MB). Peak memory consumption was 518.5MB. Max. memory is 16.1GB. [2024-06-03 20:12:34,310 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory was 122.7MB in the beginning and 122.6MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 637.25ms. Allocated memory is still 161.5MB. Free memory was 111.5MB in the beginning and 61.0MB in the end (delta: 50.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.36ms. Allocated memory is still 161.5MB. Free memory was 60.1MB in the beginning and 57.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.59ms. Allocated memory is still 161.5MB. Free memory was 57.0MB in the beginning and 124.4MB in the end (delta: -67.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 977.60ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 124.4MB in the beginning and 156.9MB in the end (delta: -32.5MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * TraceAbstraction took 49329.09ms. Allocated memory was 199.2MB in the beginning and 937.4MB in the end (delta: 738.2MB). Free memory was 155.8MB in the beginning and 375.6MB in the end (delta: -219.7MB). Peak memory consumption was 518.5MB. 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: 855]: 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; [L849] 0 pthread_t t2216; 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] [L850] 0 //@ ghost multithreaded = 1; [L850] FCALL, FORK 0 pthread_create(&t2216, ((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, t2216=-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] [L851] 0 pthread_t t2217; [L852] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!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 || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (((0 <= 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 || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 x [L852] 0 x [L852] 0 x [L852] 0 x [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2216=-1, t2217=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 x [L852] 0 x [L852] 0 x [L852] 0 x [L853] 0 pthread_t t2218; [L854] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!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 || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (((0 <= 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 || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 x [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2216=-1, t2217=0, t2218=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 x [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!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 || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (((0 <= 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 || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, t2216=-1, t2217=0, t2218=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 852]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 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: 49.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 554 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3376 IncrementalHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 9 mSDtfsCounter, 3376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=13, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 21941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:34,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE