./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe015_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe015_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 20:09:28,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:09:28,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:09:28,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:09:28,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:09:28,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:09:28,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:09:28,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:09:28,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:09:28,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:09:28,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:09:28,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:09:28,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:09:28,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:09:28,849 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:09:28,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:09:28,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:09:28,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:09:28,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:09:28,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:09:28,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:09:28,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:09:28,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:09:28,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:09:28,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:09:28,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:09:28,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:09:28,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:09:28,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:09:28,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:09:28,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:09:28,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:09:28,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:09:28,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:09:28,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:09:28,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:09:28,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:09:28,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:09:28,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:09:28,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:09:28,856 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:09:28,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:09:28,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:09:28,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 20:09:29,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:09:29,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:09:29,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:09:29,084 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:09:29,085 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:09:29,086 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/safe015_power.opt.yml/witness.yml [2024-06-03 20:09:29,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:09:29,341 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:09:29,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2024-06-03 20:09:30,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:09:30,572 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:09:30,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2024-06-03 20:09:30,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee73018c5/39917aa5b25b466fb966daab62c23c20/FLAGec1b02c89 [2024-06-03 20:09:30,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee73018c5/39917aa5b25b466fb966daab62c23c20 [2024-06-03 20:09:30,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:09:30,608 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:09:30,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:09:30,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:09:30,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:09:30,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:09:29" (1/2) ... [2024-06-03 20:09:30,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c74c310 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:30, skipping insertion in model container [2024-06-03 20:09:30,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:09:29" (1/2) ... [2024-06-03 20:09:30,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60de8a52 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:30, skipping insertion in model container [2024-06-03 20:09:30,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:09:30" (2/2) ... [2024-06-03 20:09:30,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c74c310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:30, skipping insertion in model container [2024-06-03 20:09:30,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:09:30" (2/2) ... [2024-06-03 20:09:30,617 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:09:30,743 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:09:30,744 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2))) [2024-06-03 20:09:30,744 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2))) [2024-06-03 20:09:30,744 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2))) [2024-06-03 20:09:30,745 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:09:30,745 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-03 20:09:30,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:09:31,114 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:09:31,125 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:09:31,281 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:09:31,306 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:09:31,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31 WrapperNode [2024-06-03 20:09:31,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:09:31,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:09:31,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:09:31,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:09:31,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,374 INFO L138 Inliner]: procedures = 175, calls = 111, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2024-06-03 20:09:31,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:09:31,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:09:31,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:09:31,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:09:31,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,447 INFO L175 MemorySlicer]: Split 68 memory accesses to 2 slices as follows [2, 66]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-06-03 20:09:31,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:09:31,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:09:31,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:09:31,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:09:31,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (1/1) ... [2024-06-03 20:09:31,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:09:31,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:09:31,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 20:09:31,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 20:09:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:09:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:09:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:09:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:09:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:09:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:09:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:09:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:09:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:09:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:09:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:09:31,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:09:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:09:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:09:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:09:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:09:31,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:09:31,550 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:09:31,691 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:09:31,694 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:09:32,130 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:09:32,130 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:09:32,601 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:09:32,601 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:09:32,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:09:32 BoogieIcfgContainer [2024-06-03 20:09:32,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:09:32,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:09:32,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:09:32,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:09:32,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:09:29" (1/4) ... [2024-06-03 20:09:32,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9817d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:09:32, skipping insertion in model container [2024-06-03 20:09:32,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:09:30" (2/4) ... [2024-06-03 20:09:32,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9817d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:09:32, skipping insertion in model container [2024-06-03 20:09:32,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:31" (3/4) ... [2024-06-03 20:09:32,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9817d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:09:32, skipping insertion in model container [2024-06-03 20:09:32,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:09:32" (4/4) ... [2024-06-03 20:09:32,608 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2024-06-03 20:09:32,622 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:09:32,622 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:09:32,623 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:09:32,677 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:09:32,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 20:09:32,738 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-03 20:09:32,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:09:32,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:09:32,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 20:09:32,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-03 20:09:32,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:09:32,836 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;@7a4634af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:09:32,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:09:32,841 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:09:32,841 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:09:32,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:09:32,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:32,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:09:32,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:09:32,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash 369422667, now seen corresponding path program 1 times [2024-06-03 20:09:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060080095] [2024-06-03 20:09:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060080095] [2024-06-03 20:09:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060080095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:09:35,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926877332] [2024-06-03 20:09:35,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:35,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:09:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:09:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:09:35,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:35,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:35,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:35,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:35,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:36,081 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-03 20:09:36,081 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 20:09:36,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 1364 events. 871/1364 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6190 event pairs, 498 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 2769. Up to 1333 conditions per place. [2024-06-03 20:09:36,093 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 30 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 20:09:36,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow [2024-06-03 20:09:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:09:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:09:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-06-03 20:09:36,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 20:09:36,106 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 78 transitions. [2024-06-03 20:09:36,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow [2024-06-03 20:09:36,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:09:36,111 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 119 flow [2024-06-03 20:09:36,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-03 20:09:36,115 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-03 20:09:36,115 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 119 flow [2024-06-03 20:09:36,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:36,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:36,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:36,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:09:36,116 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-03 20:09:36,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1467060758, now seen corresponding path program 1 times [2024-06-03 20:09:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838345010] [2024-06-03 20:09:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838345010] [2024-06-03 20:09:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838345010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:09:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681419779] [2024-06-03 20:09:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:38,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:09:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:38,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:09:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:09:38,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:38,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 119 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-03 20:09:38,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:38,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:38,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:38,999 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-03 20:09:39,000 INFO L125 PetriNetUnfolderBase]: For 207/209 co-relation queries the response was YES. [2024-06-03 20:09:39,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1366 events. 873/1366 cut-off events. For 207/209 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6331 event pairs, 316 based on Foata normal form. 2/1362 useless extension candidates. Maximal degree in co-relation 3036. Up to 1301 conditions per place. [2024-06-03 20:09:39,008 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-03 20:09:39,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 267 flow [2024-06-03 20:09:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:09:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:09:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-03 20:09:39,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-03 20:09:39,010 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 119 flow. Second operand 5 states and 96 transitions. [2024-06-03 20:09:39,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 267 flow [2024-06-03 20:09:39,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:09:39,012 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 199 flow [2024-06-03 20:09:39,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-03 20:09:39,013 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-03 20:09:39,013 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 199 flow [2024-06-03 20:09:39,014 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-03 20:09:39,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:39,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:39,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:09:39,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:09:39,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:39,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1465958708, now seen corresponding path program 2 times [2024-06-03 20:09:39,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116613892] [2024-06-03 20:09:39,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116613892] [2024-06-03 20:09:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116613892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:09:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404131357] [2024-06-03 20:09:40,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:40,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:09:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:40,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:09:40,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:09:40,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:40,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 199 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-03 20:09:40,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:40,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:40,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:41,141 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-03 20:09:41,142 INFO L125 PetriNetUnfolderBase]: For 529/531 co-relation queries the response was YES. [2024-06-03 20:09:41,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1364 events. 871/1364 cut-off events. For 529/531 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6246 event pairs, 351 based on Foata normal form. 4/1368 useless extension candidates. Maximal degree in co-relation 3306. Up to 1300 conditions per place. [2024-06-03 20:09:41,149 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-06-03 20:09:41,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 335 flow [2024-06-03 20:09:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:09:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:09:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-03 20:09:41,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-03 20:09:41,151 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 199 flow. Second operand 5 states and 101 transitions. [2024-06-03 20:09:41,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 335 flow [2024-06-03 20:09:41,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 20:09:41,154 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 220 flow [2024-06-03 20:09:41,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-03 20:09:41,155 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-03 20:09:41,155 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 220 flow [2024-06-03 20:09:41,156 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-03 20:09:41,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:41,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:41,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:09:41,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:09:41,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1765511692, now seen corresponding path program 1 times [2024-06-03 20:09:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73456735] [2024-06-03 20:09:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:42,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:42,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73456735] [2024-06-03 20:09:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73456735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:09:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192259393] [2024-06-03 20:09:42,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:42,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:09:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:42,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:09:42,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:09:42,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:42,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:42,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:42,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:42,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:43,366 INFO L124 PetriNetUnfolderBase]: 923/1444 cut-off events. [2024-06-03 20:09:43,366 INFO L125 PetriNetUnfolderBase]: For 451/453 co-relation queries the response was YES. [2024-06-03 20:09:43,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 1444 events. 923/1444 cut-off events. For 451/453 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6705 event pairs, 500 based on Foata normal form. 0/1415 useless extension candidates. Maximal degree in co-relation 3420. Up to 1412 conditions per place. [2024-06-03 20:09:43,374 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 39 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2024-06-03 20:09:43,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 367 flow [2024-06-03 20:09:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:09:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:09:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-03 20:09:43,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 20:09:43,376 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 220 flow. Second operand 6 states and 105 transitions. [2024-06-03 20:09:43,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 367 flow [2024-06-03 20:09:43,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 329 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:09:43,379 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 264 flow [2024-06-03 20:09:43,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-03 20:09:43,380 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2024-06-03 20:09:43,380 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 264 flow [2024-06-03 20:09:43,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:43,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:43,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:43,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:09:43,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:09:43,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 123589085, now seen corresponding path program 1 times [2024-06-03 20:09:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:43,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140634809] [2024-06-03 20:09:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:45,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140634809] [2024-06-03 20:09:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140634809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:45,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:45,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:09:45,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860634431] [2024-06-03 20:09:45,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:45,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:09:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:45,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:09:45,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:09:45,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:45,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:45,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:45,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:45,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:46,206 INFO L124 PetriNetUnfolderBase]: 939/1470 cut-off events. [2024-06-03 20:09:46,207 INFO L125 PetriNetUnfolderBase]: For 794/796 co-relation queries the response was YES. [2024-06-03 20:09:46,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 1470 events. 939/1470 cut-off events. For 794/796 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6829 event pairs, 402 based on Foata normal form. 8/1478 useless extension candidates. Maximal degree in co-relation 3752. Up to 1394 conditions per place. [2024-06-03 20:09:46,212 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 46 selfloop transitions, 21 changer transitions 0/74 dead transitions. [2024-06-03 20:09:46,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 470 flow [2024-06-03 20:09:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:09:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:09:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:09:46,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-03 20:09:46,214 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 264 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:09:46,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 470 flow [2024-06-03 20:09:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 466 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 20:09:46,217 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 371 flow [2024-06-03 20:09:46,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-06-03 20:09:46,217 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2024-06-03 20:09:46,218 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 371 flow [2024-06-03 20:09:46,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:46,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:46,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:46,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:09:46,218 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-03 20:09:46,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 144710315, now seen corresponding path program 2 times [2024-06-03 20:09:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962596961] [2024-06-03 20:09:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962596961] [2024-06-03 20:09:48,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962596961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:48,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:09:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950035599] [2024-06-03 20:09:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:48,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:09:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:09:48,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:09:48,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:48,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:48,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:48,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:48,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:49,201 INFO L124 PetriNetUnfolderBase]: 947/1485 cut-off events. [2024-06-03 20:09:49,201 INFO L125 PetriNetUnfolderBase]: For 1692/1694 co-relation queries the response was YES. [2024-06-03 20:09:49,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4340 conditions, 1485 events. 947/1485 cut-off events. For 1692/1694 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6992 event pairs, 340 based on Foata normal form. 8/1492 useless extension candidates. Maximal degree in co-relation 4309. Up to 1397 conditions per place. [2024-06-03 20:09:49,211 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 41 selfloop transitions, 31 changer transitions 0/79 dead transitions. [2024-06-03 20:09:49,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 595 flow [2024-06-03 20:09:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:09:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:09:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 20:09:49,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-03 20:09:49,216 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 371 flow. Second operand 8 states and 141 transitions. [2024-06-03 20:09:49,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 595 flow [2024-06-03 20:09:49,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 560 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 20:09:49,223 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 470 flow [2024-06-03 20:09:49,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=470, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-06-03 20:09:49,226 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-03 20:09:49,226 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 470 flow [2024-06-03 20:09:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:49,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:49,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:49,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:09:49,227 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:09:49,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 145253869, now seen corresponding path program 1 times [2024-06-03 20:09:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071022861] [2024-06-03 20:09:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071022861] [2024-06-03 20:09:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071022861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:51,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:51,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:09:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212122460] [2024-06-03 20:09:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:51,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:09:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:09:51,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:09:51,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:51,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:51,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:51,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:51,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:52,534 INFO L124 PetriNetUnfolderBase]: 949/1488 cut-off events. [2024-06-03 20:09:52,534 INFO L125 PetriNetUnfolderBase]: For 2772/2774 co-relation queries the response was YES. [2024-06-03 20:09:52,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 1488 events. 949/1488 cut-off events. For 2772/2774 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6825 event pairs, 441 based on Foata normal form. 3/1490 useless extension candidates. Maximal degree in co-relation 4709. Up to 1416 conditions per place. [2024-06-03 20:09:52,542 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2024-06-03 20:09:52,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 787 flow [2024-06-03 20:09:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:09:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:09:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:09:52,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-03 20:09:52,544 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 470 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:09:52,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 787 flow [2024-06-03 20:09:52,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 94 transitions, 727 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 20:09:52,548 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 582 flow [2024-06-03 20:09:52,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=582, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2024-06-03 20:09:52,549 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-03 20:09:52,549 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 582 flow [2024-06-03 20:09:52,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:09:52,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:52,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:52,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:09:52,550 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:09:52,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 523855614, now seen corresponding path program 1 times [2024-06-03 20:09:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339806251] [2024-06-03 20:09:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339806251] [2024-06-03 20:09:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339806251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:09:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261960963] [2024-06-03 20:09:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:09:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:09:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:09:55,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:55,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 582 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-03 20:09:55,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:55,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:55,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:09:56,181 INFO L124 PetriNetUnfolderBase]: 935/1476 cut-off events. [2024-06-03 20:09:56,182 INFO L125 PetriNetUnfolderBase]: For 3406/3460 co-relation queries the response was YES. [2024-06-03 20:09:56,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 1476 events. 935/1476 cut-off events. For 3406/3460 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6886 event pairs, 306 based on Foata normal form. 4/1468 useless extension candidates. Maximal degree in co-relation 4974. Up to 1388 conditions per place. [2024-06-03 20:09:56,189 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 63 selfloop transitions, 22 changer transitions 0/92 dead transitions. [2024-06-03 20:09:56,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 794 flow [2024-06-03 20:09:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:09:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:09:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 20:09:56,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-06-03 20:09:56,194 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 582 flow. Second operand 7 states and 118 transitions. [2024-06-03 20:09:56,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 794 flow [2024-06-03 20:09:56,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 756 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-03 20:09:56,199 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 617 flow [2024-06-03 20:09:56,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2024-06-03 20:09:56,202 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-06-03 20:09:56,202 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 617 flow [2024-06-03 20:09:56,202 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-03 20:09:56,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:09:56,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:09:56,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:09:56,203 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-03 20:09:56,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:09:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash -81199814, now seen corresponding path program 2 times [2024-06-03 20:09:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:09:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330088746] [2024-06-03 20:09:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:09:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:09:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:09:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:09:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:09:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330088746] [2024-06-03 20:09:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330088746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:09:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:09:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:09:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302950524] [2024-06-03 20:09:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:09:59,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:09:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:09:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:09:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:09:59,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:09:59,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 617 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-03 20:09:59,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:09:59,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:09:59,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:00,075 INFO L124 PetriNetUnfolderBase]: 937/1483 cut-off events. [2024-06-03 20:10:00,076 INFO L125 PetriNetUnfolderBase]: For 3695/3749 co-relation queries the response was YES. [2024-06-03 20:10:00,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 1483 events. 937/1483 cut-off events. For 3695/3749 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6915 event pairs, 299 based on Foata normal form. 2/1473 useless extension candidates. Maximal degree in co-relation 5058. Up to 1392 conditions per place. [2024-06-03 20:10:00,085 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 76 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2024-06-03 20:10:00,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 109 transitions, 978 flow [2024-06-03 20:10:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:10:00,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:10:00,086 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 617 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:10:00,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 109 transitions, 978 flow [2024-06-03 20:10:00,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 914 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:10:00,092 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 739 flow [2024-06-03 20:10:00,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=739, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2024-06-03 20:10:00,092 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2024-06-03 20:10:00,092 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 739 flow [2024-06-03 20:10:00,093 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-03 20:10:00,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:00,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:00,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:10:00,093 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:00,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 207923278, now seen corresponding path program 1 times [2024-06-03 20:10:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538932536] [2024-06-03 20:10:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:01,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538932536] [2024-06-03 20:10:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538932536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:01,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:10:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458199269] [2024-06-03 20:10:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:01,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:10:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:01,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:10:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:10:01,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:01,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:01,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:01,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:01,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:02,687 INFO L124 PetriNetUnfolderBase]: 948/1490 cut-off events. [2024-06-03 20:10:02,687 INFO L125 PetriNetUnfolderBase]: For 4463/4467 co-relation queries the response was YES. [2024-06-03 20:10:02,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5338 conditions, 1490 events. 948/1490 cut-off events. For 4463/4467 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6855 event pairs, 305 based on Foata normal form. 4/1493 useless extension candidates. Maximal degree in co-relation 5294. Up to 1421 conditions per place. [2024-06-03 20:10:02,695 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 77 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2024-06-03 20:10:02,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 1002 flow [2024-06-03 20:10:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:10:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:10:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 20:10:02,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-03 20:10:02,696 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 739 flow. Second operand 6 states and 110 transitions. [2024-06-03 20:10:02,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 1002 flow [2024-06-03 20:10:02,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 963 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-03 20:10:02,702 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 805 flow [2024-06-03 20:10:02,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=805, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2024-06-03 20:10:02,703 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2024-06-03 20:10:02,703 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 805 flow [2024-06-03 20:10:02,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:02,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:02,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:02,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:10:02,704 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-03 20:10:02,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1198650614, now seen corresponding path program 3 times [2024-06-03 20:10:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831935621] [2024-06-03 20:10:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831935621] [2024-06-03 20:10:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831935621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:10:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856046040] [2024-06-03 20:10:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:10:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:10:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:10:05,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:05,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 805 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-03 20:10:05,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:05,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:05,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:06,156 INFO L124 PetriNetUnfolderBase]: 931/1477 cut-off events. [2024-06-03 20:10:06,156 INFO L125 PetriNetUnfolderBase]: For 4108/4221 co-relation queries the response was YES. [2024-06-03 20:10:06,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 1477 events. 931/1477 cut-off events. For 4108/4221 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6913 event pairs, 300 based on Foata normal form. 2/1474 useless extension candidates. Maximal degree in co-relation 5178. Up to 1390 conditions per place. [2024-06-03 20:10:06,164 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 74 selfloop transitions, 28 changer transitions 0/109 dead transitions. [2024-06-03 20:10:06,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 1060 flow [2024-06-03 20:10:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:10:06,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-03 20:10:06,165 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 805 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:10:06,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 1060 flow [2024-06-03 20:10:06,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 992 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 20:10:06,183 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 836 flow [2024-06-03 20:10:06,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=836, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2024-06-03 20:10:06,183 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-06-03 20:10:06,184 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 836 flow [2024-06-03 20:10:06,184 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-03 20:10:06,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:06,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:06,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:10:06,185 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-03 20:10:06,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash -81160754, now seen corresponding path program 4 times [2024-06-03 20:10:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:06,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192579841] [2024-06-03 20:10:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192579841] [2024-06-03 20:10:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192579841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:10:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068687700] [2024-06-03 20:10:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:09,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:10:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:10:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:10:09,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:09,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 102 transitions, 836 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-03 20:10:09,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:09,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:09,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:10,056 INFO L124 PetriNetUnfolderBase]: 930/1468 cut-off events. [2024-06-03 20:10:10,057 INFO L125 PetriNetUnfolderBase]: For 4173/4233 co-relation queries the response was YES. [2024-06-03 20:10:10,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 1468 events. 930/1468 cut-off events. For 4173/4233 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6887 event pairs, 195 based on Foata normal form. 2/1467 useless extension candidates. Maximal degree in co-relation 5142. Up to 1340 conditions per place. [2024-06-03 20:10:10,065 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 86 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2024-06-03 20:10:10,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 1145 flow [2024-06-03 20:10:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 20:10:10,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-03 20:10:10,067 INFO L175 Difference]: Start difference. First operand has 101 places, 102 transitions, 836 flow. Second operand 7 states and 135 transitions. [2024-06-03 20:10:10,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 1145 flow [2024-06-03 20:10:10,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 121 transitions, 1063 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 20:10:10,075 INFO L231 Difference]: Finished difference. Result has 100 places, 103 transitions, 820 flow [2024-06-03 20:10:10,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=820, PETRI_PLACES=100, PETRI_TRANSITIONS=103} [2024-06-03 20:10:10,077 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-03 20:10:10,077 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 103 transitions, 820 flow [2024-06-03 20:10:10,077 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-03 20:10:10,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:10,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:10,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:10:10,078 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:10,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 190356388, now seen corresponding path program 1 times [2024-06-03 20:10:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909751985] [2024-06-03 20:10:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:10,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:11,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:11,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909751985] [2024-06-03 20:10:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909751985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:11,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:10:11,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965356703] [2024-06-03 20:10:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:11,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:10:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:11,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:10:11,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:10:11,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:11,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 103 transitions, 820 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:11,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:11,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:11,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:12,478 INFO L124 PetriNetUnfolderBase]: 1377/2097 cut-off events. [2024-06-03 20:10:12,479 INFO L125 PetriNetUnfolderBase]: For 5775/5896 co-relation queries the response was YES. [2024-06-03 20:10:12,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 2097 events. 1377/2097 cut-off events. For 5775/5896 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10170 event pairs, 751 based on Foata normal form. 4/2096 useless extension candidates. Maximal degree in co-relation 7120. Up to 2052 conditions per place. [2024-06-03 20:10:12,489 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 93 selfloop transitions, 17 changer transitions 0/116 dead transitions. [2024-06-03 20:10:12,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 1136 flow [2024-06-03 20:10:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:10:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:10:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 20:10:12,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-03 20:10:12,491 INFO L175 Difference]: Start difference. First operand has 100 places, 103 transitions, 820 flow. Second operand 6 states and 106 transitions. [2024-06-03 20:10:12,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 1136 flow [2024-06-03 20:10:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 116 transitions, 1050 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 20:10:12,500 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 881 flow [2024-06-03 20:10:12,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=881, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2024-06-03 20:10:12,502 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-03 20:10:12,502 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 881 flow [2024-06-03 20:10:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:12,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:12,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:10:12,503 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:12,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1943745710, now seen corresponding path program 1 times [2024-06-03 20:10:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334079369] [2024-06-03 20:10:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334079369] [2024-06-03 20:10:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334079369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:14,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434284516] [2024-06-03 20:10:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:14,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:14,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:14,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 881 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:14,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:14,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:15,967 INFO L124 PetriNetUnfolderBase]: 1157/1855 cut-off events. [2024-06-03 20:10:15,967 INFO L125 PetriNetUnfolderBase]: For 5840/5850 co-relation queries the response was YES. [2024-06-03 20:10:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 1855 events. 1157/1855 cut-off events. For 5840/5850 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9321 event pairs, 390 based on Foata normal form. 3/1857 useless extension candidates. Maximal degree in co-relation 6708. Up to 1663 conditions per place. [2024-06-03 20:10:15,976 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 93 selfloop transitions, 52 changer transitions 0/151 dead transitions. [2024-06-03 20:10:15,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 151 transitions, 1432 flow [2024-06-03 20:10:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:10:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:10:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 20:10:15,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 20:10:15,977 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 881 flow. Second operand 8 states and 149 transitions. [2024-06-03 20:10:15,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 151 transitions, 1432 flow [2024-06-03 20:10:15,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1410 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 20:10:15,985 INFO L231 Difference]: Finished difference. Result has 109 places, 129 transitions, 1168 flow [2024-06-03 20:10:15,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1168, PETRI_PLACES=109, PETRI_TRANSITIONS=129} [2024-06-03 20:10:15,986 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-06-03 20:10:15,986 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 129 transitions, 1168 flow [2024-06-03 20:10:15,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:15,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:15,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:15,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:10:15,987 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:15,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2144896436, now seen corresponding path program 2 times [2024-06-03 20:10:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134829645] [2024-06-03 20:10:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134829645] [2024-06-03 20:10:17,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134829645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:17,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:17,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129891439] [2024-06-03 20:10:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:17,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:18,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:18,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 129 transitions, 1168 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:18,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:18,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:18,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:19,805 INFO L124 PetriNetUnfolderBase]: 1130/1808 cut-off events. [2024-06-03 20:10:19,806 INFO L125 PetriNetUnfolderBase]: For 8837/8847 co-relation queries the response was YES. [2024-06-03 20:10:19,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7408 conditions, 1808 events. 1130/1808 cut-off events. For 8837/8847 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9006 event pairs, 378 based on Foata normal form. 3/1809 useless extension candidates. Maximal degree in co-relation 7357. Up to 1608 conditions per place. [2024-06-03 20:10:19,832 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 66 changer transitions 0/167 dead transitions. [2024-06-03 20:10:19,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 167 transitions, 1872 flow [2024-06-03 20:10:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:10:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:10:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-03 20:10:19,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2024-06-03 20:10:19,835 INFO L175 Difference]: Start difference. First operand has 109 places, 129 transitions, 1168 flow. Second operand 9 states and 158 transitions. [2024-06-03 20:10:19,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 167 transitions, 1872 flow [2024-06-03 20:10:19,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1775 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-06-03 20:10:19,850 INFO L231 Difference]: Finished difference. Result has 118 places, 147 transitions, 1475 flow [2024-06-03 20:10:19,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1475, PETRI_PLACES=118, PETRI_TRANSITIONS=147} [2024-06-03 20:10:19,852 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places. [2024-06-03 20:10:19,852 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1475 flow [2024-06-03 20:10:19,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:19,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:19,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:19,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:10:19,853 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:19,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash -591795692, now seen corresponding path program 3 times [2024-06-03 20:10:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348747076] [2024-06-03 20:10:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348747076] [2024-06-03 20:10:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348747076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:21,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:21,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473890357] [2024-06-03 20:10:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:21,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:22,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:22,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1475 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:22,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:22,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:22,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:23,602 INFO L124 PetriNetUnfolderBase]: 1124/1800 cut-off events. [2024-06-03 20:10:23,602 INFO L125 PetriNetUnfolderBase]: For 9580/9590 co-relation queries the response was YES. [2024-06-03 20:10:23,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7537 conditions, 1800 events. 1124/1800 cut-off events. For 9580/9590 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8961 event pairs, 377 based on Foata normal form. 3/1801 useless extension candidates. Maximal degree in co-relation 7482. Up to 1604 conditions per place. [2024-06-03 20:10:23,637 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 101 selfloop transitions, 60 changer transitions 0/167 dead transitions. [2024-06-03 20:10:23,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 167 transitions, 1922 flow [2024-06-03 20:10:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:10:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:10:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 20:10:23,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 20:10:23,639 INFO L175 Difference]: Start difference. First operand has 118 places, 147 transitions, 1475 flow. Second operand 8 states and 144 transitions. [2024-06-03 20:10:23,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 167 transitions, 1922 flow [2024-06-03 20:10:23,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 167 transitions, 1802 flow, removed 59 selfloop flow, removed 1 redundant places. [2024-06-03 20:10:23,657 INFO L231 Difference]: Finished difference. Result has 126 places, 147 transitions, 1489 flow [2024-06-03 20:10:23,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1489, PETRI_PLACES=126, PETRI_TRANSITIONS=147} [2024-06-03 20:10:23,658 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-03 20:10:23,658 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 147 transitions, 1489 flow [2024-06-03 20:10:23,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:23,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:23,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:23,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:10:23,659 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:23,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1500172721, now seen corresponding path program 1 times [2024-06-03 20:10:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280547363] [2024-06-03 20:10:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280547363] [2024-06-03 20:10:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280547363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688184860] [2024-06-03 20:10:25,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:25,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:25,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 147 transitions, 1489 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:25,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:25,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:25,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:26,629 INFO L124 PetriNetUnfolderBase]: 1195/1924 cut-off events. [2024-06-03 20:10:26,629 INFO L125 PetriNetUnfolderBase]: For 10913/10923 co-relation queries the response was YES. [2024-06-03 20:10:26,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8205 conditions, 1924 events. 1195/1924 cut-off events. For 10913/10923 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9743 event pairs, 387 based on Foata normal form. 2/1925 useless extension candidates. Maximal degree in co-relation 8146. Up to 1694 conditions per place. [2024-06-03 20:10:26,662 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 105 selfloop transitions, 69 changer transitions 0/180 dead transitions. [2024-06-03 20:10:26,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 180 transitions, 2120 flow [2024-06-03 20:10:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-03 20:10:26,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-03 20:10:26,665 INFO L175 Difference]: Start difference. First operand has 126 places, 147 transitions, 1489 flow. Second operand 7 states and 136 transitions. [2024-06-03 20:10:26,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 180 transitions, 2120 flow [2024-06-03 20:10:26,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 180 transitions, 1941 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 20:10:26,703 INFO L231 Difference]: Finished difference. Result has 127 places, 158 transitions, 1631 flow [2024-06-03 20:10:26,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1631, PETRI_PLACES=127, PETRI_TRANSITIONS=158} [2024-06-03 20:10:26,704 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places. [2024-06-03 20:10:26,704 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 158 transitions, 1631 flow [2024-06-03 20:10:26,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:26,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:26,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:26,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:10:26,704 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:26,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1749980187, now seen corresponding path program 1 times [2024-06-03 20:10:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750456581] [2024-06-03 20:10:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750456581] [2024-06-03 20:10:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750456581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:28,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:28,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:10:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217469090] [2024-06-03 20:10:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:28,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:10:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:10:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:10:28,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:28,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 158 transitions, 1631 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:28,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:28,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:28,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:29,648 INFO L124 PetriNetUnfolderBase]: 1461/2233 cut-off events. [2024-06-03 20:10:29,648 INFO L125 PetriNetUnfolderBase]: For 11552/11589 co-relation queries the response was YES. [2024-06-03 20:10:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9581 conditions, 2233 events. 1461/2233 cut-off events. For 11552/11589 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10966 event pairs, 718 based on Foata normal form. 8/2235 useless extension candidates. Maximal degree in co-relation 9521. Up to 2129 conditions per place. [2024-06-03 20:10:29,660 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 136 selfloop transitions, 39 changer transitions 0/181 dead transitions. [2024-06-03 20:10:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 181 transitions, 2228 flow [2024-06-03 20:10:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:10:29,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-03 20:10:29,662 INFO L175 Difference]: Start difference. First operand has 127 places, 158 transitions, 1631 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:10:29,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 181 transitions, 2228 flow [2024-06-03 20:10:29,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 181 transitions, 2080 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-03 20:10:29,682 INFO L231 Difference]: Finished difference. Result has 133 places, 172 transitions, 1801 flow [2024-06-03 20:10:29,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1801, PETRI_PLACES=133, PETRI_TRANSITIONS=172} [2024-06-03 20:10:29,682 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-06-03 20:10:29,682 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 172 transitions, 1801 flow [2024-06-03 20:10:29,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:29,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:29,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:29,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:10:29,683 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-03 20:10:29,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2048808241, now seen corresponding path program 2 times [2024-06-03 20:10:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674582957] [2024-06-03 20:10:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674582957] [2024-06-03 20:10:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674582957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176611107] [2024-06-03 20:10:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:31,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:31,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:31,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 172 transitions, 1801 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:31,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:31,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:31,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:32,738 INFO L124 PetriNetUnfolderBase]: 1297/2062 cut-off events. [2024-06-03 20:10:32,739 INFO L125 PetriNetUnfolderBase]: For 14687/14709 co-relation queries the response was YES. [2024-06-03 20:10:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9633 conditions, 2062 events. 1297/2062 cut-off events. For 14687/14709 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10603 event pairs, 492 based on Foata normal form. 12/2010 useless extension candidates. Maximal degree in co-relation 9570. Up to 1800 conditions per place. [2024-06-03 20:10:32,752 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 121 selfloop transitions, 71 changer transitions 0/198 dead transitions. [2024-06-03 20:10:32,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 198 transitions, 2387 flow [2024-06-03 20:10:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:10:32,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:10:32,753 INFO L175 Difference]: Start difference. First operand has 133 places, 172 transitions, 1801 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:10:32,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 198 transitions, 2387 flow [2024-06-03 20:10:32,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 198 transitions, 2312 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 20:10:32,775 INFO L231 Difference]: Finished difference. Result has 138 places, 176 transitions, 1958 flow [2024-06-03 20:10:32,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1958, PETRI_PLACES=138, PETRI_TRANSITIONS=176} [2024-06-03 20:10:32,776 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-03 20:10:32,776 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 176 transitions, 1958 flow [2024-06-03 20:10:32,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:32,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:32,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:32,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:10:32,777 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-03 20:10:32,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2049136531, now seen corresponding path program 3 times [2024-06-03 20:10:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878637533] [2024-06-03 20:10:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878637533] [2024-06-03 20:10:34,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878637533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:34,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332136757] [2024-06-03 20:10:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:34,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:34,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:34,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 176 transitions, 1958 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:34,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:34,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:34,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:35,950 INFO L124 PetriNetUnfolderBase]: 1295/2055 cut-off events. [2024-06-03 20:10:35,950 INFO L125 PetriNetUnfolderBase]: For 15627/15649 co-relation queries the response was YES. [2024-06-03 20:10:35,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9765 conditions, 2055 events. 1295/2055 cut-off events. For 15627/15649 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10565 event pairs, 495 based on Foata normal form. 12/2003 useless extension candidates. Maximal degree in co-relation 9700. Up to 1800 conditions per place. [2024-06-03 20:10:35,963 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 115 selfloop transitions, 74 changer transitions 0/195 dead transitions. [2024-06-03 20:10:35,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 2452 flow [2024-06-03 20:10:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 20:10:35,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-03 20:10:35,964 INFO L175 Difference]: Start difference. First operand has 138 places, 176 transitions, 1958 flow. Second operand 7 states and 127 transitions. [2024-06-03 20:10:35,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 2452 flow [2024-06-03 20:10:35,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 2205 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-03 20:10:35,988 INFO L231 Difference]: Finished difference. Result has 139 places, 178 transitions, 1899 flow [2024-06-03 20:10:35,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1899, PETRI_PLACES=139, PETRI_TRANSITIONS=178} [2024-06-03 20:10:35,989 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-06-03 20:10:35,989 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 178 transitions, 1899 flow [2024-06-03 20:10:35,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:35,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:35,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:35,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:10:35,990 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:35,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1767889197, now seen corresponding path program 2 times [2024-06-03 20:10:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65603444] [2024-06-03 20:10:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:37,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65603444] [2024-06-03 20:10:37,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65603444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:37,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:37,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:10:37,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985155362] [2024-06-03 20:10:37,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:37,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:10:37,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:37,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:10:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:10:37,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:37,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 178 transitions, 1899 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:37,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:37,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:37,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:39,007 INFO L124 PetriNetUnfolderBase]: 1471/2252 cut-off events. [2024-06-03 20:10:39,007 INFO L125 PetriNetUnfolderBase]: For 14455/14466 co-relation queries the response was YES. [2024-06-03 20:10:39,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10509 conditions, 2252 events. 1471/2252 cut-off events. For 14455/14466 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11063 event pairs, 719 based on Foata normal form. 11/2255 useless extension candidates. Maximal degree in co-relation 10444. Up to 2134 conditions per place. [2024-06-03 20:10:39,020 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 60 changer transitions 0/208 dead transitions. [2024-06-03 20:10:39,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 208 transitions, 2678 flow [2024-06-03 20:10:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:10:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:10:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-03 20:10:39,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-03 20:10:39,021 INFO L175 Difference]: Start difference. First operand has 139 places, 178 transitions, 1899 flow. Second operand 8 states and 142 transitions. [2024-06-03 20:10:39,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 208 transitions, 2678 flow [2024-06-03 20:10:39,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 208 transitions, 2531 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 20:10:39,044 INFO L231 Difference]: Finished difference. Result has 144 places, 196 transitions, 2193 flow [2024-06-03 20:10:39,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2193, PETRI_PLACES=144, PETRI_TRANSITIONS=196} [2024-06-03 20:10:39,045 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2024-06-03 20:10:39,045 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 196 transitions, 2193 flow [2024-06-03 20:10:39,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:39,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:39,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:39,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:10:39,046 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:39,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1672330769, now seen corresponding path program 1 times [2024-06-03 20:10:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679113653] [2024-06-03 20:10:39,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:40,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:40,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679113653] [2024-06-03 20:10:40,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679113653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:40,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:40,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:10:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275777681] [2024-06-03 20:10:40,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:40,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:10:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:10:40,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:10:40,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:40,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 196 transitions, 2193 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:40,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:40,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:40,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:42,010 INFO L124 PetriNetUnfolderBase]: 1474/2261 cut-off events. [2024-06-03 20:10:42,010 INFO L125 PetriNetUnfolderBase]: For 17492/17529 co-relation queries the response was YES. [2024-06-03 20:10:42,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11161 conditions, 2261 events. 1474/2261 cut-off events. For 17492/17529 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11131 event pairs, 681 based on Foata normal form. 3/2257 useless extension candidates. Maximal degree in co-relation 11094. Up to 2157 conditions per place. [2024-06-03 20:10:42,022 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 167 selfloop transitions, 38 changer transitions 0/211 dead transitions. [2024-06-03 20:10:42,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 2721 flow [2024-06-03 20:10:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:10:42,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-03 20:10:42,024 INFO L175 Difference]: Start difference. First operand has 144 places, 196 transitions, 2193 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:10:42,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 2721 flow [2024-06-03 20:10:42,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 211 transitions, 2586 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-03 20:10:42,050 INFO L231 Difference]: Finished difference. Result has 149 places, 203 transitions, 2237 flow [2024-06-03 20:10:42,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2237, PETRI_PLACES=149, PETRI_TRANSITIONS=203} [2024-06-03 20:10:42,050 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-06-03 20:10:42,051 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 203 transitions, 2237 flow [2024-06-03 20:10:42,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:42,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:42,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:10:42,051 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-03 20:10:42,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1701559115, now seen corresponding path program 1 times [2024-06-03 20:10:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312868915] [2024-06-03 20:10:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312868915] [2024-06-03 20:10:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312868915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:10:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56775694] [2024-06-03 20:10:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:44,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:10:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:10:44,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:10:44,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:44,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 203 transitions, 2237 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:44,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:44,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:44,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:45,234 INFO L124 PetriNetUnfolderBase]: 1302/2065 cut-off events. [2024-06-03 20:10:45,234 INFO L125 PetriNetUnfolderBase]: For 18622/18712 co-relation queries the response was YES. [2024-06-03 20:10:45,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10468 conditions, 2065 events. 1302/2065 cut-off events. For 18622/18712 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10574 event pairs, 572 based on Foata normal form. 2/2015 useless extension candidates. Maximal degree in co-relation 10397. Up to 1967 conditions per place. [2024-06-03 20:10:45,247 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 185 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2024-06-03 20:10:45,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 210 transitions, 2696 flow [2024-06-03 20:10:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:10:45,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-03 20:10:45,248 INFO L175 Difference]: Start difference. First operand has 149 places, 203 transitions, 2237 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:10:45,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 210 transitions, 2696 flow [2024-06-03 20:10:45,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 210 transitions, 2644 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-03 20:10:45,276 INFO L231 Difference]: Finished difference. Result has 154 places, 205 transitions, 2258 flow [2024-06-03 20:10:45,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2258, PETRI_PLACES=154, PETRI_TRANSITIONS=205} [2024-06-03 20:10:45,280 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-03 20:10:45,280 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 205 transitions, 2258 flow [2024-06-03 20:10:45,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:45,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:45,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:45,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 20:10:45,281 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-03 20:10:45,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2067001211, now seen corresponding path program 2 times [2024-06-03 20:10:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:45,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459424691] [2024-06-03 20:10:45,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459424691] [2024-06-03 20:10:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459424691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:48,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:10:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083238676] [2024-06-03 20:10:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:10:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:10:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:10:48,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:48,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 205 transitions, 2258 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:48,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:48,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:48,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:49,435 INFO L124 PetriNetUnfolderBase]: 1305/2076 cut-off events. [2024-06-03 20:10:49,435 INFO L125 PetriNetUnfolderBase]: For 19724/19814 co-relation queries the response was YES. [2024-06-03 20:10:49,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10603 conditions, 2076 events. 1305/2076 cut-off events. For 19724/19814 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10668 event pairs, 542 based on Foata normal form. 2/2026 useless extension candidates. Maximal degree in co-relation 10530. Up to 1937 conditions per place. [2024-06-03 20:10:49,449 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 42 changer transitions 0/215 dead transitions. [2024-06-03 20:10:49,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 215 transitions, 2739 flow [2024-06-03 20:10:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:10:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:10:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 20:10:49,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-03 20:10:49,450 INFO L175 Difference]: Start difference. First operand has 154 places, 205 transitions, 2258 flow. Second operand 8 states and 136 transitions. [2024-06-03 20:10:49,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 215 transitions, 2739 flow [2024-06-03 20:10:49,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 215 transitions, 2680 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:10:49,477 INFO L231 Difference]: Finished difference. Result has 157 places, 207 transitions, 2324 flow [2024-06-03 20:10:49,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2324, PETRI_PLACES=157, PETRI_TRANSITIONS=207} [2024-06-03 20:10:49,478 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places. [2024-06-03 20:10:49,478 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 207 transitions, 2324 flow [2024-06-03 20:10:49,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:49,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:49,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:49,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 20:10:49,478 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:10:49,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2048521181, now seen corresponding path program 3 times [2024-06-03 20:10:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852610423] [2024-06-03 20:10:49,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852610423] [2024-06-03 20:10:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852610423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:52,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:52,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:10:52,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297913025] [2024-06-03 20:10:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:10:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:10:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:10:52,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:52,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 207 transitions, 2324 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:52,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:52,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:52,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:53,704 INFO L124 PetriNetUnfolderBase]: 1308/2081 cut-off events. [2024-06-03 20:10:53,705 INFO L125 PetriNetUnfolderBase]: For 21022/21114 co-relation queries the response was YES. [2024-06-03 20:10:53,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10803 conditions, 2081 events. 1308/2081 cut-off events. For 21022/21114 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10693 event pairs, 541 based on Foata normal form. 4/2034 useless extension candidates. Maximal degree in co-relation 10729. Up to 1942 conditions per place. [2024-06-03 20:10:53,720 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 173 selfloop transitions, 38 changer transitions 0/217 dead transitions. [2024-06-03 20:10:53,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 217 transitions, 2811 flow [2024-06-03 20:10:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 20:10:53,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-03 20:10:53,721 INFO L175 Difference]: Start difference. First operand has 157 places, 207 transitions, 2324 flow. Second operand 7 states and 123 transitions. [2024-06-03 20:10:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 217 transitions, 2811 flow [2024-06-03 20:10:53,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 217 transitions, 2704 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 20:10:53,753 INFO L231 Difference]: Finished difference. Result has 158 places, 209 transitions, 2336 flow [2024-06-03 20:10:53,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2336, PETRI_PLACES=158, PETRI_TRANSITIONS=209} [2024-06-03 20:10:53,754 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2024-06-03 20:10:53,754 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 2336 flow [2024-06-03 20:10:53,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:53,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:53,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:53,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 20:10:53,760 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-03 20:10:53,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2048500721, now seen corresponding path program 4 times [2024-06-03 20:10:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770832979] [2024-06-03 20:10:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:10:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:10:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:10:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770832979] [2024-06-03 20:10:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770832979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:10:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:10:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:10:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705108875] [2024-06-03 20:10:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:10:56,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:10:56,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:10:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:10:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:10:56,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:10:56,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 2336 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:56,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:10:56,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:10:56,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:10:57,704 INFO L124 PetriNetUnfolderBase]: 1296/2066 cut-off events. [2024-06-03 20:10:57,704 INFO L125 PetriNetUnfolderBase]: For 21467/21563 co-relation queries the response was YES. [2024-06-03 20:10:57,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10790 conditions, 2066 events. 1296/2066 cut-off events. For 21467/21563 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10598 event pairs, 523 based on Foata normal form. 4/2022 useless extension candidates. Maximal degree in co-relation 10715. Up to 1896 conditions per place. [2024-06-03 20:10:57,715 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 176 selfloop transitions, 42 changer transitions 0/224 dead transitions. [2024-06-03 20:10:57,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 224 transitions, 2895 flow [2024-06-03 20:10:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:10:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:10:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 20:10:57,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 20:10:57,717 INFO L175 Difference]: Start difference. First operand has 158 places, 209 transitions, 2336 flow. Second operand 7 states and 126 transitions. [2024-06-03 20:10:57,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 224 transitions, 2895 flow [2024-06-03 20:10:57,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 224 transitions, 2792 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 20:10:57,746 INFO L231 Difference]: Finished difference. Result has 161 places, 214 transitions, 2423 flow [2024-06-03 20:10:57,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2423, PETRI_PLACES=161, PETRI_TRANSITIONS=214} [2024-06-03 20:10:57,747 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-03 20:10:57,747 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 214 transitions, 2423 flow [2024-06-03 20:10:57,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:10:57,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:10:57,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:57,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 20:10:57,748 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-03 20:10:57,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:10:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1751039581, now seen corresponding path program 1 times [2024-06-03 20:10:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:10:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364037320] [2024-06-03 20:10:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:10:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:10:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:10:57,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:10:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:10:57,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:10:57,842 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:10:57,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:10:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:10:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:10:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:10:57,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:10:57,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:10:57,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 20:10:57,846 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:10:57,851 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:10:57,851 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:10:57,875 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,876 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,876 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,876 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,876 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,876 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,877 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,877 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,877 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,877 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,877 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,877 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,878 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,878 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,878 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,878 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,878 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,879 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,880 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,880 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,880 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,880 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:10:57,884 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:10:57,893 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:10:57,893 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:10:57,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:10:57 BasicIcfg [2024-06-03 20:10:57,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:10:57,894 INFO L158 Benchmark]: Toolchain (without parser) took 87286.20ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 137.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2024-06-03 20:10:57,894 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:10:57,894 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:10:57,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.83ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 82.8MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-06-03 20:10:57,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.54ms. Allocated memory is still 169.9MB. Free memory was 82.8MB in the beginning and 78.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:10:57,895 INFO L158 Benchmark]: Boogie Preprocessor took 112.67ms. Allocated memory is still 169.9MB. Free memory was 78.6MB in the beginning and 136.3MB in the end (delta: -57.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-06-03 20:10:57,895 INFO L158 Benchmark]: RCFGBuilder took 1113.01ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 136.3MB in the beginning and 135.7MB in the end (delta: 595.5kB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2024-06-03 20:10:57,896 INFO L158 Benchmark]: TraceAbstraction took 85290.50ms. Allocated memory was 237.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 135.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-06-03 20:10:57,897 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.14ms. Allocated memory is still 109.1MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.83ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 82.8MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.54ms. Allocated memory is still 169.9MB. Free memory was 82.8MB in the beginning and 78.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.67ms. Allocated memory is still 169.9MB. Free memory was 78.6MB in the beginning and 136.3MB in the end (delta: -57.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.01ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 136.3MB in the beginning and 135.7MB in the end (delta: 595.5kB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * TraceAbstraction took 85290.50ms. Allocated memory was 237.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 135.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 55.9MB. 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: 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: 859]: 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; [L853] 0 pthread_t t2124; 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] [L854] 0 //@ ghost multithreaded = 1; [L854] FCALL, FORK 0 pthread_create(&t2124, ((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, t2124=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t2125; [L856] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))); [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((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, t2124=-2, t2125=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L857] 0 pthread_t t2126; [L858] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))); [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, t2124=-2, t2125=-1, t2126=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] [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] 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)))) [L814] EXPR 3 \read(x) [L814] 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)))) [L814] 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)))) [L815] 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)))) [L816] 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)))) [L817] 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)))) [L818] 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)))) [L819] 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)))) [L820] 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)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=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] [L859] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))); VAL [\old(arg)={0:0}, \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, t2124=-2, t2125=-1, t2126=0, weak$$choice0=1, 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: 856]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 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: 85.1s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1115 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 934 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4746 IncrementalHoareTripleChecker+Invalid, 4862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 72 mSDtfsCounter, 4746 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 30.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2423occurred in iteration=26, InterpolantAutomatonStates: 179, 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.1s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 39811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-03 20:10:57,931 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