./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe027_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe027_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 20:15:45,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:15:45,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:15:45,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:15:45,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:15:45,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:15:45,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:15:45,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:15:45,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:15:45,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:15:45,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:15:45,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:15:45,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:15:45,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:15:45,497 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:15:45,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:15:45,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:15:45,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:15:45,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:15:45,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:15:45,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:15:45,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:15:45,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:15:45,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:15:45,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:15:45,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:15:45,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:15:45,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:15:45,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:15:45,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:15:45,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:15:45,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:15:45,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:15:45,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:15:45,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:15:45,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:15:45,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:15:45,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:15:45,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:15:45,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:15:45,505 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:15:45,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:15:45,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:15:45,505 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:15:45,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:15:45,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:15:45,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:15:45,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:15:45,776 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:15:45,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2024-06-03 20:15:46,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:15:47,187 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:15:47,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2024-06-03 20:15:47,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f605f00/da44c5b0acfe4fc3aa23138a1f1c41cd/FLAG8734d354b [2024-06-03 20:15:47,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f605f00/da44c5b0acfe4fc3aa23138a1f1c41cd [2024-06-03 20:15:47,221 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:15:47,221 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:15:47,223 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/safe027_power.opt.yml/witness.yml [2024-06-03 20:15:47,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:15:47,450 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:15:47,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:15:47,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:15:47,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:15:47,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:15:47" (1/2) ... [2024-06-03 20:15:47,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6070d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:15:47, skipping insertion in model container [2024-06-03 20:15:47,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:15:47" (1/2) ... [2024-06-03 20:15:47,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bfaa99a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:15:47, skipping insertion in model container [2024-06-03 20:15:47,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:15:47" (2/2) ... [2024-06-03 20:15:47,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6070d1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:15:47, skipping insertion in model container [2024-06-03 20:15:47,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:15:47" (2/2) ... [2024-06-03 20:15:47,461 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:15:47,656 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:15:47,658 INFO L97 edCorrectnessWitness]: Location invariant before [L892-L892] (((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_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 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0) [2024-06-03 20:15:47,658 INFO L97 edCorrectnessWitness]: Location invariant before [L891-L891] (((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_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 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0) [2024-06-03 20:15:47,658 INFO L97 edCorrectnessWitness]: Location invariant before [L887-L887] (((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_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 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0) [2024-06-03 20:15:47,659 INFO L97 edCorrectnessWitness]: Location invariant before [L889-L889] (((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_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 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0) [2024-06-03 20:15:47,659 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:15:47,660 INFO L106 edCorrectnessWitness]: ghost_update [L885-L885] multithreaded = 1; [2024-06-03 20:15:47,712 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:15:48,037 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:15:48,048 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:15:48,200 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:15:48,263 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:15:48,263 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:15:48 WrapperNode [2024-06-03 20:15:48,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:15:48,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:15:48,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:15:48,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:15:48,271 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:15:48" (1/1) ... [2024-06-03 20:15:48,289 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:15:48" (1/1) ... [2024-06-03 20:15:48,322 INFO L138 Inliner]: procedures = 176, calls = 105, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 286 [2024-06-03 20:15:48,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:15:48,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:15:48,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:15:48,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:15:48,335 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:15:48" (1/1) ... [2024-06-03 20:15:48,336 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:15:48" (1/1) ... [2024-06-03 20:15:48,342 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:15:48" (1/1) ... [2024-06-03 20:15:48,376 INFO L175 MemorySlicer]: Split 58 memory accesses to 2 slices as follows [2, 56]. 97 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:15:48,376 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:15:48" (1/1) ... [2024-06-03 20:15:48,377 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:15:48" (1/1) ... [2024-06-03 20:15:48,407 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:15:48" (1/1) ... [2024-06-03 20:15:48,410 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:15:48" (1/1) ... [2024-06-03 20:15:48,412 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:15:48" (1/1) ... [2024-06-03 20:15:48,415 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:15:48" (1/1) ... [2024-06-03 20:15:48,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:15:48,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:15:48,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:15:48,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:15:48,434 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:15:48" (1/1) ... [2024-06-03 20:15:48,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:15:48,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:15:48,467 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:15:48,483 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:15:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:15:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:15:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:15:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:15:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:15:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:15:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:15:48,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:15:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:15:48,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:15:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:15:48,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:15:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-03 20:15:48,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-03 20:15:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:15:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:15:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:15:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:15:48,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:15:48,519 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:15:48,665 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:15:48,666 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:15:49,301 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:15:49,302 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:15:49,940 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:15:49,940 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:15:49,941 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:15:49 BoogieIcfgContainer [2024-06-03 20:15:49,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:15:49,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:15:49,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:15:49,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:15:49,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:15:47" (1/4) ... [2024-06-03 20:15:49,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c90a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:15:49, skipping insertion in model container [2024-06-03 20:15:49,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:15:47" (2/4) ... [2024-06-03 20:15:49,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c90a3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:15:49, skipping insertion in model container [2024-06-03 20:15:49,948 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:15:48" (3/4) ... [2024-06-03 20:15:49,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c90a3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:15:49, skipping insertion in model container [2024-06-03 20:15:49,949 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:15:49" (4/4) ... [2024-06-03 20:15:49,950 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2024-06-03 20:15:49,968 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:15:49,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-03 20:15:49,969 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:15:50,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:15:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 116 flow [2024-06-03 20:15:50,181 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2024-06-03 20:15:50,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:15:50,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:15:50,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 50 transitions, 116 flow [2024-06-03 20:15:50,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 92 flow [2024-06-03 20:15:50,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:15:50,231 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;@3a4553fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:15:50,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-03 20:15:50,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:15:50,236 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 20:15:50,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:15:50,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:50,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:15:50,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:15:50,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash 308765259, now seen corresponding path program 1 times [2024-06-03 20:15:50,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:50,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312694495] [2024-06-03 20:15:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:50,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:53,139 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:15:53,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:53,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312694495] [2024-06-03 20:15:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312694495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:53,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:15:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251725089] [2024-06-03 20:15:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:53,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:15:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:53,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:15:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:15:53,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:15:53,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:53,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:53,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:15:53,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:54,680 INFO L124 PetriNetUnfolderBase]: 3459/4952 cut-off events. [2024-06-03 20:15:54,680 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-06-03 20:15:54,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10044 conditions, 4952 events. 3459/4952 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25586 event pairs, 1933 based on Foata normal form. 0/4947 useless extension candidates. Maximal degree in co-relation 10028. Up to 4802 conditions per place. [2024-06-03 20:15:54,715 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 39 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-03 20:15:54,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 229 flow [2024-06-03 20:15:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:15:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:15:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-03 20:15:54,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-03 20:15:54,732 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 4 states and 104 transitions. [2024-06-03 20:15:54,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 229 flow [2024-06-03 20:15:54,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:54,743 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 142 flow [2024-06-03 20:15:54,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-03 20:15:54,749 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-06-03 20:15:54,750 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 142 flow [2024-06-03 20:15:54,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:54,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:54,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:54,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:15:54,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:15:54,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1393047538, now seen corresponding path program 1 times [2024-06-03 20:15:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295270396] [2024-06-03 20:15:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:57,348 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:15:57,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295270396] [2024-06-03 20:15:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295270396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:15:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276012137] [2024-06-03 20:15:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:57,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:15:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:15:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:15:57,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:15:57,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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:15:57,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:57,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:15:57,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:59,158 INFO L124 PetriNetUnfolderBase]: 3485/4992 cut-off events. [2024-06-03 20:15:59,158 INFO L125 PetriNetUnfolderBase]: For 910/912 co-relation queries the response was YES. [2024-06-03 20:15:59,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11261 conditions, 4992 events. 3485/4992 cut-off events. For 910/912 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25876 event pairs, 1962 based on Foata normal form. 0/4972 useless extension candidates. Maximal degree in co-relation 11245. Up to 4844 conditions per place. [2024-06-03 20:15:59,189 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2024-06-03 20:15:59,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 276 flow [2024-06-03 20:15:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:15:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:15:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-03 20:15:59,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476 [2024-06-03 20:15:59,191 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 142 flow. Second operand 5 states and 119 transitions. [2024-06-03 20:15:59,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 276 flow [2024-06-03 20:15:59,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:15:59,194 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 196 flow [2024-06-03 20:15:59,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-03 20:15:59,195 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-06-03 20:15:59,195 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 196 flow [2024-06-03 20:15:59,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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:15:59,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:59,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:59,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:15:59,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:15:59,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 858959533, now seen corresponding path program 1 times [2024-06-03 20:15:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467841473] [2024-06-03 20:15:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:02,716 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:16:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467841473] [2024-06-03 20:16:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467841473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372763122] [2024-06-03 20:16:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:02,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:02,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:16:02,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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:16:02,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:02,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:16:02,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:04,402 INFO L124 PetriNetUnfolderBase]: 4410/6280 cut-off events. [2024-06-03 20:16:04,402 INFO L125 PetriNetUnfolderBase]: For 1204/1225 co-relation queries the response was YES. [2024-06-03 20:16:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14241 conditions, 6280 events. 4410/6280 cut-off events. For 1204/1225 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 31814 event pairs, 2274 based on Foata normal form. 0/6277 useless extension candidates. Maximal degree in co-relation 14220. Up to 6075 conditions per place. [2024-06-03 20:16:04,443 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 43 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2024-06-03 20:16:04,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 336 flow [2024-06-03 20:16:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:16:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:16:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-06-03 20:16:04,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.472 [2024-06-03 20:16:04,447 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 196 flow. Second operand 5 states and 118 transitions. [2024-06-03 20:16:04,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 336 flow [2024-06-03 20:16:04,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:16:04,451 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 218 flow [2024-06-03 20:16:04,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-06-03 20:16:04,452 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2024-06-03 20:16:04,452 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 218 flow [2024-06-03 20:16:04,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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:16:04,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:04,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:04,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:16:04,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:04,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1311182829, now seen corresponding path program 1 times [2024-06-03 20:16:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:04,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38537520] [2024-06-03 20:16:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:06,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:06,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38537520] [2024-06-03 20:16:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38537520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123484537] [2024-06-03 20:16:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:06,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:07,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:07,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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:16:07,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:07,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:08,408 INFO L124 PetriNetUnfolderBase]: 3490/5008 cut-off events. [2024-06-03 20:16:08,409 INFO L125 PetriNetUnfolderBase]: For 1157/1159 co-relation queries the response was YES. [2024-06-03 20:16:08,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11453 conditions, 5008 events. 3490/5008 cut-off events. For 1157/1159 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26141 event pairs, 1828 based on Foata normal form. 2/4990 useless extension candidates. Maximal degree in co-relation 11431. Up to 4872 conditions per place. [2024-06-03 20:16:08,435 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 49 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2024-06-03 20:16:08,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 438 flow [2024-06-03 20:16:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:16:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:16:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-03 20:16:08,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 20:16:08,438 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 218 flow. Second operand 6 states and 135 transitions. [2024-06-03 20:16:08,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 438 flow [2024-06-03 20:16:08,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 404 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 20:16:08,441 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 309 flow [2024-06-03 20:16:08,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-03 20:16:08,442 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-06-03 20:16:08,442 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 309 flow [2024-06-03 20:16:08,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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:16:08,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:08,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:08,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:16:08,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:08,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1312374159, now seen corresponding path program 2 times [2024-06-03 20:16:08,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:08,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550294705] [2024-06-03 20:16:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:10,721 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:16:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:10,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550294705] [2024-06-03 20:16:10,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550294705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687102436] [2024-06-03 20:16:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:10,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:10,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:10,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 309 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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:16:10,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:10,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:10,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:12,335 INFO L124 PetriNetUnfolderBase]: 3518/5053 cut-off events. [2024-06-03 20:16:12,335 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2024-06-03 20:16:12,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12257 conditions, 5053 events. 3518/5053 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26267 event pairs, 1755 based on Foata normal form. 0/5033 useless extension candidates. Maximal degree in co-relation 12231. Up to 4877 conditions per place. [2024-06-03 20:16:12,366 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 64 selfloop transitions, 20 changer transitions 0/94 dead transitions. [2024-06-03 20:16:12,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 601 flow [2024-06-03 20:16:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-06-03 20:16:12,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-03 20:16:12,377 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 309 flow. Second operand 7 states and 165 transitions. [2024-06-03 20:16:12,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 601 flow [2024-06-03 20:16:12,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 94 transitions, 595 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-03 20:16:12,385 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 432 flow [2024-06-03 20:16:12,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2024-06-03 20:16:12,388 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2024-06-03 20:16:12,388 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 432 flow [2024-06-03 20:16:12,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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:16:12,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:12,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:12,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:16:12,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:12,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 859883023, now seen corresponding path program 2 times [2024-06-03 20:16:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134061139] [2024-06-03 20:16:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:15,398 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:16:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134061139] [2024-06-03 20:16:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134061139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:16:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352866123] [2024-06-03 20:16:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:15,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:16:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:16:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:16:15,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:16:15,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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:16:15,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:15,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:16:15,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:17,056 INFO L124 PetriNetUnfolderBase]: 4456/6373 cut-off events. [2024-06-03 20:16:17,056 INFO L125 PetriNetUnfolderBase]: For 5582/5611 co-relation queries the response was YES. [2024-06-03 20:16:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17395 conditions, 6373 events. 4456/6373 cut-off events. For 5582/5611 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 32643 event pairs, 1553 based on Foata normal form. 0/6368 useless extension candidates. Maximal degree in co-relation 17364. Up to 6098 conditions per place. [2024-06-03 20:16:17,091 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 67 selfloop transitions, 17 changer transitions 0/93 dead transitions. [2024-06-03 20:16:17,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 664 flow [2024-06-03 20:16:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:16:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:16:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-03 20:16:17,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-03 20:16:17,093 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 432 flow. Second operand 5 states and 125 transitions. [2024-06-03 20:16:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 664 flow [2024-06-03 20:16:17,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 631 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-03 20:16:17,100 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 457 flow [2024-06-03 20:16:17,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2024-06-03 20:16:17,101 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-06-03 20:16:17,101 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 457 flow [2024-06-03 20:16:17,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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:16:17,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:17,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:17,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:16:17,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:17,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2028934589, now seen corresponding path program 1 times [2024-06-03 20:16:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973423047] [2024-06-03 20:16:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:20,838 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:16:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973423047] [2024-06-03 20:16:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973423047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:16:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30968850] [2024-06-03 20:16:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:20,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:16:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:16:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:16:21,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:21,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 457 flow. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 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:16:21,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:21,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:21,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:22,786 INFO L124 PetriNetUnfolderBase]: 3542/5088 cut-off events. [2024-06-03 20:16:22,787 INFO L125 PetriNetUnfolderBase]: For 6268/6268 co-relation queries the response was YES. [2024-06-03 20:16:22,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15008 conditions, 5088 events. 3542/5088 cut-off events. For 6268/6268 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26401 event pairs, 1551 based on Foata normal form. 0/5069 useless extension candidates. Maximal degree in co-relation 14976. Up to 4874 conditions per place. [2024-06-03 20:16:22,813 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 71 selfloop transitions, 34 changer transitions 0/114 dead transitions. [2024-06-03 20:16:22,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 861 flow [2024-06-03 20:16:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:16:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:16:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-06-03 20:16:22,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2024-06-03 20:16:22,815 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 457 flow. Second operand 9 states and 206 transitions. [2024-06-03 20:16:22,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 861 flow [2024-06-03 20:16:22,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 114 transitions, 811 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 20:16:22,821 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 608 flow [2024-06-03 20:16:22,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2024-06-03 20:16:22,822 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2024-06-03 20:16:22,822 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 608 flow [2024-06-03 20:16:22,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 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:16:22,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:22,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:22,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:16:22,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:22,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1990848029, now seen corresponding path program 1 times [2024-06-03 20:16:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008565583] [2024-06-03 20:16:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:24,632 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:16:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008565583] [2024-06-03 20:16:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008565583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:16:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480570054] [2024-06-03 20:16:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:24,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:16:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:16:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:16:24,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:24,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:16:24,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:24,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:24,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:26,083 INFO L124 PetriNetUnfolderBase]: 3755/5405 cut-off events. [2024-06-03 20:16:26,083 INFO L125 PetriNetUnfolderBase]: For 12423/12470 co-relation queries the response was YES. [2024-06-03 20:16:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17745 conditions, 5405 events. 3755/5405 cut-off events. For 12423/12470 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 28498 event pairs, 1792 based on Foata normal form. 0/5300 useless extension candidates. Maximal degree in co-relation 17711. Up to 5223 conditions per place. [2024-06-03 20:16:26,116 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 73 selfloop transitions, 20 changer transitions 0/102 dead transitions. [2024-06-03 20:16:26,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 874 flow [2024-06-03 20:16:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:16:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:16:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-03 20:16:26,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-03 20:16:26,118 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 608 flow. Second operand 5 states and 120 transitions. [2024-06-03 20:16:26,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 874 flow [2024-06-03 20:16:26,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 102 transitions, 827 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 20:16:26,130 INFO L231 Difference]: Finished difference. Result has 87 places, 97 transitions, 686 flow [2024-06-03 20:16:26,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=87, PETRI_TRANSITIONS=97} [2024-06-03 20:16:26,133 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2024-06-03 20:16:26,133 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 97 transitions, 686 flow [2024-06-03 20:16:26,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:16:26,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:26,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:26,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:16:26,134 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:26,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1621353420, now seen corresponding path program 1 times [2024-06-03 20:16:26,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905937203] [2024-06-03 20:16:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:28,650 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:16:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905937203] [2024-06-03 20:16:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905937203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:16:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925888913] [2024-06-03 20:16:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:28,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:16:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:16:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:16:28,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:28,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 97 transitions, 686 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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:16:28,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:28,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:28,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:30,156 INFO L124 PetriNetUnfolderBase]: 3545/5107 cut-off events. [2024-06-03 20:16:30,156 INFO L125 PetriNetUnfolderBase]: For 11788/11872 co-relation queries the response was YES. [2024-06-03 20:16:30,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17095 conditions, 5107 events. 3545/5107 cut-off events. For 11788/11872 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26563 event pairs, 1643 based on Foata normal form. 0/5088 useless extension candidates. Maximal degree in co-relation 17057. Up to 4947 conditions per place. [2024-06-03 20:16:30,184 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 80 selfloop transitions, 19 changer transitions 0/108 dead transitions. [2024-06-03 20:16:30,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 945 flow [2024-06-03 20:16:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-03 20:16:30,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2024-06-03 20:16:30,187 INFO L175 Difference]: Start difference. First operand has 87 places, 97 transitions, 686 flow. Second operand 7 states and 152 transitions. [2024-06-03 20:16:30,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 945 flow [2024-06-03 20:16:30,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:16:30,196 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 736 flow [2024-06-03 20:16:30,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=736, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2024-06-03 20:16:30,197 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2024-06-03 20:16:30,197 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 736 flow [2024-06-03 20:16:30,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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:16:30,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:30,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:30,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:16:30,198 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:30,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1527494896, now seen corresponding path program 2 times [2024-06-03 20:16:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:30,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890803392] [2024-06-03 20:16:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:30,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:34,451 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:16:34,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890803392] [2024-06-03 20:16:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890803392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583233757] [2024-06-03 20:16:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:34,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:34,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:34,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 736 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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:16:34,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:34,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:34,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:36,439 INFO L124 PetriNetUnfolderBase]: 3738/5398 cut-off events. [2024-06-03 20:16:36,439 INFO L125 PetriNetUnfolderBase]: For 14843/14945 co-relation queries the response was YES. [2024-06-03 20:16:36,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18753 conditions, 5398 events. 3738/5398 cut-off events. For 14843/14945 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28394 event pairs, 1570 based on Foata normal form. 2/5371 useless extension candidates. Maximal degree in co-relation 18713. Up to 4881 conditions per place. [2024-06-03 20:16:36,468 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 99 selfloop transitions, 37 changer transitions 0/145 dead transitions. [2024-06-03 20:16:36,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 1309 flow [2024-06-03 20:16:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:16:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:16:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-03 20:16:36,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-06-03 20:16:36,470 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 736 flow. Second operand 8 states and 206 transitions. [2024-06-03 20:16:36,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 1309 flow [2024-06-03 20:16:36,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 145 transitions, 1254 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 20:16:36,482 INFO L231 Difference]: Finished difference. Result has 96 places, 105 transitions, 855 flow [2024-06-03 20:16:36,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=855, PETRI_PLACES=96, PETRI_TRANSITIONS=105} [2024-06-03 20:16:36,483 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2024-06-03 20:16:36,483 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 105 transitions, 855 flow [2024-06-03 20:16:36,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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:16:36,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:36,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:16:36,484 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:36,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1527534886, now seen corresponding path program 3 times [2024-06-03 20:16:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341228779] [2024-06-03 20:16:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:39,612 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:16:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341228779] [2024-06-03 20:16:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341228779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544946236] [2024-06-03 20:16:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:39,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:39,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 105 transitions, 855 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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:16:39,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:39,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:39,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:41,387 INFO L124 PetriNetUnfolderBase]: 3741/5404 cut-off events. [2024-06-03 20:16:41,387 INFO L125 PetriNetUnfolderBase]: For 21125/21223 co-relation queries the response was YES. [2024-06-03 20:16:41,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20214 conditions, 5404 events. 3741/5404 cut-off events. For 21125/21223 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28442 event pairs, 1653 based on Foata normal form. 0/5375 useless extension candidates. Maximal degree in co-relation 20172. Up to 5215 conditions per place. [2024-06-03 20:16:41,420 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 101 selfloop transitions, 31 changer transitions 0/141 dead transitions. [2024-06-03 20:16:41,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 141 transitions, 1356 flow [2024-06-03 20:16:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:16:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:16:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-06-03 20:16:41,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-03 20:16:41,423 INFO L175 Difference]: Start difference. First operand has 96 places, 105 transitions, 855 flow. Second operand 8 states and 185 transitions. [2024-06-03 20:16:41,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 141 transitions, 1356 flow [2024-06-03 20:16:41,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 141 transitions, 1238 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-03 20:16:41,441 INFO L231 Difference]: Finished difference. Result has 102 places, 119 transitions, 1000 flow [2024-06-03 20:16:41,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1000, PETRI_PLACES=102, PETRI_TRANSITIONS=119} [2024-06-03 20:16:41,442 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-06-03 20:16:41,442 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 119 transitions, 1000 flow [2024-06-03 20:16:41,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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:16:41,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:41,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:41,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:16:41,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:41,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1528745746, now seen corresponding path program 4 times [2024-06-03 20:16:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057875420] [2024-06-03 20:16:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:43,930 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:16:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057875420] [2024-06-03 20:16:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057875420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:43,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:43,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:16:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482358510] [2024-06-03 20:16:43,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:43,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:16:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:16:43,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:16:44,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:16:44,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 119 transitions, 1000 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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:16:44,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:44,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:16:44,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:45,465 INFO L124 PetriNetUnfolderBase]: 3751/5421 cut-off events. [2024-06-03 20:16:45,465 INFO L125 PetriNetUnfolderBase]: For 22698/22794 co-relation queries the response was YES. [2024-06-03 20:16:45,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20216 conditions, 5421 events. 3751/5421 cut-off events. For 22698/22794 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28572 event pairs, 1654 based on Foata normal form. 0/5394 useless extension candidates. Maximal degree in co-relation 20170. Up to 5215 conditions per place. [2024-06-03 20:16:45,502 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 103 selfloop transitions, 30 changer transitions 0/142 dead transitions. [2024-06-03 20:16:45,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 1428 flow [2024-06-03 20:16:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:16:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:16:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-06-03 20:16:45,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-03 20:16:45,504 INFO L175 Difference]: Start difference. First operand has 102 places, 119 transitions, 1000 flow. Second operand 8 states and 185 transitions. [2024-06-03 20:16:45,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 1428 flow [2024-06-03 20:16:45,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 142 transitions, 1341 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-03 20:16:45,526 INFO L231 Difference]: Finished difference. Result has 107 places, 121 transitions, 1028 flow [2024-06-03 20:16:45,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1028, PETRI_PLACES=107, PETRI_TRANSITIONS=121} [2024-06-03 20:16:45,527 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2024-06-03 20:16:45,528 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 1028 flow [2024-06-03 20:16:45,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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:16:45,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:45,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:45,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:16:45,528 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:45,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1228899720, now seen corresponding path program 1 times [2024-06-03 20:16:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021789695] [2024-06-03 20:16:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:48,364 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:16:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021789695] [2024-06-03 20:16:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021789695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974438984] [2024-06-03 20:16:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:48,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:48,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:16:48,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 1028 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:16:48,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:48,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:16:48,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:50,085 INFO L124 PetriNetUnfolderBase]: 4720/6790 cut-off events. [2024-06-03 20:16:50,085 INFO L125 PetriNetUnfolderBase]: For 25425/25526 co-relation queries the response was YES. [2024-06-03 20:16:50,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24256 conditions, 6790 events. 4720/6790 cut-off events. For 25425/25526 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35159 event pairs, 1888 based on Foata normal form. 0/6761 useless extension candidates. Maximal degree in co-relation 24209. Up to 6542 conditions per place. [2024-06-03 20:16:50,124 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 96 selfloop transitions, 29 changer transitions 0/133 dead transitions. [2024-06-03 20:16:50,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 133 transitions, 1351 flow [2024-06-03 20:16:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:16:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:16:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-03 20:16:50,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-06-03 20:16:50,126 INFO L175 Difference]: Start difference. First operand has 107 places, 121 transitions, 1028 flow. Second operand 6 states and 136 transitions. [2024-06-03 20:16:50,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 133 transitions, 1351 flow [2024-06-03 20:16:50,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1277 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 20:16:50,164 INFO L231 Difference]: Finished difference. Result has 107 places, 124 transitions, 1067 flow [2024-06-03 20:16:50,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1067, PETRI_PLACES=107, PETRI_TRANSITIONS=124} [2024-06-03 20:16:50,165 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2024-06-03 20:16:50,165 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 124 transitions, 1067 flow [2024-06-03 20:16:50,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:16:50,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:50,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:50,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:16:50,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:50,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1702905106, now seen corresponding path program 2 times [2024-06-03 20:16:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:50,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495009498] [2024-06-03 20:16:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:16:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495009498] [2024-06-03 20:16:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495009498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:52,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589105172] [2024-06-03 20:16:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:52,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:52,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:16:52,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 124 transitions, 1067 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:16:52,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:52,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:16:52,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:54,410 INFO L124 PetriNetUnfolderBase]: 4716/6786 cut-off events. [2024-06-03 20:16:54,411 INFO L125 PetriNetUnfolderBase]: For 27795/27900 co-relation queries the response was YES. [2024-06-03 20:16:54,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24842 conditions, 6786 events. 4716/6786 cut-off events. For 27795/27900 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35117 event pairs, 1878 based on Foata normal form. 4/6763 useless extension candidates. Maximal degree in co-relation 24794. Up to 6560 conditions per place. [2024-06-03 20:16:54,450 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 112 selfloop transitions, 22 changer transitions 0/142 dead transitions. [2024-06-03 20:16:54,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 142 transitions, 1471 flow [2024-06-03 20:16:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:16:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:16:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-03 20:16:54,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-03 20:16:54,452 INFO L175 Difference]: Start difference. First operand has 107 places, 124 transitions, 1067 flow. Second operand 8 states and 165 transitions. [2024-06-03 20:16:54,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 142 transitions, 1471 flow [2024-06-03 20:16:54,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 142 transitions, 1401 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 20:16:54,478 INFO L231 Difference]: Finished difference. Result has 113 places, 132 transitions, 1171 flow [2024-06-03 20:16:54,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1171, PETRI_PLACES=113, PETRI_TRANSITIONS=132} [2024-06-03 20:16:54,478 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2024-06-03 20:16:54,479 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 132 transitions, 1171 flow [2024-06-03 20:16:54,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:16:54,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:54,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:54,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:16:54,479 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:54,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1736150746, now seen corresponding path program 3 times [2024-06-03 20:16:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:54,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138159720] [2024-06-03 20:16:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:16:57,248 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:16:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:16:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138159720] [2024-06-03 20:16:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138159720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:16:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:16:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:16:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772866370] [2024-06-03 20:16:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:16:57,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:16:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:16:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:16:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:16:57,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:16:57,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 132 transitions, 1171 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:16:57,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:16:57,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:16:57,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:16:59,140 INFO L124 PetriNetUnfolderBase]: 4716/6785 cut-off events. [2024-06-03 20:16:59,140 INFO L125 PetriNetUnfolderBase]: For 29746/29877 co-relation queries the response was YES. [2024-06-03 20:16:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24920 conditions, 6785 events. 4716/6785 cut-off events. For 29746/29877 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 35298 event pairs, 1736 based on Foata normal form. 6/6790 useless extension candidates. Maximal degree in co-relation 24869. Up to 6465 conditions per place. [2024-06-03 20:16:59,178 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 101 selfloop transitions, 50 changer transitions 0/159 dead transitions. [2024-06-03 20:16:59,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 1663 flow [2024-06-03 20:16:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:16:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:16:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-03 20:16:59,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2024-06-03 20:16:59,180 INFO L175 Difference]: Start difference. First operand has 113 places, 132 transitions, 1171 flow. Second operand 7 states and 163 transitions. [2024-06-03 20:16:59,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 1663 flow [2024-06-03 20:16:59,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 159 transitions, 1599 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-03 20:16:59,216 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1410 flow [2024-06-03 20:16:59,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1410, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2024-06-03 20:16:59,216 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2024-06-03 20:16:59,217 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1410 flow [2024-06-03 20:16:59,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:16:59,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:16:59,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:16:59,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:16:59,217 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:16:59,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:16:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1702782160, now seen corresponding path program 1 times [2024-06-03 20:16:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:16:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638983683] [2024-06-03 20:16:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:16:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:16:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:01,726 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:17:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638983683] [2024-06-03 20:17:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638983683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:17:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044412603] [2024-06-03 20:17:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:17:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:17:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:17:01,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:17:01,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1410 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:17:01,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:01,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:17:01,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:03,745 INFO L124 PetriNetUnfolderBase]: 4721/6826 cut-off events. [2024-06-03 20:17:03,746 INFO L125 PetriNetUnfolderBase]: For 37488/37599 co-relation queries the response was YES. [2024-06-03 20:17:03,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26853 conditions, 6826 events. 4721/6826 cut-off events. For 37488/37599 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 35861 event pairs, 1805 based on Foata normal form. 2/6827 useless extension candidates. Maximal degree in co-relation 26798. Up to 6549 conditions per place. [2024-06-03 20:17:03,787 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 120 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2024-06-03 20:17:03,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 156 transitions, 1793 flow [2024-06-03 20:17:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-03 20:17:03,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4257142857142857 [2024-06-03 20:17:03,788 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 1410 flow. Second operand 7 states and 149 transitions. [2024-06-03 20:17:03,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 156 transitions, 1793 flow [2024-06-03 20:17:03,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 156 transitions, 1671 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:03,828 INFO L231 Difference]: Finished difference. Result has 123 places, 149 transitions, 1420 flow [2024-06-03 20:17:03,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1420, PETRI_PLACES=123, PETRI_TRANSITIONS=149} [2024-06-03 20:17:03,828 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 70 predicate places. [2024-06-03 20:17:03,829 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 149 transitions, 1420 flow [2024-06-03 20:17:03,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:17:03,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:03,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:03,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:17:03,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:17:03,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1736058490, now seen corresponding path program 2 times [2024-06-03 20:17:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404239441] [2024-06-03 20:17:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:06,364 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:17:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:06,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404239441] [2024-06-03 20:17:06,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404239441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:06,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:17:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183622537] [2024-06-03 20:17:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:06,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:17:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:17:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:17:06,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:17:06,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 149 transitions, 1420 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:17:06,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:06,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:17:06,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:08,459 INFO L124 PetriNetUnfolderBase]: 4724/6832 cut-off events. [2024-06-03 20:17:08,459 INFO L125 PetriNetUnfolderBase]: For 36508/36628 co-relation queries the response was YES. [2024-06-03 20:17:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26538 conditions, 6832 events. 4724/6832 cut-off events. For 36508/36628 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 35855 event pairs, 1472 based on Foata normal form. 6/6835 useless extension candidates. Maximal degree in co-relation 26482. Up to 6501 conditions per place. [2024-06-03 20:17:08,498 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 131 selfloop transitions, 27 changer transitions 0/166 dead transitions. [2024-06-03 20:17:08,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 166 transitions, 1880 flow [2024-06-03 20:17:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:17:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:17:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-03 20:17:08,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-03 20:17:08,500 INFO L175 Difference]: Start difference. First operand has 123 places, 149 transitions, 1420 flow. Second operand 6 states and 141 transitions. [2024-06-03 20:17:08,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 166 transitions, 1880 flow [2024-06-03 20:17:08,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 166 transitions, 1801 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:08,534 INFO L231 Difference]: Finished difference. Result has 126 places, 152 transitions, 1461 flow [2024-06-03 20:17:08,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1461, PETRI_PLACES=126, PETRI_TRANSITIONS=152} [2024-06-03 20:17:08,535 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2024-06-03 20:17:08,535 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 152 transitions, 1461 flow [2024-06-03 20:17:08,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:17:08,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:08,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:08,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:17:08,536 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:17:08,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1734956440, now seen corresponding path program 3 times [2024-06-03 20:17:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592245855] [2024-06-03 20:17:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:11,125 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:17:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:11,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592245855] [2024-06-03 20:17:11,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592245855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:11,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:11,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:17:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074150126] [2024-06-03 20:17:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:17:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:17:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:17:11,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:17:11,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 152 transitions, 1461 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:17:11,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:11,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:17:11,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:13,124 INFO L124 PetriNetUnfolderBase]: 4721/6826 cut-off events. [2024-06-03 20:17:13,125 INFO L125 PetriNetUnfolderBase]: For 37018/37141 co-relation queries the response was YES. [2024-06-03 20:17:13,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26587 conditions, 6826 events. 4721/6826 cut-off events. For 37018/37141 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 35854 event pairs, 1804 based on Foata normal form. 14/6839 useless extension candidates. Maximal degree in co-relation 26529. Up to 6547 conditions per place. [2024-06-03 20:17:13,164 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 124 selfloop transitions, 29 changer transitions 0/161 dead transitions. [2024-06-03 20:17:13,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1826 flow [2024-06-03 20:17:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:17:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:17:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-03 20:17:13,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44333333333333336 [2024-06-03 20:17:13,166 INFO L175 Difference]: Start difference. First operand has 126 places, 152 transitions, 1461 flow. Second operand 6 states and 133 transitions. [2024-06-03 20:17:13,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1826 flow [2024-06-03 20:17:13,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 161 transitions, 1743 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:13,210 INFO L231 Difference]: Finished difference. Result has 129 places, 154 transitions, 1487 flow [2024-06-03 20:17:13,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=129, PETRI_TRANSITIONS=154} [2024-06-03 20:17:13,210 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 76 predicate places. [2024-06-03 20:17:13,210 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 154 transitions, 1487 flow [2024-06-03 20:17:13,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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:17:13,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:13,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:13,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:17:13,211 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:17:13,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1945970654, now seen corresponding path program 1 times [2024-06-03 20:17:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:13,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503389259] [2024-06-03 20:17:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:15,241 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:17:15,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:15,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503389259] [2024-06-03 20:17:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503389259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30227419] [2024-06-03 20:17:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:15,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:15,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:15,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:17:15,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 154 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:17:15,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:15,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:17:15,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:16,813 INFO L124 PetriNetUnfolderBase]: 4007/5836 cut-off events. [2024-06-03 20:17:16,813 INFO L125 PetriNetUnfolderBase]: For 34083/34094 co-relation queries the response was YES. [2024-06-03 20:17:16,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23675 conditions, 5836 events. 4007/5836 cut-off events. For 34083/34094 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 31781 event pairs, 1729 based on Foata normal form. 2/5724 useless extension candidates. Maximal degree in co-relation 23616. Up to 5586 conditions per place. [2024-06-03 20:17:16,856 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 134 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2024-06-03 20:17:16,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 181 transitions, 2018 flow [2024-06-03 20:17:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:17:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:17:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-03 20:17:16,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2024-06-03 20:17:16,857 INFO L175 Difference]: Start difference. First operand has 129 places, 154 transitions, 1487 flow. Second operand 7 states and 167 transitions. [2024-06-03 20:17:16,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 181 transitions, 2018 flow [2024-06-03 20:17:16,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 181 transitions, 1928 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-03 20:17:16,892 INFO L231 Difference]: Finished difference. Result has 134 places, 168 transitions, 1662 flow [2024-06-03 20:17:16,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1662, PETRI_PLACES=134, PETRI_TRANSITIONS=168} [2024-06-03 20:17:16,893 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2024-06-03 20:17:16,893 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 168 transitions, 1662 flow [2024-06-03 20:17:16,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:17:16,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:16,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:16,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:17:16,894 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:17:16,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1944571004, now seen corresponding path program 2 times [2024-06-03 20:17:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096517196] [2024-06-03 20:17:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:17:18,773 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:17:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:17:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096517196] [2024-06-03 20:17:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096517196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:17:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:17:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:17:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279507210] [2024-06-03 20:17:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:17:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:17:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:17:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:17:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:17:18,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-03 20:17:18,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 168 transitions, 1662 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:17:18,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:17:18,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-03 20:17:18,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:17:20,320 INFO L124 PetriNetUnfolderBase]: 4007/5834 cut-off events. [2024-06-03 20:17:20,320 INFO L125 PetriNetUnfolderBase]: For 32137/32148 co-relation queries the response was YES. [2024-06-03 20:17:20,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23868 conditions, 5834 events. 4007/5834 cut-off events. For 32137/32148 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 31776 event pairs, 1731 based on Foata normal form. 2/5723 useless extension candidates. Maximal degree in co-relation 23806. Up to 5625 conditions per place. [2024-06-03 20:17:20,363 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 154 selfloop transitions, 20 changer transitions 0/183 dead transitions. [2024-06-03 20:17:20,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 183 transitions, 2131 flow [2024-06-03 20:17:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:17:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:17:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-03 20:17:20,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45666666666666667 [2024-06-03 20:17:20,364 INFO L175 Difference]: Start difference. First operand has 134 places, 168 transitions, 1662 flow. Second operand 6 states and 137 transitions. [2024-06-03 20:17:20,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 183 transitions, 2131 flow [2024-06-03 20:17:20,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 183 transitions, 2063 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 20:17:20,404 INFO L231 Difference]: Finished difference. Result has 139 places, 177 transitions, 1759 flow [2024-06-03 20:17:20,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1759, PETRI_PLACES=139, PETRI_TRANSITIONS=177} [2024-06-03 20:17:20,405 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 86 predicate places. [2024-06-03 20:17:20,405 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 177 transitions, 1759 flow [2024-06-03 20:17:20,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:17:20,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:17:20,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:17:20,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:17:20,406 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:17:20,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:17:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1944575964, now seen corresponding path program 1 times [2024-06-03 20:17:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:17:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685470656] [2024-06-03 20:17:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:17:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:17:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:17:20,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:17:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:17:20,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:17:20,483 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:17:20,483 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-03 20:17:20,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-03 20:17:20,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-03 20:17:20,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-03 20:17:20,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-03 20:17:20,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-03 20:17:20,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-03 20:17:20,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-03 20:17:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:17:20,488 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-06-03 20:17:20,493 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:17:20,494 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:17:20,526 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,527 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,527 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,528 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,528 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,528 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,528 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,528 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,529 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,529 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,530 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,530 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,530 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,530 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,530 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,530 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,532 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:17:20,536 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:17:20,548 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-03 20:17:20,548 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-03 20:17:20,549 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:17:20 BasicIcfg [2024-06-03 20:17:20,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:17:20,549 INFO L158 Benchmark]: Toolchain (without parser) took 93099.19ms. Allocated memory was 157.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 109.4MB in the beginning and 834.2MB in the end (delta: -724.9MB). Peak memory consumption was 846.9MB. Max. memory is 16.1GB. [2024-06-03 20:17:20,549 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 77.4MB in the end (delta: 109.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:17:20,550 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:17:20,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 812.41ms. Allocated memory is still 157.3MB. Free memory was 109.4MB in the beginning and 124.3MB in the end (delta: -14.9MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-06-03 20:17:20,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.60ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 119.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:17:20,550 INFO L158 Benchmark]: Boogie Preprocessor took 107.09ms. Allocated memory is still 157.3MB. Free memory was 119.1MB in the beginning and 113.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 20:17:20,551 INFO L158 Benchmark]: RCFGBuilder took 1507.81ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 113.8MB in the beginning and 86.4MB in the end (delta: 27.4MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-06-03 20:17:20,551 INFO L158 Benchmark]: TraceAbstraction took 90605.33ms. Allocated memory was 213.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 85.4MB in the beginning and 834.2MB in the end (delta: -748.9MB). Peak memory consumption was 766.3MB. Max. memory is 16.1GB. [2024-06-03 20:17:20,553 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.18ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 77.4MB in the end (delta: 109.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 812.41ms. Allocated memory is still 157.3MB. Free memory was 109.4MB in the beginning and 124.3MB in the end (delta: -14.9MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.60ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 119.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.09ms. Allocated memory is still 157.3MB. Free memory was 119.1MB in the beginning and 113.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1507.81ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 113.8MB in the beginning and 86.4MB in the end (delta: 27.4MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * TraceAbstraction took 90605.33ms. Allocated memory was 213.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 85.4MB in the beginning and 834.2MB in the end (delta: -748.9MB). Peak memory consumption was 766.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 891]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; 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_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L885] 0 //@ ghost multithreaded = 1; [L885] FCALL, FORK 0 pthread_create(&t2421, ((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_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L886] 0 pthread_t t2422; [L887] 0 //@ assert ((((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$r_buff0_thd0 == (_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 || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))); [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-2, t2422=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L888] 0 pthread_t t2423; [L889] 0 //@ assert ((((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$r_buff0_thd0 == (_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 || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))); [L889] 0 x [L889] 0 x [L889] 0 x [L889] 0 x [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-2, t2422=-1, t2423=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L889] 0 x [L889] 0 x [L889] 0 x [L889] 0 x [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L889] 0 __unbuffered_p2_EAX$read_delayed_var [L890] 0 pthread_t t2424; [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 \read(x) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] EXPR 3 \read(x) [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L891] 0 //@ assert ((((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$r_buff0_thd0 == (_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 || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-2, t2422=-1, t2423=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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: 887]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 892]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 889]: 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: 887]: 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: 891]: 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: 885]: 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 9 procedures, 81 locations, 8 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: 90.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1304 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1067 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6560 IncrementalHoareTripleChecker+Invalid, 6850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 43 mSDtfsCounter, 6560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1759occurred in iteration=20, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 53.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 29915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:17:20,586 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