./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe020_power.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/safe020_power.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/safe020_power.i ./goblint.2024-05-21_14-57-05.files/protection/safe020_power.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 15:39:57,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:39:57,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:39:57,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:39:57,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:39:57,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:39:57,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:39:57,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:39:57,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:39:57,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:39:57,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:39:57,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:39:57,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:39:57,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:39:57,754 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:39:57,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:39:57,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:39:57,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:39:57,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:39:57,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:39:57,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:39:57,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:39:57,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:39:57,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:39:57,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:39:57,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:39:57,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:39:57,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:39:57,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:39:57,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:39:57,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:39:57,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:39:57,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:39:57,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:39:57,765 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:39:57,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:39:57,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:39:57,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 15:39:58,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:39:58,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:39:58,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:39:58,040 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:39:58,041 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:39:58,041 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/safe020_power.yml/witness.yml [2024-06-04 15:39:58,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:39:58,225 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:39:58,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i [2024-06-04 15:39:59,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:39:59,474 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:39:59,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i [2024-06-04 15:39:59,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5b38e2a/f4193a72c1d644a98fae54879f981d78/FLAG475d73869 [2024-06-04 15:39:59,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5b38e2a/f4193a72c1d644a98fae54879f981d78 [2024-06-04 15:39:59,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:39:59,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:39:59,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:39:59,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:39:59,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:39:59,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:39:58" (1/2) ... [2024-06-04 15:39:59,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcc98d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:39:59, skipping insertion in model container [2024-06-04 15:39:59,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:39:58" (1/2) ... [2024-06-04 15:39:59,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ccf41c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:39:59, skipping insertion in model container [2024-06-04 15:39:59,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:39:59" (2/2) ... [2024-06-04 15:39:59,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcc98d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:39:59, skipping insertion in model container [2024-06-04 15:39:59,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:39:59" (2/2) ... [2024-06-04 15:39:59,513 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:39:59,627 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:39:59,628 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_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 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-04 15:39:59,628 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_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 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-04 15:39:59,628 INFO L97 edCorrectnessWitness]: Location invariant before [L862-L862] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_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 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-04 15:39:59,628 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:39:59,629 INFO L106 edCorrectnessWitness]: ghost_update [L860-L860] multithreaded = 1; [2024-06-04 15:39:59,668 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:39:59,974 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:39:59,982 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:40:00,122 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:40:00,161 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:40:00,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00 WrapperNode [2024-06-04 15:40:00,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:40:00,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:40:00,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:40:00,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:40:00,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,216 INFO L138 Inliner]: procedures = 175, calls = 90, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2024-06-04 15:40:00,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:40:00,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:40:00,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:40:00,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:40:00,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,255 INFO L175 MemorySlicer]: Split 48 memory accesses to 2 slices as follows [2, 46]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-06-04 15:40:00,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:40:00,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:40:00,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:40:00,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:40:00,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (1/1) ... [2024-06-04 15:40:00,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:40:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:40:00,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 15:40:00,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 15:40:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:40:00,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:40:00,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:40:00,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:40:00,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:40:00,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:40:00,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:40:00,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:40:00,438 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:40:00,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:40:00,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:40:00,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:40:00,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:40:00,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:40:00,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:40:00,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:40:00,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:40:00,442 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 15:40:00,578 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:40:00,579 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:40:01,019 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:40:01,019 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:40:01,404 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:40:01,404 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:40:01,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:40:01 BoogieIcfgContainer [2024-06-04 15:40:01,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:40:01,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:40:01,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:40:01,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:40:01,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:39:58" (1/4) ... [2024-06-04 15:40:01,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4341b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:40:01, skipping insertion in model container [2024-06-04 15:40:01,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:39:59" (2/4) ... [2024-06-04 15:40:01,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4341b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:40:01, skipping insertion in model container [2024-06-04 15:40:01,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:40:00" (3/4) ... [2024-06-04 15:40:01,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4341b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:40:01, skipping insertion in model container [2024-06-04 15:40:01,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:40:01" (4/4) ... [2024-06-04 15:40:01,412 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2024-06-04 15:40:01,426 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:40:01,426 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:40:01,426 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:40:01,486 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:40:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:40:01,543 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 15:40:01,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:40:01,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:40:01,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:40:01,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 15:40:01,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:40:01,562 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;@85be22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:40:01,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:40:01,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:40:01,567 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:40:01,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:40:01,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:01,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:40:01,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:01,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1391466409, now seen corresponding path program 1 times [2024-06-04 15:40:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:01,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931114254] [2024-06-04 15:40:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931114254] [2024-06-04 15:40:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931114254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:03,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:40:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908559251] [2024-06-04 15:40:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:40:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:40:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:40:03,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:03,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:03,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:03,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:04,021 INFO L124 PetriNetUnfolderBase]: 716/1134 cut-off events. [2024-06-04 15:40:04,021 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-04 15:40:04,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 1134 events. 716/1134 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5035 event pairs, 403 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 2299. Up to 1103 conditions per place. [2024-06-04 15:40:04,034 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 29 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 15:40:04,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow [2024-06-04 15:40:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:40:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:40:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-06-04 15:40:04,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-04 15:40:04,047 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 77 transitions. [2024-06-04 15:40:04,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow [2024-06-04 15:40:04,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:40:04,054 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-04 15:40:04,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-04 15:40:04,059 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-04 15:40:04,059 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-04 15:40:04,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:04,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:04,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:04,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:40:04,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:04,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1464444552, now seen corresponding path program 1 times [2024-06-04 15:40:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272155109] [2024-06-04 15:40:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272155109] [2024-06-04 15:40:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272155109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:40:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521240982] [2024-06-04 15:40:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:05,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:40:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:40:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:40:05,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:05,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:05,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:05,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:05,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:06,199 INFO L124 PetriNetUnfolderBase]: 718/1136 cut-off events. [2024-06-04 15:40:06,199 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2024-06-04 15:40:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1136 events. 718/1136 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5130 event pairs, 251 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 2541. Up to 1071 conditions per place. [2024-06-04 15:40:06,207 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 34 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2024-06-04 15:40:06,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 263 flow [2024-06-04 15:40:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:40:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:40:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-04 15:40:06,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-04 15:40:06,210 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 5 states and 95 transitions. [2024-06-04 15:40:06,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 263 flow [2024-06-04 15:40:06,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:40:06,213 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 197 flow [2024-06-04 15:40:06,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-04 15:40:06,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-04 15:40:06,216 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 197 flow [2024-06-04 15:40:06,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:06,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:06,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:40:06,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:06,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1465516842, now seen corresponding path program 2 times [2024-06-04 15:40:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:06,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468410597] [2024-06-04 15:40:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:07,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468410597] [2024-06-04 15:40:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468410597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:40:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135925391] [2024-06-04 15:40:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:07,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:40:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:40:07,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:40:07,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:07,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:07,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:07,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:07,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:08,192 INFO L124 PetriNetUnfolderBase]: 716/1134 cut-off events. [2024-06-04 15:40:08,193 INFO L125 PetriNetUnfolderBase]: For 469/471 co-relation queries the response was YES. [2024-06-04 15:40:08,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 1134 events. 716/1134 cut-off events. For 469/471 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5022 event pairs, 271 based on Foata normal form. 4/1136 useless extension candidates. Maximal degree in co-relation 2786. Up to 1070 conditions per place. [2024-06-04 15:40:08,199 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 39 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-04 15:40:08,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 331 flow [2024-06-04 15:40:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:40:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:40:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-04 15:40:08,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-04 15:40:08,201 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 197 flow. Second operand 5 states and 100 transitions. [2024-06-04 15:40:08,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 331 flow [2024-06-04 15:40:08,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 323 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 15:40:08,204 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 218 flow [2024-06-04 15:40:08,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-04 15:40:08,204 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-04 15:40:08,204 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 218 flow [2024-06-04 15:40:08,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:08,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:08,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:40:08,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:08,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1847613173, now seen corresponding path program 1 times [2024-06-04 15:40:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645384907] [2024-06-04 15:40:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:09,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:09,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645384907] [2024-06-04 15:40:09,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645384907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:09,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:09,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:40:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136366743] [2024-06-04 15:40:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:09,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:40:09,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:40:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:40:09,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:09,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:09,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:09,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:09,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:10,104 INFO L124 PetriNetUnfolderBase]: 753/1191 cut-off events. [2024-06-04 15:40:10,105 INFO L125 PetriNetUnfolderBase]: For 406/408 co-relation queries the response was YES. [2024-06-04 15:40:10,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 1191 events. 753/1191 cut-off events. For 406/408 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5400 event pairs, 392 based on Foata normal form. 0/1166 useless extension candidates. Maximal degree in co-relation 2859. Up to 1162 conditions per place. [2024-06-04 15:40:10,113 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 36 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2024-06-04 15:40:10,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 341 flow [2024-06-04 15:40:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:40:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:40:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-04 15:40:10,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-04 15:40:10,115 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 218 flow. Second operand 5 states and 88 transitions. [2024-06-04 15:40:10,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 341 flow [2024-06-04 15:40:10,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 303 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:40:10,120 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 238 flow [2024-06-04 15:40:10,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-04 15:40:10,122 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-06-04 15:40:10,122 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 238 flow [2024-06-04 15:40:10,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:10,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:10,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:40:10,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:10,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1753107326, now seen corresponding path program 1 times [2024-06-04 15:40:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187200118] [2024-06-04 15:40:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187200118] [2024-06-04 15:40:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187200118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991130942] [2024-06-04 15:40:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:11,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:11,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:11,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:11,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:11,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:11,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:11,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:12,505 INFO L124 PetriNetUnfolderBase]: 757/1199 cut-off events. [2024-06-04 15:40:12,505 INFO L125 PetriNetUnfolderBase]: For 420/424 co-relation queries the response was YES. [2024-06-04 15:40:12,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 1199 events. 757/1199 cut-off events. For 420/424 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5423 event pairs, 296 based on Foata normal form. 0/1174 useless extension candidates. Maximal degree in co-relation 2916. Up to 1129 conditions per place. [2024-06-04 15:40:12,511 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 40 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2024-06-04 15:40:12,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 404 flow [2024-06-04 15:40:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:40:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:40:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-04 15:40:12,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2024-06-04 15:40:12,517 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 238 flow. Second operand 6 states and 112 transitions. [2024-06-04 15:40:12,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 404 flow [2024-06-04 15:40:12,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 64 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:40:12,522 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 303 flow [2024-06-04 15:40:12,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-06-04 15:40:12,523 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-06-04 15:40:12,524 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 303 flow [2024-06-04 15:40:12,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:12,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:12,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:12,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:40:12,525 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:12,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1734726806, now seen corresponding path program 2 times [2024-06-04 15:40:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807177975] [2024-06-04 15:40:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:14,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807177975] [2024-06-04 15:40:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807177975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546997008] [2024-06-04 15:40:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:14,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:14,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:14,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:14,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:14,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:14,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:14,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:14,863 INFO L124 PetriNetUnfolderBase]: 753/1193 cut-off events. [2024-06-04 15:40:14,863 INFO L125 PetriNetUnfolderBase]: For 639/643 co-relation queries the response was YES. [2024-06-04 15:40:14,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1193 events. 753/1193 cut-off events. For 639/643 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5461 event pairs, 273 based on Foata normal form. 2/1169 useless extension candidates. Maximal degree in co-relation 3024. Up to 1126 conditions per place. [2024-06-04 15:40:14,869 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 36 selfloop transitions, 20 changer transitions 0/63 dead transitions. [2024-06-04 15:40:14,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 455 flow [2024-06-04 15:40:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:40:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:40:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 15:40:14,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 15:40:14,870 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 303 flow. Second operand 6 states and 106 transitions. [2024-06-04 15:40:14,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 455 flow [2024-06-04 15:40:14,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 429 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:40:14,872 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 349 flow [2024-06-04 15:40:14,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-06-04 15:40:14,873 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-04 15:40:14,873 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 349 flow [2024-06-04 15:40:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:14,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:14,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:40:14,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:14,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1734719862, now seen corresponding path program 1 times [2024-06-04 15:40:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409150101] [2024-06-04 15:40:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409150101] [2024-06-04 15:40:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409150101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795514723] [2024-06-04 15:40:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:16,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:16,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:16,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:16,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:16,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:16,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:17,060 INFO L124 PetriNetUnfolderBase]: 757/1199 cut-off events. [2024-06-04 15:40:17,060 INFO L125 PetriNetUnfolderBase]: For 729/731 co-relation queries the response was YES. [2024-06-04 15:40:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 1199 events. 757/1199 cut-off events. For 729/731 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5421 event pairs, 370 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 3098. Up to 1166 conditions per place. [2024-06-04 15:40:17,066 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 44 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-04 15:40:17,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 489 flow [2024-06-04 15:40:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:40:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:40:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 15:40:17,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 15:40:17,067 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 349 flow. Second operand 6 states and 102 transitions. [2024-06-04 15:40:17,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 489 flow [2024-06-04 15:40:17,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 462 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:40:17,069 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 374 flow [2024-06-04 15:40:17,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-04 15:40:17,070 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-04 15:40:17,070 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 374 flow [2024-06-04 15:40:17,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:17,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:17,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:17,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:40:17,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:17,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1734123732, now seen corresponding path program 2 times [2024-06-04 15:40:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551964005] [2024-06-04 15:40:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551964005] [2024-06-04 15:40:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551964005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960802702] [2024-06-04 15:40:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:18,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:18,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:18,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:18,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:18,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:18,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:19,322 INFO L124 PetriNetUnfolderBase]: 757/1199 cut-off events. [2024-06-04 15:40:19,322 INFO L125 PetriNetUnfolderBase]: For 1068/1072 co-relation queries the response was YES. [2024-06-04 15:40:19,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 1199 events. 757/1199 cut-off events. For 1068/1072 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5392 event pairs, 358 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 3284. Up to 1157 conditions per place. [2024-06-04 15:40:19,328 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 51 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2024-06-04 15:40:19,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 604 flow [2024-06-04 15:40:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-04 15:40:19,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-04 15:40:19,329 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 374 flow. Second operand 7 states and 120 transitions. [2024-06-04 15:40:19,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 604 flow [2024-06-04 15:40:19,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 564 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 15:40:19,332 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 476 flow [2024-06-04 15:40:19,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-06-04 15:40:19,332 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-04 15:40:19,332 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 476 flow [2024-06-04 15:40:19,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:19,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:19,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:19,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:40:19,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:19,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1195300794, now seen corresponding path program 1 times [2024-06-04 15:40:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037579076] [2024-06-04 15:40:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:21,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037579076] [2024-06-04 15:40:21,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037579076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:21,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:21,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:21,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069974352] [2024-06-04 15:40:21,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:21,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:21,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:21,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 476 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:21,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:21,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:21,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:22,059 INFO L124 PetriNetUnfolderBase]: 738/1183 cut-off events. [2024-06-04 15:40:22,060 INFO L125 PetriNetUnfolderBase]: For 1853/1909 co-relation queries the response was YES. [2024-06-04 15:40:22,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1183 events. 738/1183 cut-off events. For 1853/1909 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5408 event pairs, 244 based on Foata normal form. 4/1180 useless extension candidates. Maximal degree in co-relation 3538. Up to 1104 conditions per place. [2024-06-04 15:40:22,067 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 22 changer transitions 0/80 dead transitions. [2024-06-04 15:40:22,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 652 flow [2024-06-04 15:40:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:40:22,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:40:22,069 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 476 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:40:22,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 652 flow [2024-06-04 15:40:22,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 80 transitions, 600 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-04 15:40:22,076 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 493 flow [2024-06-04 15:40:22,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=493, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-06-04 15:40:22,077 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-04 15:40:22,077 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 493 flow [2024-06-04 15:40:22,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:22,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:22,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:22,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:40:22,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:22,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1962743670, now seen corresponding path program 2 times [2024-06-04 15:40:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:22,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079591982] [2024-06-04 15:40:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079591982] [2024-06-04 15:40:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079591982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:24,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:24,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135837618] [2024-06-04 15:40:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:24,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:24,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:24,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 493 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:24,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:24,855 INFO L124 PetriNetUnfolderBase]: 740/1190 cut-off events. [2024-06-04 15:40:24,855 INFO L125 PetriNetUnfolderBase]: For 1847/1903 co-relation queries the response was YES. [2024-06-04 15:40:24,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3629 conditions, 1190 events. 740/1190 cut-off events. For 1847/1903 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5402 event pairs, 237 based on Foata normal form. 4/1189 useless extension candidates. Maximal degree in co-relation 3594. Up to 1108 conditions per place. [2024-06-04 15:40:24,862 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 64 selfloop transitions, 26 changer transitions 0/97 dead transitions. [2024-06-04 15:40:24,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 817 flow [2024-06-04 15:40:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 15:40:24,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-04 15:40:24,864 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 493 flow. Second operand 7 states and 130 transitions. [2024-06-04 15:40:24,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 817 flow [2024-06-04 15:40:24,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 757 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:40:24,868 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 608 flow [2024-06-04 15:40:24,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=608, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2024-06-04 15:40:24,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-04 15:40:24,870 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 608 flow [2024-06-04 15:40:24,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:24,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:24,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:24,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:40:24,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:24,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1244554216, now seen corresponding path program 3 times [2024-06-04 15:40:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940300824] [2024-06-04 15:40:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940300824] [2024-06-04 15:40:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940300824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441728061] [2024-06-04 15:40:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:27,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:27,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 608 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:27,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:27,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:27,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:27,502 INFO L124 PetriNetUnfolderBase]: 741/1192 cut-off events. [2024-06-04 15:40:27,502 INFO L125 PetriNetUnfolderBase]: For 2049/2103 co-relation queries the response was YES. [2024-06-04 15:40:27,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 1192 events. 741/1192 cut-off events. For 2049/2103 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5401 event pairs, 239 based on Foata normal form. 2/1190 useless extension candidates. Maximal degree in co-relation 3734. Up to 1111 conditions per place. [2024-06-04 15:40:27,508 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 58 selfloop transitions, 28 changer transitions 0/93 dead transitions. [2024-06-04 15:40:27,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 93 transitions, 829 flow [2024-06-04 15:40:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 15:40:27,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 15:40:27,509 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 608 flow. Second operand 7 states and 124 transitions. [2024-06-04 15:40:27,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 93 transitions, 829 flow [2024-06-04 15:40:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 796 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 15:40:27,513 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 672 flow [2024-06-04 15:40:27,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2024-06-04 15:40:27,514 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-04 15:40:27,514 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 672 flow [2024-06-04 15:40:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:27,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:27,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:27,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:40:27,515 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:27,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1961552340, now seen corresponding path program 4 times [2024-06-04 15:40:27,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966450716] [2024-06-04 15:40:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:29,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966450716] [2024-06-04 15:40:29,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966450716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:29,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:40:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957099055] [2024-06-04 15:40:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:40:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:40:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:40:29,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:29,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 672 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:29,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:29,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:29,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:30,240 INFO L124 PetriNetUnfolderBase]: 740/1190 cut-off events. [2024-06-04 15:40:30,240 INFO L125 PetriNetUnfolderBase]: For 2008/2050 co-relation queries the response was YES. [2024-06-04 15:40:30,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3718 conditions, 1190 events. 740/1190 cut-off events. For 2008/2050 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5472 event pairs, 150 based on Foata normal form. 2/1188 useless extension candidates. Maximal degree in co-relation 3677. Up to 1067 conditions per place. [2024-06-04 15:40:30,249 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 70 selfloop transitions, 28 changer transitions 0/105 dead transitions. [2024-06-04 15:40:30,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 105 transitions, 943 flow [2024-06-04 15:40:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 15:40:30,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-04 15:40:30,252 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 672 flow. Second operand 7 states and 134 transitions. [2024-06-04 15:40:30,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 105 transitions, 943 flow [2024-06-04 15:40:30,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 863 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 15:40:30,257 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 658 flow [2024-06-04 15:40:30,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=658, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2024-06-04 15:40:30,257 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-04 15:40:30,257 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 658 flow [2024-06-04 15:40:30,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:30,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:30,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:30,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:40:30,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:30,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2076761119, now seen corresponding path program 1 times [2024-06-04 15:40:30,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:30,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560411726] [2024-06-04 15:40:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560411726] [2024-06-04 15:40:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560411726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:32,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:32,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390661337] [2024-06-04 15:40:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:32,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:32,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:32,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:32,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:32,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 658 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:32,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:32,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:32,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:33,210 INFO L124 PetriNetUnfolderBase]: 759/1207 cut-off events. [2024-06-04 15:40:33,211 INFO L125 PetriNetUnfolderBase]: For 2435/2440 co-relation queries the response was YES. [2024-06-04 15:40:33,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3941 conditions, 1207 events. 759/1207 cut-off events. For 2435/2440 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5494 event pairs, 226 based on Foata normal form. 1/1207 useless extension candidates. Maximal degree in co-relation 3902. Up to 1154 conditions per place. [2024-06-04 15:40:33,217 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 68 selfloop transitions, 28 changer transitions 0/102 dead transitions. [2024-06-04 15:40:33,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 928 flow [2024-06-04 15:40:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:40:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:40:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 15:40:33,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 15:40:33,218 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 658 flow. Second operand 8 states and 136 transitions. [2024-06-04 15:40:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 928 flow [2024-06-04 15:40:33,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 102 transitions, 850 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 15:40:33,224 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 717 flow [2024-06-04 15:40:33,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2024-06-04 15:40:33,224 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-04 15:40:33,224 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 717 flow [2024-06-04 15:40:33,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:33,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:33,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:33,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:40:33,225 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:33,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2057767119, now seen corresponding path program 1 times [2024-06-04 15:40:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:33,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657442018] [2024-06-04 15:40:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657442018] [2024-06-04 15:40:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657442018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:34,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:40:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774518567] [2024-06-04 15:40:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:34,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:40:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:40:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:40:34,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:34,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:34,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:34,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:34,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:35,070 INFO L124 PetriNetUnfolderBase]: 1097/1685 cut-off events. [2024-06-04 15:40:35,071 INFO L125 PetriNetUnfolderBase]: For 3617/3684 co-relation queries the response was YES. [2024-06-04 15:40:35,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5420 conditions, 1685 events. 1097/1685 cut-off events. For 3617/3684 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7952 event pairs, 596 based on Foata normal form. 1/1683 useless extension candidates. Maximal degree in co-relation 5381. Up to 1649 conditions per place. [2024-06-04 15:40:35,079 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 82 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-04 15:40:35,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 100 transitions, 953 flow [2024-06-04 15:40:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:40:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:40:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-04 15:40:35,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2024-06-04 15:40:35,081 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 717 flow. Second operand 5 states and 89 transitions. [2024-06-04 15:40:35,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 100 transitions, 953 flow [2024-06-04 15:40:35,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 100 transitions, 898 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 15:40:35,087 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 742 flow [2024-06-04 15:40:35,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=742, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2024-06-04 15:40:35,087 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-06-04 15:40:35,088 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 742 flow [2024-06-04 15:40:35,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:35,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:35,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:35,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:40:35,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:35,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -52539775, now seen corresponding path program 1 times [2024-06-04 15:40:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:35,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825886117] [2024-06-04 15:40:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825886117] [2024-06-04 15:40:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825886117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365285422] [2024-06-04 15:40:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:36,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:36,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:36,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 742 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:36,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:36,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:36,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:37,399 INFO L124 PetriNetUnfolderBase]: 763/1217 cut-off events. [2024-06-04 15:40:37,399 INFO L125 PetriNetUnfolderBase]: For 3223/3228 co-relation queries the response was YES. [2024-06-04 15:40:37,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 1217 events. 763/1217 cut-off events. For 3223/3228 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5588 event pairs, 257 based on Foata normal form. 2/1219 useless extension candidates. Maximal degree in co-relation 4299. Up to 1163 conditions per place. [2024-06-04 15:40:37,409 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 81 selfloop transitions, 24 changer transitions 0/111 dead transitions. [2024-06-04 15:40:37,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 111 transitions, 1031 flow [2024-06-04 15:40:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 15:40:37,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 15:40:37,411 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 742 flow. Second operand 7 states and 123 transitions. [2024-06-04 15:40:37,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 111 transitions, 1031 flow [2024-06-04 15:40:37,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 111 transitions, 1019 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:40:37,420 INFO L231 Difference]: Finished difference. Result has 99 places, 104 transitions, 860 flow [2024-06-04 15:40:37,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=99, PETRI_TRANSITIONS=104} [2024-06-04 15:40:37,422 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2024-06-04 15:40:37,422 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 860 flow [2024-06-04 15:40:37,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:37,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:37,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:37,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:40:37,423 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:37,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -251822035, now seen corresponding path program 2 times [2024-06-04 15:40:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:37,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798323205] [2024-06-04 15:40:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798323205] [2024-06-04 15:40:39,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798323205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:39,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:39,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576904662] [2024-06-04 15:40:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:39,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:39,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:39,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 860 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:39,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:39,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:39,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:39,899 INFO L124 PetriNetUnfolderBase]: 797/1277 cut-off events. [2024-06-04 15:40:39,900 INFO L125 PetriNetUnfolderBase]: For 4400/4405 co-relation queries the response was YES. [2024-06-04 15:40:39,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4830 conditions, 1277 events. 797/1277 cut-off events. For 4400/4405 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5973 event pairs, 246 based on Foata normal form. 4/1281 useless extension candidates. Maximal degree in co-relation 4784. Up to 1186 conditions per place. [2024-06-04 15:40:39,906 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 93 selfloop transitions, 30 changer transitions 0/129 dead transitions. [2024-06-04 15:40:39,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 1297 flow [2024-06-04 15:40:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:40:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:40:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 15:40:39,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:40:39,907 INFO L175 Difference]: Start difference. First operand has 99 places, 104 transitions, 860 flow. Second operand 8 states and 144 transitions. [2024-06-04 15:40:39,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 1297 flow [2024-06-04 15:40:39,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 129 transitions, 1221 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-04 15:40:39,914 INFO L231 Difference]: Finished difference. Result has 105 places, 115 transitions, 983 flow [2024-06-04 15:40:39,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=983, PETRI_PLACES=105, PETRI_TRANSITIONS=115} [2024-06-04 15:40:39,915 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-04 15:40:39,915 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 983 flow [2024-06-04 15:40:39,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:39,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:39,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:39,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 15:40:39,916 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:39,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -64324735, now seen corresponding path program 3 times [2024-06-04 15:40:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:39,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020656319] [2024-06-04 15:40:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020656319] [2024-06-04 15:40:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020656319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964138130] [2024-06-04 15:40:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:41,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:41,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:41,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:41,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 115 transitions, 983 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:41,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:41,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:41,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:42,184 INFO L124 PetriNetUnfolderBase]: 805/1291 cut-off events. [2024-06-04 15:40:42,184 INFO L125 PetriNetUnfolderBase]: For 6383/6388 co-relation queries the response was YES. [2024-06-04 15:40:42,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 1291 events. 805/1291 cut-off events. For 6383/6388 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6022 event pairs, 250 based on Foata normal form. 2/1293 useless extension candidates. Maximal degree in co-relation 5374. Up to 1215 conditions per place. [2024-06-04 15:40:42,191 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 90 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-04 15:40:42,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 130 transitions, 1383 flow [2024-06-04 15:40:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-04 15:40:42,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-04 15:40:42,193 INFO L175 Difference]: Start difference. First operand has 105 places, 115 transitions, 983 flow. Second operand 7 states and 120 transitions. [2024-06-04 15:40:42,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 130 transitions, 1383 flow [2024-06-04 15:40:42,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 130 transitions, 1296 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-04 15:40:42,201 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 1087 flow [2024-06-04 15:40:42,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1087, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2024-06-04 15:40:42,202 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-04 15:40:42,202 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 1087 flow [2024-06-04 15:40:42,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:42,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:42,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:42,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 15:40:42,203 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:42,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash -625103575, now seen corresponding path program 4 times [2024-06-04 15:40:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621559291] [2024-06-04 15:40:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621559291] [2024-06-04 15:40:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621559291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609653068] [2024-06-04 15:40:43,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:43,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:43,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:43,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:43,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 1087 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:43,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:43,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:43,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:44,503 INFO L124 PetriNetUnfolderBase]: 801/1286 cut-off events. [2024-06-04 15:40:44,503 INFO L125 PetriNetUnfolderBase]: For 7162/7169 co-relation queries the response was YES. [2024-06-04 15:40:44,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5562 conditions, 1286 events. 801/1286 cut-off events. For 7162/7169 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5983 event pairs, 249 based on Foata normal form. 4/1290 useless extension candidates. Maximal degree in co-relation 5510. Up to 1219 conditions per place. [2024-06-04 15:40:44,511 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 96 selfloop transitions, 25 changer transitions 0/127 dead transitions. [2024-06-04 15:40:44,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 127 transitions, 1348 flow [2024-06-04 15:40:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:40:44,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:40:44,521 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 1087 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:40:44,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 127 transitions, 1348 flow [2024-06-04 15:40:44,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 1275 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-04 15:40:44,531 INFO L231 Difference]: Finished difference. Result has 115 places, 123 transitions, 1070 flow [2024-06-04 15:40:44,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1070, PETRI_PLACES=115, PETRI_TRANSITIONS=123} [2024-06-04 15:40:44,532 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-04 15:40:44,532 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 123 transitions, 1070 flow [2024-06-04 15:40:44,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:44,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:44,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:44,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 15:40:44,533 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:44,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 699855865, now seen corresponding path program 5 times [2024-06-04 15:40:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:44,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768243733] [2024-06-04 15:40:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:46,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768243733] [2024-06-04 15:40:46,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768243733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:46,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:46,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648075113] [2024-06-04 15:40:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:46,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:46,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:46,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 123 transitions, 1070 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:46,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:46,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:46,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:47,255 INFO L124 PetriNetUnfolderBase]: 834/1338 cut-off events. [2024-06-04 15:40:47,255 INFO L125 PetriNetUnfolderBase]: For 7995/8000 co-relation queries the response was YES. [2024-06-04 15:40:47,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5819 conditions, 1338 events. 834/1338 cut-off events. For 7995/8000 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6266 event pairs, 226 based on Foata normal form. 4/1342 useless extension candidates. Maximal degree in co-relation 5765. Up to 1194 conditions per place. [2024-06-04 15:40:47,262 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 100 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-06-04 15:40:47,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 1780 flow [2024-06-04 15:40:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:40:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:40:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-04 15:40:47,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281842818428184 [2024-06-04 15:40:47,263 INFO L175 Difference]: Start difference. First operand has 115 places, 123 transitions, 1070 flow. Second operand 9 states and 158 transitions. [2024-06-04 15:40:47,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 1780 flow [2024-06-04 15:40:47,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 160 transitions, 1690 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 15:40:47,274 INFO L231 Difference]: Finished difference. Result has 121 places, 142 transitions, 1394 flow [2024-06-04 15:40:47,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1394, PETRI_PLACES=121, PETRI_TRANSITIONS=142} [2024-06-04 15:40:47,275 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-04 15:40:47,275 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 142 transitions, 1394 flow [2024-06-04 15:40:47,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:47,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:47,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:47,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 15:40:47,275 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:47,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash 699868885, now seen corresponding path program 6 times [2024-06-04 15:40:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:47,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381165590] [2024-06-04 15:40:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381165590] [2024-06-04 15:40:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381165590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236541661] [2024-06-04 15:40:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:49,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:49,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 142 transitions, 1394 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:49,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:49,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:49,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:49,740 INFO L124 PetriNetUnfolderBase]: 826/1327 cut-off events. [2024-06-04 15:40:49,740 INFO L125 PetriNetUnfolderBase]: For 10308/10315 co-relation queries the response was YES. [2024-06-04 15:40:49,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 1327 events. 826/1327 cut-off events. For 10308/10315 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6187 event pairs, 225 based on Foata normal form. 4/1331 useless extension candidates. Maximal degree in co-relation 6308. Up to 1195 conditions per place. [2024-06-04 15:40:49,749 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 116 selfloop transitions, 40 changer transitions 0/162 dead transitions. [2024-06-04 15:40:49,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 162 transitions, 1895 flow [2024-06-04 15:40:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:40:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:40:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 15:40:49,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-04 15:40:49,751 INFO L175 Difference]: Start difference. First operand has 121 places, 142 transitions, 1394 flow. Second operand 8 states and 145 transitions. [2024-06-04 15:40:49,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 162 transitions, 1895 flow [2024-06-04 15:40:49,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 162 transitions, 1754 flow, removed 62 selfloop flow, removed 2 redundant places. [2024-06-04 15:40:49,766 INFO L231 Difference]: Finished difference. Result has 128 places, 142 transitions, 1346 flow [2024-06-04 15:40:49,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1346, PETRI_PLACES=128, PETRI_TRANSITIONS=142} [2024-06-04 15:40:49,766 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-04 15:40:49,767 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 142 transitions, 1346 flow [2024-06-04 15:40:49,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:49,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:49,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:49,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 15:40:49,767 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:49,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -618428407, now seen corresponding path program 1 times [2024-06-04 15:40:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599194717] [2024-06-04 15:40:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:51,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599194717] [2024-06-04 15:40:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599194717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195460318] [2024-06-04 15:40:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:51,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:51,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:51,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:51,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:51,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 142 transitions, 1346 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:51,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:51,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:51,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:52,204 INFO L124 PetriNetUnfolderBase]: 829/1340 cut-off events. [2024-06-04 15:40:52,204 INFO L125 PetriNetUnfolderBase]: For 9838/9845 co-relation queries the response was YES. [2024-06-04 15:40:52,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6272 conditions, 1340 events. 829/1340 cut-off events. For 9838/9845 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6345 event pairs, 372 based on Foata normal form. 4/1344 useless extension candidates. Maximal degree in co-relation 6211. Up to 1276 conditions per place. [2024-06-04 15:40:52,213 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 123 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2024-06-04 15:40:52,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 148 transitions, 1684 flow [2024-06-04 15:40:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:40:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:40:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-04 15:40:52,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40069686411149824 [2024-06-04 15:40:52,214 INFO L175 Difference]: Start difference. First operand has 128 places, 142 transitions, 1346 flow. Second operand 7 states and 115 transitions. [2024-06-04 15:40:52,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 148 transitions, 1684 flow [2024-06-04 15:40:52,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 148 transitions, 1529 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 15:40:52,227 INFO L231 Difference]: Finished difference. Result has 127 places, 144 transitions, 1272 flow [2024-06-04 15:40:52,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1272, PETRI_PLACES=127, PETRI_TRANSITIONS=144} [2024-06-04 15:40:52,227 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-04 15:40:52,228 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 144 transitions, 1272 flow [2024-06-04 15:40:52,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:52,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:52,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:52,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 15:40:52,228 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:52,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash -45547477, now seen corresponding path program 2 times [2024-06-04 15:40:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764471792] [2024-06-04 15:40:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764471792] [2024-06-04 15:40:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764471792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:54,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:54,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:40:54,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029764454] [2024-06-04 15:40:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:54,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:40:54,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:54,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:40:54,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:40:54,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:54,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 144 transitions, 1272 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:54,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:54,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:54,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:54,859 INFO L124 PetriNetUnfolderBase]: 832/1346 cut-off events. [2024-06-04 15:40:54,859 INFO L125 PetriNetUnfolderBase]: For 10534/10541 co-relation queries the response was YES. [2024-06-04 15:40:54,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6224 conditions, 1346 events. 832/1346 cut-off events. For 10534/10541 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6395 event pairs, 367 based on Foata normal form. 2/1348 useless extension candidates. Maximal degree in co-relation 6164. Up to 1272 conditions per place. [2024-06-04 15:40:54,867 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 122 selfloop transitions, 24 changer transitions 0/152 dead transitions. [2024-06-04 15:40:54,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 152 transitions, 1625 flow [2024-06-04 15:40:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:40:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:40:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-04 15:40:54,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-04 15:40:54,868 INFO L175 Difference]: Start difference. First operand has 127 places, 144 transitions, 1272 flow. Second operand 8 states and 132 transitions. [2024-06-04 15:40:54,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 152 transitions, 1625 flow [2024-06-04 15:40:54,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 152 transitions, 1560 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 15:40:54,880 INFO L231 Difference]: Finished difference. Result has 130 places, 146 transitions, 1302 flow [2024-06-04 15:40:54,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1302, PETRI_PLACES=130, PETRI_TRANSITIONS=146} [2024-06-04 15:40:54,881 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places. [2024-06-04 15:40:54,881 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 146 transitions, 1302 flow [2024-06-04 15:40:54,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:54,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:54,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:54,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 15:40:54,881 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:54,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash -44891827, now seen corresponding path program 3 times [2024-06-04 15:40:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866244674] [2024-06-04 15:40:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:40:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:40:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:40:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866244674] [2024-06-04 15:40:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866244674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:40:57,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:40:57,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:40:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472225720] [2024-06-04 15:40:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:40:57,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:40:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:40:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:40:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:40:57,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:40:57,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 146 transitions, 1302 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:57,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:40:57,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:40:57,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:40:58,060 INFO L124 PetriNetUnfolderBase]: 835/1351 cut-off events. [2024-06-04 15:40:58,060 INFO L125 PetriNetUnfolderBase]: For 11502/11509 co-relation queries the response was YES. [2024-06-04 15:40:58,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 1351 events. 835/1351 cut-off events. For 11502/11509 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6416 event pairs, 351 based on Foata normal form. 2/1353 useless extension candidates. Maximal degree in co-relation 6301. Up to 1236 conditions per place. [2024-06-04 15:40:58,069 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 125 selfloop transitions, 33 changer transitions 0/164 dead transitions. [2024-06-04 15:40:58,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 164 transitions, 1801 flow [2024-06-04 15:40:58,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:40:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:40:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 15:40:58,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 15:40:58,070 INFO L175 Difference]: Start difference. First operand has 130 places, 146 transitions, 1302 flow. Second operand 8 states and 141 transitions. [2024-06-04 15:40:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 164 transitions, 1801 flow [2024-06-04 15:40:58,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 164 transitions, 1724 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 15:40:58,089 INFO L231 Difference]: Finished difference. Result has 133 places, 151 transitions, 1390 flow [2024-06-04 15:40:58,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1390, PETRI_PLACES=133, PETRI_TRANSITIONS=151} [2024-06-04 15:40:58,090 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-06-04 15:40:58,090 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 151 transitions, 1390 flow [2024-06-04 15:40:58,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:40:58,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:40:58,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:40:58,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 15:40:58,091 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:40:58,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:40:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash -44913217, now seen corresponding path program 4 times [2024-06-04 15:40:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:40:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583528282] [2024-06-04 15:40:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:40:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:40:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583528282] [2024-06-04 15:41:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583528282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:41:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681507869] [2024-06-04 15:41:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:00,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:41:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:41:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:41:00,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:00,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 151 transitions, 1390 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:00,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:00,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:01,250 INFO L124 PetriNetUnfolderBase]: 832/1346 cut-off events. [2024-06-04 15:41:01,250 INFO L125 PetriNetUnfolderBase]: For 12335/12342 co-relation queries the response was YES. [2024-06-04 15:41:01,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6467 conditions, 1346 events. 832/1346 cut-off events. For 12335/12342 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6380 event pairs, 364 based on Foata normal form. 2/1348 useless extension candidates. Maximal degree in co-relation 6404. Up to 1261 conditions per place. [2024-06-04 15:41:01,257 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 125 selfloop transitions, 30 changer transitions 0/161 dead transitions. [2024-06-04 15:41:01,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 161 transitions, 1776 flow [2024-06-04 15:41:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:41:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:41:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 15:41:01,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 15:41:01,258 INFO L175 Difference]: Start difference. First operand has 133 places, 151 transitions, 1390 flow. Second operand 8 states and 136 transitions. [2024-06-04 15:41:01,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 161 transitions, 1776 flow [2024-06-04 15:41:01,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 1684 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-04 15:41:01,274 INFO L231 Difference]: Finished difference. Result has 137 places, 153 transitions, 1412 flow [2024-06-04 15:41:01,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=137, PETRI_TRANSITIONS=153} [2024-06-04 15:41:01,274 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-04 15:41:01,274 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 153 transitions, 1412 flow [2024-06-04 15:41:01,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:01,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:01,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:01,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 15:41:01,275 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:01,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1830436368, now seen corresponding path program 1 times [2024-06-04 15:41:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:01,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356357924] [2024-06-04 15:41:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356357924] [2024-06-04 15:41:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356357924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641435599] [2024-06-04 15:41:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:02,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:02,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 153 transitions, 1412 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:02,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:02,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:02,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:03,646 INFO L124 PetriNetUnfolderBase]: 1186/1839 cut-off events. [2024-06-04 15:41:03,646 INFO L125 PetriNetUnfolderBase]: For 13211/13288 co-relation queries the response was YES. [2024-06-04 15:41:03,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8326 conditions, 1839 events. 1186/1839 cut-off events. For 13211/13288 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8885 event pairs, 580 based on Foata normal form. 2/1838 useless extension candidates. Maximal degree in co-relation 8261. Up to 1739 conditions per place. [2024-06-04 15:41:03,657 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 128 selfloop transitions, 31 changer transitions 0/165 dead transitions. [2024-06-04 15:41:03,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 165 transitions, 1832 flow [2024-06-04 15:41:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-04 15:41:03,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2024-06-04 15:41:03,658 INFO L175 Difference]: Start difference. First operand has 137 places, 153 transitions, 1412 flow. Second operand 6 states and 112 transitions. [2024-06-04 15:41:03,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 165 transitions, 1832 flow [2024-06-04 15:41:03,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 165 transitions, 1729 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 15:41:03,679 INFO L231 Difference]: Finished difference. Result has 138 places, 159 transitions, 1469 flow [2024-06-04 15:41:03,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1469, PETRI_PLACES=138, PETRI_TRANSITIONS=159} [2024-06-04 15:41:03,680 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-04 15:41:03,680 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1469 flow [2024-06-04 15:41:03,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:03,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:03,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:03,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 15:41:03,680 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:03,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 783473470, now seen corresponding path program 1 times [2024-06-04 15:41:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808046518] [2024-06-04 15:41:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:05,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808046518] [2024-06-04 15:41:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808046518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:05,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:41:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204765218] [2024-06-04 15:41:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:41:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:41:05,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:41:05,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:05,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1469 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:05,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:05,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:07,057 INFO L124 PetriNetUnfolderBase]: 862/1396 cut-off events. [2024-06-04 15:41:07,057 INFO L125 PetriNetUnfolderBase]: For 13850/13857 co-relation queries the response was YES. [2024-06-04 15:41:07,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7009 conditions, 1396 events. 862/1396 cut-off events. For 13850/13857 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6687 event pairs, 345 based on Foata normal form. 2/1398 useless extension candidates. Maximal degree in co-relation 6942. Up to 1258 conditions per place. [2024-06-04 15:41:07,068 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 135 selfloop transitions, 46 changer transitions 0/187 dead transitions. [2024-06-04 15:41:07,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 2191 flow [2024-06-04 15:41:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:41:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:41:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 15:41:07,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:41:07,069 INFO L175 Difference]: Start difference. First operand has 138 places, 159 transitions, 1469 flow. Second operand 9 states and 162 transitions. [2024-06-04 15:41:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 2191 flow [2024-06-04 15:41:07,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 187 transitions, 2146 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:07,089 INFO L231 Difference]: Finished difference. Result has 145 places, 170 transitions, 1698 flow [2024-06-04 15:41:07,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1698, PETRI_PLACES=145, PETRI_TRANSITIONS=170} [2024-06-04 15:41:07,089 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-04 15:41:07,089 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 170 transitions, 1698 flow [2024-06-04 15:41:07,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:07,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:07,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:07,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 15:41:07,090 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:07,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1829304558, now seen corresponding path program 2 times [2024-06-04 15:41:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:07,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297786125] [2024-06-04 15:41:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297786125] [2024-06-04 15:41:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297786125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838050782] [2024-06-04 15:41:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:08,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:08,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:08,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 170 transitions, 1698 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:08,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:08,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:08,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:09,433 INFO L124 PetriNetUnfolderBase]: 1211/1873 cut-off events. [2024-06-04 15:41:09,433 INFO L125 PetriNetUnfolderBase]: For 17846/17928 co-relation queries the response was YES. [2024-06-04 15:41:09,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9518 conditions, 1873 events. 1211/1873 cut-off events. For 17846/17928 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9033 event pairs, 568 based on Foata normal form. 2/1871 useless extension candidates. Maximal degree in co-relation 9449. Up to 1778 conditions per place. [2024-06-04 15:41:09,444 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 139 selfloop transitions, 34 changer transitions 0/179 dead transitions. [2024-06-04 15:41:09,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 179 transitions, 2161 flow [2024-06-04 15:41:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:41:09,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-04 15:41:09,446 INFO L175 Difference]: Start difference. First operand has 145 places, 170 transitions, 1698 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:41:09,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 179 transitions, 2161 flow [2024-06-04 15:41:09,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 179 transitions, 2042 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-04 15:41:09,468 INFO L231 Difference]: Finished difference. Result has 146 places, 175 transitions, 1736 flow [2024-06-04 15:41:09,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1736, PETRI_PLACES=146, PETRI_TRANSITIONS=175} [2024-06-04 15:41:09,469 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-04 15:41:09,469 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 175 transitions, 1736 flow [2024-06-04 15:41:09,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:09,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:09,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:09,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 15:41:09,469 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:09,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1400204482, now seen corresponding path program 2 times [2024-06-04 15:41:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263628903] [2024-06-04 15:41:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263628903] [2024-06-04 15:41:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263628903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:41:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644950652] [2024-06-04 15:41:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:11,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:41:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:11,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:41:11,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:41:11,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:11,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 175 transitions, 1736 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:11,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:11,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:12,470 INFO L124 PetriNetUnfolderBase]: 877/1415 cut-off events. [2024-06-04 15:41:12,470 INFO L125 PetriNetUnfolderBase]: For 16323/16330 co-relation queries the response was YES. [2024-06-04 15:41:12,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 1415 events. 877/1415 cut-off events. For 16323/16330 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6755 event pairs, 297 based on Foata normal form. 1/1416 useless extension candidates. Maximal degree in co-relation 7512. Up to 1285 conditions per place. [2024-06-04 15:41:12,480 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 161 selfloop transitions, 51 changer transitions 0/218 dead transitions. [2024-06-04 15:41:12,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 218 transitions, 2549 flow [2024-06-04 15:41:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:41:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:41:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 15:41:12,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-04 15:41:12,481 INFO L175 Difference]: Start difference. First operand has 146 places, 175 transitions, 1736 flow. Second operand 8 states and 142 transitions. [2024-06-04 15:41:12,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 218 transitions, 2549 flow [2024-06-04 15:41:12,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 218 transitions, 2506 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:12,508 INFO L231 Difference]: Finished difference. Result has 154 places, 197 transitions, 2130 flow [2024-06-04 15:41:12,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2130, PETRI_PLACES=154, PETRI_TRANSITIONS=197} [2024-06-04 15:41:12,509 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-04 15:41:12,509 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 197 transitions, 2130 flow [2024-06-04 15:41:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:12,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:12,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:12,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 15:41:12,510 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:12,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1391930272, now seen corresponding path program 3 times [2024-06-04 15:41:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:12,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927662554] [2024-06-04 15:41:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927662554] [2024-06-04 15:41:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927662554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:14,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:41:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485266977] [2024-06-04 15:41:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:14,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:41:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:41:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:41:14,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:14,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 197 transitions, 2130 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:14,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:14,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:14,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:15,503 INFO L124 PetriNetUnfolderBase]: 879/1419 cut-off events. [2024-06-04 15:41:15,504 INFO L125 PetriNetUnfolderBase]: For 19118/19125 co-relation queries the response was YES. [2024-06-04 15:41:15,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1419 events. 879/1419 cut-off events. For 19118/19125 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6794 event pairs, 298 based on Foata normal form. 1/1420 useless extension candidates. Maximal degree in co-relation 7926. Up to 1247 conditions per place. [2024-06-04 15:41:15,513 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 153 selfloop transitions, 77 changer transitions 0/236 dead transitions. [2024-06-04 15:41:15,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 236 transitions, 3035 flow [2024-06-04 15:41:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:41:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:41:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 15:41:15,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:41:15,515 INFO L175 Difference]: Start difference. First operand has 154 places, 197 transitions, 2130 flow. Second operand 8 states and 144 transitions. [2024-06-04 15:41:15,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 236 transitions, 3035 flow [2024-06-04 15:41:15,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 236 transitions, 2882 flow, removed 66 selfloop flow, removed 2 redundant places. [2024-06-04 15:41:15,542 INFO L231 Difference]: Finished difference. Result has 162 places, 209 transitions, 2403 flow [2024-06-04 15:41:15,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2403, PETRI_PLACES=162, PETRI_TRANSITIONS=209} [2024-06-04 15:41:15,542 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-04 15:41:15,542 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 209 transitions, 2403 flow [2024-06-04 15:41:15,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:15,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:15,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:15,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 15:41:15,543 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:15,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1392318082, now seen corresponding path program 4 times [2024-06-04 15:41:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:15,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130868686] [2024-06-04 15:41:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:15,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:17,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130868686] [2024-06-04 15:41:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130868686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:41:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816762102] [2024-06-04 15:41:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:17,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:41:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:41:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:41:17,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:17,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 209 transitions, 2403 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:17,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:17,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:18,634 INFO L124 PetriNetUnfolderBase]: 877/1416 cut-off events. [2024-06-04 15:41:18,634 INFO L125 PetriNetUnfolderBase]: For 20647/20654 co-relation queries the response was YES. [2024-06-04 15:41:18,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8252 conditions, 1416 events. 877/1416 cut-off events. For 20647/20654 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6762 event pairs, 298 based on Foata normal form. 1/1417 useless extension candidates. Maximal degree in co-relation 8172. Up to 1245 conditions per place. [2024-06-04 15:41:18,644 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 144 selfloop transitions, 83 changer transitions 0/233 dead transitions. [2024-06-04 15:41:18,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 233 transitions, 3085 flow [2024-06-04 15:41:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:41:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:41:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 15:41:18,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 15:41:18,645 INFO L175 Difference]: Start difference. First operand has 162 places, 209 transitions, 2403 flow. Second operand 8 states and 140 transitions. [2024-06-04 15:41:18,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 233 transitions, 3085 flow [2024-06-04 15:41:18,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 233 transitions, 2867 flow, removed 70 selfloop flow, removed 4 redundant places. [2024-06-04 15:41:18,680 INFO L231 Difference]: Finished difference. Result has 168 places, 214 transitions, 2522 flow [2024-06-04 15:41:18,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2522, PETRI_PLACES=168, PETRI_TRANSITIONS=214} [2024-06-04 15:41:18,681 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places. [2024-06-04 15:41:18,681 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 214 transitions, 2522 flow [2024-06-04 15:41:18,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:18,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:18,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 15:41:18,681 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:18,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651632, now seen corresponding path program 1 times [2024-06-04 15:41:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039801640] [2024-06-04 15:41:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:20,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039801640] [2024-06-04 15:41:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039801640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063687647] [2024-06-04 15:41:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:20,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:20,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:20,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 214 transitions, 2522 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:20,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:20,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:20,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:21,205 INFO L124 PetriNetUnfolderBase]: 1231/1904 cut-off events. [2024-06-04 15:41:21,205 INFO L125 PetriNetUnfolderBase]: For 21757/21855 co-relation queries the response was YES. [2024-06-04 15:41:21,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10531 conditions, 1904 events. 1231/1904 cut-off events. For 21757/21855 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9223 event pairs, 565 based on Foata normal form. 2/1903 useless extension candidates. Maximal degree in co-relation 10448. Up to 1832 conditions per place. [2024-06-04 15:41:21,221 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 196 selfloop transitions, 24 changer transitions 0/226 dead transitions. [2024-06-04 15:41:21,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 226 transitions, 3078 flow [2024-06-04 15:41:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:41:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:41:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-04 15:41:21,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-04 15:41:21,222 INFO L175 Difference]: Start difference. First operand has 168 places, 214 transitions, 2522 flow. Second operand 7 states and 121 transitions. [2024-06-04 15:41:21,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 226 transitions, 3078 flow [2024-06-04 15:41:21,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 226 transitions, 2904 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-04 15:41:21,265 INFO L231 Difference]: Finished difference. Result has 173 places, 221 transitions, 2517 flow [2024-06-04 15:41:21,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2517, PETRI_PLACES=173, PETRI_TRANSITIONS=221} [2024-06-04 15:41:21,266 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2024-06-04 15:41:21,266 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 221 transitions, 2517 flow [2024-06-04 15:41:21,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:21,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:21,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:21,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 15:41:21,266 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:21,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2010040998, now seen corresponding path program 2 times [2024-06-04 15:41:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438246125] [2024-06-04 15:41:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:41:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:41:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:41:22,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438246125] [2024-06-04 15:41:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438246125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:41:22,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:41:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:41:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822038777] [2024-06-04 15:41:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:41:22,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:41:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:41:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:41:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:41:22,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:41:22,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 221 transitions, 2517 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:22,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:41:22,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:41:22,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:41:23,541 INFO L124 PetriNetUnfolderBase]: 1230/1903 cut-off events. [2024-06-04 15:41:23,541 INFO L125 PetriNetUnfolderBase]: For 23169/23267 co-relation queries the response was YES. [2024-06-04 15:41:23,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10889 conditions, 1903 events. 1230/1903 cut-off events. For 23169/23267 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9154 event pairs, 561 based on Foata normal form. 2/1902 useless extension candidates. Maximal degree in co-relation 10803. Up to 1841 conditions per place. [2024-06-04 15:41:23,556 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 206 selfloop transitions, 17 changer transitions 0/229 dead transitions. [2024-06-04 15:41:23,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 229 transitions, 3066 flow [2024-06-04 15:41:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:41:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:41:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-04 15:41:23,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-04 15:41:23,558 INFO L175 Difference]: Start difference. First operand has 173 places, 221 transitions, 2517 flow. Second operand 6 states and 103 transitions. [2024-06-04 15:41:23,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 229 transitions, 3066 flow [2024-06-04 15:41:23,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 229 transitions, 3011 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-04 15:41:23,608 INFO L231 Difference]: Finished difference. Result has 176 places, 226 transitions, 2591 flow [2024-06-04 15:41:23,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2591, PETRI_PLACES=176, PETRI_TRANSITIONS=226} [2024-06-04 15:41:23,609 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-06-04 15:41:23,609 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 226 transitions, 2591 flow [2024-06-04 15:41:23,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:41:23,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:41:23,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:41:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 15:41:23,609 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:41:23,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:41:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1830757962, now seen corresponding path program 1 times [2024-06-04 15:41:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:41:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233148761] [2024-06-04 15:41:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:41:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:41:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:41:23,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:41:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:41:23,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:41:23,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:41:23,683 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:41:23,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:41:23,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:41:23,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:41:23,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:41:23,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:41:23,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 15:41:23,695 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-06-04 15:41:23,700 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:41:23,700 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:41:23,738 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,740 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,740 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,740 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,740 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,742 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,742 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:41:23,748 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:41:23,755 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:41:23,755 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:41:23,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:41:23 BasicIcfg [2024-06-04 15:41:23,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:41:23,756 INFO L158 Benchmark]: Toolchain (without parser) took 84254.14ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 136.4MB in the beginning and 631.9MB in the end (delta: -495.5MB). Peak memory consumption was 470.1MB. Max. memory is 16.1GB. [2024-06-04 15:41:23,757 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:41:23,757 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:41:23,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.13ms. Allocated memory is still 174.1MB. Free memory was 135.7MB in the beginning and 86.1MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-04 15:41:23,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.67ms. Allocated memory is still 174.1MB. Free memory was 86.1MB in the beginning and 82.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:41:23,757 INFO L158 Benchmark]: Boogie Preprocessor took 90.98ms. Allocated memory is still 174.1MB. Free memory was 82.6MB in the beginning and 77.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:41:23,758 INFO L158 Benchmark]: RCFGBuilder took 1094.94ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 76.9MB in the beginning and 166.9MB in the end (delta: -90.0MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-06-04 15:41:23,758 INFO L158 Benchmark]: TraceAbstraction took 82349.88ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 166.0MB in the beginning and 631.9MB in the end (delta: -465.9MB). Peak memory consumption was 462.0MB. Max. memory is 16.1GB. [2024-06-04 15:41:23,768 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.13ms. Allocated memory is still 174.1MB. Free memory was 135.7MB in the beginning and 86.1MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.67ms. Allocated memory is still 174.1MB. Free memory was 86.1MB in the beginning and 82.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.98ms. Allocated memory is still 174.1MB. Free memory was 82.6MB in the beginning and 77.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.94ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 76.9MB in the beginning and 166.9MB in the end (delta: -90.0MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 82349.88ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 166.0MB in the beginning and 631.9MB in the end (delta: -465.9MB). Peak memory consumption was 462.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 865]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L860] 0 //@ ghost multithreaded = 1; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2257=6, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2258; [L862] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_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 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2257=6, t2258=7, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 pthread_t t2259; [L864] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_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 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2257=6, t2258=7, t2259=8, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 \read(x) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_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 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2257=6, t2258=7, t2259=8, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 862]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 82.2s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1329 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 346 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7005 IncrementalHoareTripleChecker+Invalid, 7096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 96 mSDtfsCounter, 7005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 27.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2591occurred in iteration=32, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 55.3s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 41688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-04 15:41:23,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE