./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_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/safe007_power.opt-thin001_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/safe007_power.opt-thin001_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe007_power.opt-thin001_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:06:29,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:06:29,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:06:29,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:06:29,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:06:30,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:06:30,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:06:30,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:06:30,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:06:30,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:06:30,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:06:30,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:06:30,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:06:30,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:06:30,009 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:06:30,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:06:30,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:06:30,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:06:30,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:06:30,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:06:30,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:06:30,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:06:30,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:06:30,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:06:30,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:06:30,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:06:30,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:06:30,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:06:30,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:06:30,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:06:30,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:06:30,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:06:30,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:06:30,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:06:30,013 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:06:30,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:06:30,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:06:30,014 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:06:30,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:06:30,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:06:30,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:06:30,239 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:06:30,239 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:06:30,240 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/safe007_power.opt-thin001_power.opt.yml/witness.yml [2024-06-03 20:06:30,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:06:30,430 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:06:30,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-06-03 20:06:31,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:06:31,643 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:06:31,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-06-03 20:06:31,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be68fb211/a763e98b9576462787ff0c5b6ec6a41f/FLAGa2e8250f9 [2024-06-03 20:06:31,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be68fb211/a763e98b9576462787ff0c5b6ec6a41f [2024-06-03 20:06:31,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:06:31,665 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:06:31,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:06:31,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:06:31,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:06:31,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:06:30" (1/2) ... [2024-06-03 20:06:31,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5ac19e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:06:31, skipping insertion in model container [2024-06-03 20:06:31,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:06:30" (1/2) ... [2024-06-03 20:06:31,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a3b0bf8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:06:31, skipping insertion in model container [2024-06-03 20:06:31,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:06:31" (2/2) ... [2024-06-03 20:06:31,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5ac19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:31, skipping insertion in model container [2024-06-03 20:06:31,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:06:31" (2/2) ... [2024-06-03 20:06:31,675 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:06:31,772 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:06:31,773 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & y) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-03 20:06:31,773 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & y) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-03 20:06:31,773 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & y) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-03 20:06:31,773 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:06:31,774 INFO L106 edCorrectnessWitness]: ghost_update [L851-L851] multithreaded = 1; [2024-06-03 20:06:31,811 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:06:32,082 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:06:32,089 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:06:32,239 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:06:32,271 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:06:32,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32 WrapperNode [2024-06-03 20:06:32,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:06:32,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:06:32,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:06:32,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:06:32,277 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:06:32" (1/1) ... [2024-06-03 20:06:32,291 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:06:32" (1/1) ... [2024-06-03 20:06:32,322 INFO L138 Inliner]: procedures = 175, calls = 84, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 252 [2024-06-03 20:06:32,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:06:32,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:06:32,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:06:32,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:06:32,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,353 INFO L175 MemorySlicer]: Split 42 memory accesses to 2 slices as follows [2, 40]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-03 20:06:32,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:06:32,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:06:32,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:06:32,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:06:32,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (1/1) ... [2024-06-03 20:06:32,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:06:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:06:32,402 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:06:32,411 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:06:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:06:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:06:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:06:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:06:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:06:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:06:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:06:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:06:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:06:32,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:06:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:06:32,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:06:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:06:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:06:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:06:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:06:32,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:06:32,438 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:06:32,590 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:06:32,592 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:06:33,050 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:06:33,050 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:06:33,353 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:06:33,353 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:06:33,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:06:33 BoogieIcfgContainer [2024-06-03 20:06:33,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:06:33,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:06:33,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:06:33,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:06:33,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:06:30" (1/4) ... [2024-06-03 20:06:33,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b766730 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:06:33, skipping insertion in model container [2024-06-03 20:06:33,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:06:31" (2/4) ... [2024-06-03 20:06:33,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b766730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:06:33, skipping insertion in model container [2024-06-03 20:06:33,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:06:32" (3/4) ... [2024-06-03 20:06:33,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b766730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:06:33, skipping insertion in model container [2024-06-03 20:06:33,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:06:33" (4/4) ... [2024-06-03 20:06:33,360 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2024-06-03 20:06:33,373 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:06:33,374 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:06:33,374 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:06:33,431 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:06:33,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 20:06:33,488 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 20:06:33,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:06:33,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:06:33,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 20:06:33,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 20:06:33,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:06:33,571 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;@6ed5a152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:06:33,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:06:33,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:06:33,579 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:06:33,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:06:33,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:33,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:06:33,594 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:06:33,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash -967696099, now seen corresponding path program 1 times [2024-06-03 20:06:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830029774] [2024-06-03 20:06:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:35,821 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:06:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830029774] [2024-06-03 20:06:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830029774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:06:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004703665] [2024-06-03 20:06:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:06:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:06:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:06:35,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:06:35,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:06:35,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:35,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:06:35,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:36,304 INFO L124 PetriNetUnfolderBase]: 557/890 cut-off events. [2024-06-03 20:06:36,304 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-03 20:06:36,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 890 events. 557/890 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3915 event pairs, 292 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1805. Up to 865 conditions per place. [2024-06-03 20:06:36,312 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 20:06:36,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-03 20:06:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:06:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:06:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-06-03 20:06:36,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-03 20:06:36,322 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 80 transitions. [2024-06-03 20:06:36,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-03 20:06:36,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:06:36,325 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-03 20:06:36,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-03 20:06:36,329 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-03 20:06:36,329 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-03 20:06:36,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:06:36,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:36,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:36,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:06:36,330 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:06:36,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash -812498076, now seen corresponding path program 1 times [2024-06-03 20:06:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473007766] [2024-06-03 20:06:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:38,522 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:06:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473007766] [2024-06-03 20:06:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473007766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:38,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:38,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:06:38,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833146688] [2024-06-03 20:06:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:38,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:06:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:38,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:06:38,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:06:38,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:38,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:38,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:38,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:39,205 INFO L124 PetriNetUnfolderBase]: 872/1362 cut-off events. [2024-06-03 20:06:39,205 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-06-03 20:06:39,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3066 conditions, 1362 events. 872/1362 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5928 event pairs, 296 based on Foata normal form. 0/1355 useless extension candidates. Maximal degree in co-relation 3050. Up to 1301 conditions per place. [2024-06-03 20:06:39,212 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 37 selfloop transitions, 15 changer transitions 0/58 dead transitions. [2024-06-03 20:06:39,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 288 flow [2024-06-03 20:06:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:06:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:06:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 20:06:39,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-03 20:06:39,214 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 6 states and 101 transitions. [2024-06-03 20:06:39,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 288 flow [2024-06-03 20:06:39,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:06:39,216 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 230 flow [2024-06-03 20:06:39,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-06-03 20:06:39,217 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-06-03 20:06:39,217 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 230 flow [2024-06-03 20:06:39,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:39,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:39,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:39,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:06:39,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:06:39,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash -803243646, now seen corresponding path program 2 times [2024-06-03 20:06:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129555198] [2024-06-03 20:06:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:06:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129555198] [2024-06-03 20:06:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129555198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:06:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230693913] [2024-06-03 20:06:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:41,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:06:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:41,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:06:41,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:06:41,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:41,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:41,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:41,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:41,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:41,924 INFO L124 PetriNetUnfolderBase]: 873/1364 cut-off events. [2024-06-03 20:06:41,924 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2024-06-03 20:06:41,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1364 events. 873/1364 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5973 event pairs, 297 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 3440. Up to 1302 conditions per place. [2024-06-03 20:06:41,931 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 37 selfloop transitions, 17 changer transitions 0/60 dead transitions. [2024-06-03 20:06:41,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 380 flow [2024-06-03 20:06:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:06:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:06:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-03 20:06:41,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 20:06:41,933 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 230 flow. Second operand 5 states and 90 transitions. [2024-06-03 20:06:41,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 380 flow [2024-06-03 20:06:41,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 378 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-03 20:06:41,936 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 283 flow [2024-06-03 20:06:41,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-03 20:06:41,936 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-03 20:06:41,937 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 283 flow [2024-06-03 20:06:41,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:41,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:41,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:06:41,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:06:41,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash -803232486, now seen corresponding path program 3 times [2024-06-03 20:06:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:41,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706364091] [2024-06-03 20:06:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:43,767 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:06:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:43,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706364091] [2024-06-03 20:06:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706364091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:43,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:06:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563868583] [2024-06-03 20:06:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:43,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:06:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:06:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:06:43,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:43,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:43,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:43,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:43,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:44,220 INFO L124 PetriNetUnfolderBase]: 872/1363 cut-off events. [2024-06-03 20:06:44,220 INFO L125 PetriNetUnfolderBase]: For 631/634 co-relation queries the response was YES. [2024-06-03 20:06:44,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 1363 events. 872/1363 cut-off events. For 631/634 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5949 event pairs, 292 based on Foata normal form. 3/1364 useless extension candidates. Maximal degree in co-relation 3480. Up to 1301 conditions per place. [2024-06-03 20:06:44,228 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2024-06-03 20:06:44,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 445 flow [2024-06-03 20:06:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:06:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:06:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-03 20:06:44,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 20:06:44,230 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 283 flow. Second operand 5 states and 95 transitions. [2024-06-03 20:06:44,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 445 flow [2024-06-03 20:06:44,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 416 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:06:44,235 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 307 flow [2024-06-03 20:06:44,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-03 20:06:44,236 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2024-06-03 20:06:44,237 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 307 flow [2024-06-03 20:06:44,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:44,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:44,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:44,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:06:44,238 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:06:44,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -813136388, now seen corresponding path program 1 times [2024-06-03 20:06:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:44,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069445780] [2024-06-03 20:06:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:45,507 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:06:45,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:45,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069445780] [2024-06-03 20:06:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069445780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:45,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:06:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208018517] [2024-06-03 20:06:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:45,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:06:45,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:45,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:06:45,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:06:45,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:06:45,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:06:45,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:45,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:06:45,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:46,174 INFO L124 PetriNetUnfolderBase]: 768/1275 cut-off events. [2024-06-03 20:06:46,175 INFO L125 PetriNetUnfolderBase]: For 585/594 co-relation queries the response was YES. [2024-06-03 20:06:46,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3194 conditions, 1275 events. 768/1275 cut-off events. For 585/594 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5856 event pairs, 311 based on Foata normal form. 5/1239 useless extension candidates. Maximal degree in co-relation 3168. Up to 1215 conditions per place. [2024-06-03 20:06:46,182 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 37 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2024-06-03 20:06:46,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 443 flow [2024-06-03 20:06:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:06:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:06:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-03 20:06:46,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-03 20:06:46,187 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 307 flow. Second operand 5 states and 92 transitions. [2024-06-03 20:06:46,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 443 flow [2024-06-03 20:06:46,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 420 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 20:06:46,194 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 357 flow [2024-06-03 20:06:46,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-06-03 20:06:46,196 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-03 20:06:46,196 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 357 flow [2024-06-03 20:06:46,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:06:46,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:46,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:46,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:06:46,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:06:46,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1177020673, now seen corresponding path program 1 times [2024-06-03 20:06:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803757202] [2024-06-03 20:06:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:48,382 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:06:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803757202] [2024-06-03 20:06:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803757202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:48,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:06:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303471947] [2024-06-03 20:06:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:48,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:06:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:06:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:06:48,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:48,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 357 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:48,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:48,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:48,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:48,989 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-03 20:06:48,989 INFO L125 PetriNetUnfolderBase]: For 766/789 co-relation queries the response was YES. [2024-06-03 20:06:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3649 conditions, 1366 events. 873/1366 cut-off events. For 766/789 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5969 event pairs, 295 based on Foata normal form. 4/1366 useless extension candidates. Maximal degree in co-relation 3619. Up to 1301 conditions per place. [2024-06-03 20:06:48,996 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 44 selfloop transitions, 19 changer transitions 0/69 dead transitions. [2024-06-03 20:06:48,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 525 flow [2024-06-03 20:06:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:06:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:06:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-03 20:06:48,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 20:06:48,998 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 357 flow. Second operand 6 states and 100 transitions. [2024-06-03 20:06:48,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 525 flow [2024-06-03 20:06:48,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:06:49,000 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 395 flow [2024-06-03 20:06:49,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-03 20:06:49,001 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-03 20:06:49,001 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 395 flow [2024-06-03 20:06:49,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:49,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:49,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:49,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:06:49,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:06:49,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1187745433, now seen corresponding path program 2 times [2024-06-03 20:06:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93929096] [2024-06-03 20:06:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:51,084 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:06:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93929096] [2024-06-03 20:06:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93929096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:51,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:06:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707836579] [2024-06-03 20:06:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:06:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:06:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:06:51,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:51,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:51,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:51,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:51,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:51,688 INFO L124 PetriNetUnfolderBase]: 874/1369 cut-off events. [2024-06-03 20:06:51,688 INFO L125 PetriNetUnfolderBase]: For 912/938 co-relation queries the response was YES. [2024-06-03 20:06:51,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3680 conditions, 1369 events. 874/1369 cut-off events. For 912/938 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5986 event pairs, 293 based on Foata normal form. 6/1373 useless extension candidates. Maximal degree in co-relation 3649. Up to 1305 conditions per place. [2024-06-03 20:06:51,696 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 51 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2024-06-03 20:06:51,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 583 flow [2024-06-03 20:06:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:06:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:06:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 20:06:51,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-03 20:06:51,698 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 395 flow. Second operand 6 states and 106 transitions. [2024-06-03 20:06:51,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 583 flow [2024-06-03 20:06:51,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 544 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 20:06:51,702 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 402 flow [2024-06-03 20:06:51,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-06-03 20:06:51,703 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2024-06-03 20:06:51,703 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 402 flow [2024-06-03 20:06:51,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:51,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:51,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:51,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:06:51,704 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:06:51,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1188133243, now seen corresponding path program 3 times [2024-06-03 20:06:51,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:51,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877446478] [2024-06-03 20:06:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:53,719 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:06:53,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:53,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877446478] [2024-06-03 20:06:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877446478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:53,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:06:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295716971] [2024-06-03 20:06:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:53,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:06:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:06:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:06:53,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:53,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 402 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:53,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:53,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:53,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:54,273 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-03 20:06:54,274 INFO L125 PetriNetUnfolderBase]: For 914/940 co-relation queries the response was YES. [2024-06-03 20:06:54,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1366 events. 873/1366 cut-off events. For 914/940 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5986 event pairs, 186 based on Foata normal form. 6/1370 useless extension candidates. Maximal degree in co-relation 3637. Up to 1266 conditions per place. [2024-06-03 20:06:54,281 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 56 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2024-06-03 20:06:54,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 608 flow [2024-06-03 20:06:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:06:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:06:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 20:06:54,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-03 20:06:54,283 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 402 flow. Second operand 6 states and 110 transitions. [2024-06-03 20:06:54,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 608 flow [2024-06-03 20:06:54,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 556 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 20:06:54,286 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 394 flow [2024-06-03 20:06:54,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-06-03 20:06:54,287 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-03 20:06:54,288 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 394 flow [2024-06-03 20:06:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:06:54,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:54,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:06:54,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:06:54,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2106214085, now seen corresponding path program 1 times [2024-06-03 20:06:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140327761] [2024-06-03 20:06:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:55,856 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:06:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:55,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140327761] [2024-06-03 20:06:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140327761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:55,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:06:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270787675] [2024-06-03 20:06:55,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:55,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:06:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:55,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:06:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:06:55,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:55,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:06:55,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:55,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:55,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:56,721 INFO L124 PetriNetUnfolderBase]: 916/1434 cut-off events. [2024-06-03 20:06:56,722 INFO L125 PetriNetUnfolderBase]: For 1180/1187 co-relation queries the response was YES. [2024-06-03 20:06:56,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 1434 events. 916/1434 cut-off events. For 1180/1187 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6361 event pairs, 309 based on Foata normal form. 4/1410 useless extension candidates. Maximal degree in co-relation 3941. Up to 1372 conditions per place. [2024-06-03 20:06:56,729 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 54 selfloop transitions, 18 changer transitions 0/77 dead transitions. [2024-06-03 20:06:56,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 607 flow [2024-06-03 20:06:56,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:06:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:06:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 20:06:56,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-03 20:06:56,731 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 394 flow. Second operand 6 states and 106 transitions. [2024-06-03 20:06:56,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 607 flow [2024-06-03 20:06:56,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 548 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 20:06:56,735 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 418 flow [2024-06-03 20:06:56,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-06-03 20:06:56,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-03 20:06:56,736 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 418 flow [2024-06-03 20:06:56,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:06:56,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:56,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:56,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:06:56,739 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:06:56,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2106207575, now seen corresponding path program 2 times [2024-06-03 20:06:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:56,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121054299] [2024-06-03 20:06:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:06:58,298 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:06:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:06:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121054299] [2024-06-03 20:06:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121054299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:06:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:06:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:06:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869738594] [2024-06-03 20:06:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:06:58,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:06:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:06:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:06:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:06:58,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:06:58,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 418 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:06:58,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:06:58,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:06:58,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:06:59,150 INFO L124 PetriNetUnfolderBase]: 914/1431 cut-off events. [2024-06-03 20:06:59,151 INFO L125 PetriNetUnfolderBase]: For 1247/1249 co-relation queries the response was YES. [2024-06-03 20:06:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 1431 events. 914/1431 cut-off events. For 1247/1249 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6330 event pairs, 311 based on Foata normal form. 0/1402 useless extension candidates. Maximal degree in co-relation 3983. Up to 1370 conditions per place. [2024-06-03 20:06:59,162 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 21 changer transitions 0/77 dead transitions. [2024-06-03 20:06:59,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 627 flow [2024-06-03 20:06:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:06:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:06:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-03 20:06:59,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 20:06:59,164 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 418 flow. Second operand 6 states and 100 transitions. [2024-06-03 20:06:59,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 627 flow [2024-06-03 20:06:59,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 599 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:06:59,168 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 513 flow [2024-06-03 20:06:59,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-06-03 20:06:59,169 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-03 20:06:59,169 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 513 flow [2024-06-03 20:06:59,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:06:59,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:06:59,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:06:59,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:06:59,170 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:06:59,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:06:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -519341369, now seen corresponding path program 1 times [2024-06-03 20:06:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:06:59,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513207250] [2024-06-03 20:06:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:06:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:06:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:01,002 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:07:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513207250] [2024-06-03 20:07:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513207250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:01,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:07:01,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392400852] [2024-06-03 20:07:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:01,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:07:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:07:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:07:01,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:01,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 513 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:07:01,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:01,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:01,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:01,864 INFO L124 PetriNetUnfolderBase]: 829/1356 cut-off events. [2024-06-03 20:07:01,864 INFO L125 PetriNetUnfolderBase]: For 1346/1365 co-relation queries the response was YES. [2024-06-03 20:07:01,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 1356 events. 829/1356 cut-off events. For 1346/1365 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6124 event pairs, 306 based on Foata normal form. 14/1341 useless extension candidates. Maximal degree in co-relation 3863. Up to 1291 conditions per place. [2024-06-03 20:07:01,871 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 52 selfloop transitions, 23 changer transitions 0/82 dead transitions. [2024-06-03 20:07:01,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 713 flow [2024-06-03 20:07:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:07:01,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 20:07:01,872 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 513 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:07:01,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 713 flow [2024-06-03 20:07:01,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 693 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 20:07:01,878 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 589 flow [2024-06-03 20:07:01,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=589, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2024-06-03 20:07:01,879 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2024-06-03 20:07:01,879 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 589 flow [2024-06-03 20:07:01,879 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:07:01,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:01,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:01,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:07:01,880 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:01,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -529725823, now seen corresponding path program 1 times [2024-06-03 20:07:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416775920] [2024-06-03 20:07:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:07:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:03,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416775920] [2024-06-03 20:07:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416775920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:03,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:07:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713633824] [2024-06-03 20:07:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:03,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:07:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:07:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:07:03,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 20:07:03,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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:07:03,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:03,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 20:07:03,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:03,946 INFO L124 PetriNetUnfolderBase]: 1138/1827 cut-off events. [2024-06-03 20:07:03,946 INFO L125 PetriNetUnfolderBase]: For 2205/2265 co-relation queries the response was YES. [2024-06-03 20:07:03,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5155 conditions, 1827 events. 1138/1827 cut-off events. For 2205/2265 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8543 event pairs, 719 based on Foata normal form. 9/1820 useless extension candidates. Maximal degree in co-relation 5119. Up to 1743 conditions per place. [2024-06-03 20:07:03,956 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 52 selfloop transitions, 20 changer transitions 0/86 dead transitions. [2024-06-03 20:07:03,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 804 flow [2024-06-03 20:07:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:07:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:07:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-03 20:07:03,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-03 20:07:03,961 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 589 flow. Second operand 5 states and 93 transitions. [2024-06-03 20:07:03,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 804 flow [2024-06-03 20:07:03,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 742 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 20:07:03,966 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 654 flow [2024-06-03 20:07:03,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=654, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2024-06-03 20:07:03,966 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-03 20:07:03,967 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 654 flow [2024-06-03 20:07:03,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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:07:03,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:03,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:03,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:07:03,968 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:03,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:03,969 INFO L85 PathProgramCache]: Analyzing trace with hash -518995409, now seen corresponding path program 2 times [2024-06-03 20:07:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:03,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647434201] [2024-06-03 20:07:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:07:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647434201] [2024-06-03 20:07:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647434201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:07:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263939176] [2024-06-03 20:07:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:07:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:07:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:07:05,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:05,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 654 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:07:05,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:05,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:05,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:06,367 INFO L124 PetriNetUnfolderBase]: 835/1391 cut-off events. [2024-06-03 20:07:06,367 INFO L125 PetriNetUnfolderBase]: For 2016/2040 co-relation queries the response was YES. [2024-06-03 20:07:06,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 1391 events. 835/1391 cut-off events. For 2016/2040 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6542 event pairs, 461 based on Foata normal form. 11/1377 useless extension candidates. Maximal degree in co-relation 4388. Up to 1297 conditions per place. [2024-06-03 20:07:06,375 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-03 20:07:06,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 850 flow [2024-06-03 20:07:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:07:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:07:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-03 20:07:06,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-03 20:07:06,376 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 654 flow. Second operand 6 states and 104 transitions. [2024-06-03 20:07:06,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 850 flow [2024-06-03 20:07:06,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:07:06,380 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 730 flow [2024-06-03 20:07:06,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=730, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2024-06-03 20:07:06,381 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-03 20:07:06,381 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 730 flow [2024-06-03 20:07:06,381 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:07:06,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:06,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:06,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:07:06,382 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:07:06,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -518983319, now seen corresponding path program 3 times [2024-06-03 20:07:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73784175] [2024-06-03 20:07:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:08,145 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:07:08,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:08,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73784175] [2024-06-03 20:07:08,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73784175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:08,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:08,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:07:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698460610] [2024-06-03 20:07:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:08,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:07:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:07:08,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:07:08,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:08,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 730 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:07:08,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:08,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:08,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:08,860 INFO L124 PetriNetUnfolderBase]: 835/1386 cut-off events. [2024-06-03 20:07:08,860 INFO L125 PetriNetUnfolderBase]: For 2721/2745 co-relation queries the response was YES. [2024-06-03 20:07:08,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 1386 events. 835/1386 cut-off events. For 2721/2745 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6508 event pairs, 433 based on Foata normal form. 11/1374 useless extension candidates. Maximal degree in co-relation 4638. Up to 1279 conditions per place. [2024-06-03 20:07:08,869 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 31 changer transitions 0/105 dead transitions. [2024-06-03 20:07:08,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 105 transitions, 1050 flow [2024-06-03 20:07:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-03 20:07:08,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-03 20:07:08,870 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 730 flow. Second operand 7 states and 121 transitions. [2024-06-03 20:07:08,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 105 transitions, 1050 flow [2024-06-03 20:07:08,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 958 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 20:07:08,877 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 835 flow [2024-06-03 20:07:08,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=835, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2024-06-03 20:07:08,878 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-03 20:07:08,878 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 835 flow [2024-06-03 20:07:08,879 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:07:08,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:08,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:08,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:07:08,879 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:07:08,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1091400830, now seen corresponding path program 1 times [2024-06-03 20:07:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049551927] [2024-06-03 20:07:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:11,322 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:07:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049551927] [2024-06-03 20:07:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049551927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:11,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30268011] [2024-06-03 20:07:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:11,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:11,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:11,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:11,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:11,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:11,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 835 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:11,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:11,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:11,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:12,303 INFO L124 PetriNetUnfolderBase]: 832/1383 cut-off events. [2024-06-03 20:07:12,304 INFO L125 PetriNetUnfolderBase]: For 3389/3419 co-relation queries the response was YES. [2024-06-03 20:07:12,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 1383 events. 832/1383 cut-off events. For 3389/3419 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6500 event pairs, 409 based on Foata normal form. 17/1400 useless extension candidates. Maximal degree in co-relation 4791. Up to 1248 conditions per place. [2024-06-03 20:07:12,312 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 65 selfloop transitions, 42 changer transitions 0/114 dead transitions. [2024-06-03 20:07:12,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 114 transitions, 1143 flow [2024-06-03 20:07:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:07:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:07:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 20:07:12,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-03 20:07:12,313 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 835 flow. Second operand 8 states and 137 transitions. [2024-06-03 20:07:12,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 114 transitions, 1143 flow [2024-06-03 20:07:12,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 1061 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-03 20:07:12,320 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 926 flow [2024-06-03 20:07:12,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=926, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2024-06-03 20:07:12,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-03 20:07:12,321 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 926 flow [2024-06-03 20:07:12,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:12,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:12,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:12,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:07:12,321 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:07:12,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1142420838, now seen corresponding path program 1 times [2024-06-03 20:07:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394839741] [2024-06-03 20:07:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:14,146 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:07:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394839741] [2024-06-03 20:07:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394839741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668762546] [2024-06-03 20:07:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:14,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:14,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:14,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:14,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:14,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 926 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:14,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:14,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:14,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:15,167 INFO L124 PetriNetUnfolderBase]: 933/1482 cut-off events. [2024-06-03 20:07:15,167 INFO L125 PetriNetUnfolderBase]: For 4038/4050 co-relation queries the response was YES. [2024-06-03 20:07:15,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 1482 events. 933/1482 cut-off events. For 4038/4050 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6834 event pairs, 315 based on Foata normal form. 7/1489 useless extension candidates. Maximal degree in co-relation 5325. Up to 1354 conditions per place. [2024-06-03 20:07:15,175 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 91 selfloop transitions, 26 changer transitions 0/122 dead transitions. [2024-06-03 20:07:15,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 122 transitions, 1260 flow [2024-06-03 20:07:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 20:07:15,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-03 20:07:15,189 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 926 flow. Second operand 7 states and 122 transitions. [2024-06-03 20:07:15,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 122 transitions, 1260 flow [2024-06-03 20:07:15,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 122 transitions, 1191 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-03 20:07:15,197 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 956 flow [2024-06-03 20:07:15,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=956, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2024-06-03 20:07:15,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-03 20:07:15,198 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 956 flow [2024-06-03 20:07:15,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:15,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:15,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:07:15,199 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:07:15,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1142181828, now seen corresponding path program 2 times [2024-06-03 20:07:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544004469] [2024-06-03 20:07:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:17,068 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:07:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544004469] [2024-06-03 20:07:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544004469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:17,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626882794] [2024-06-03 20:07:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:17,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:17,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:17,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:17,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:17,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:17,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 956 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:17,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:17,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:17,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:18,138 INFO L124 PetriNetUnfolderBase]: 936/1485 cut-off events. [2024-06-03 20:07:18,138 INFO L125 PetriNetUnfolderBase]: For 4560/4572 co-relation queries the response was YES. [2024-06-03 20:07:18,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1485 events. 936/1485 cut-off events. For 4560/4572 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6850 event pairs, 403 based on Foata normal form. 7/1492 useless extension candidates. Maximal degree in co-relation 5435. Up to 1402 conditions per place. [2024-06-03 20:07:18,145 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 89 selfloop transitions, 25 changer transitions 0/119 dead transitions. [2024-06-03 20:07:18,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 1239 flow [2024-06-03 20:07:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:07:18,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 20:07:18,147 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 956 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:07:18,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 1239 flow [2024-06-03 20:07:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 119 transitions, 1179 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 20:07:18,155 INFO L231 Difference]: Finished difference. Result has 104 places, 111 transitions, 978 flow [2024-06-03 20:07:18,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=978, PETRI_PLACES=104, PETRI_TRANSITIONS=111} [2024-06-03 20:07:18,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-03 20:07:18,155 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 111 transitions, 978 flow [2024-06-03 20:07:18,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:18,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:18,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:18,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:07:18,156 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:18,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1142501934, now seen corresponding path program 1 times [2024-06-03 20:07:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781082584] [2024-06-03 20:07:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:19,915 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:07:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781082584] [2024-06-03 20:07:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781082584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:19,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888004858] [2024-06-03 20:07:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:19,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:20,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:20,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 111 transitions, 978 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:20,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:20,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:20,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:21,041 INFO L124 PetriNetUnfolderBase]: 942/1497 cut-off events. [2024-06-03 20:07:21,041 INFO L125 PetriNetUnfolderBase]: For 4989/5019 co-relation queries the response was YES. [2024-06-03 20:07:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 1497 events. 942/1497 cut-off events. For 4989/5019 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6974 event pairs, 409 based on Foata normal form. 16/1513 useless extension candidates. Maximal degree in co-relation 5522. Up to 1367 conditions per place. [2024-06-03 20:07:21,050 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 39 changer transitions 0/130 dead transitions. [2024-06-03 20:07:21,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 1394 flow [2024-06-03 20:07:21,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 20:07:21,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-03 20:07:21,051 INFO L175 Difference]: Start difference. First operand has 104 places, 111 transitions, 978 flow. Second operand 7 states and 122 transitions. [2024-06-03 20:07:21,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 1394 flow [2024-06-03 20:07:21,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 130 transitions, 1333 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 20:07:21,061 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1128 flow [2024-06-03 20:07:21,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1128, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2024-06-03 20:07:21,062 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-06-03 20:07:21,062 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1128 flow [2024-06-03 20:07:21,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:21,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:21,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:21,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:07:21,063 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:07:21,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1142513094, now seen corresponding path program 2 times [2024-06-03 20:07:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81179142] [2024-06-03 20:07:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:07:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81179142] [2024-06-03 20:07:22,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81179142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:22,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:22,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:22,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148733] [2024-06-03 20:07:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:22,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:22,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:22,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:22,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:22,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1128 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:22,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:22,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:22,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:23,963 INFO L124 PetriNetUnfolderBase]: 957/1523 cut-off events. [2024-06-03 20:07:23,963 INFO L125 PetriNetUnfolderBase]: For 6433/6463 co-relation queries the response was YES. [2024-06-03 20:07:23,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6034 conditions, 1523 events. 957/1523 cut-off events. For 6433/6463 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7136 event pairs, 408 based on Foata normal form. 16/1539 useless extension candidates. Maximal degree in co-relation 5982. Up to 1383 conditions per place. [2024-06-03 20:07:23,972 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 43 changer transitions 0/140 dead transitions. [2024-06-03 20:07:23,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 140 transitions, 1599 flow [2024-06-03 20:07:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:07:23,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 20:07:23,974 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1128 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:07:23,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 140 transitions, 1599 flow [2024-06-03 20:07:23,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 140 transitions, 1511 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-06-03 20:07:23,985 INFO L231 Difference]: Finished difference. Result has 114 places, 128 transitions, 1227 flow [2024-06-03 20:07:23,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1227, PETRI_PLACES=114, PETRI_TRANSITIONS=128} [2024-06-03 20:07:23,986 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-03 20:07:23,986 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 128 transitions, 1227 flow [2024-06-03 20:07:23,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:23,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:23,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:23,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:07:23,987 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:07:23,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1135925718, now seen corresponding path program 3 times [2024-06-03 20:07:23,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796822822] [2024-06-03 20:07:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:25,783 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:07:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796822822] [2024-06-03 20:07:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796822822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92004714] [2024-06-03 20:07:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:25,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:25,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:25,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 128 transitions, 1227 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:25,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:25,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:25,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:26,723 INFO L124 PetriNetUnfolderBase]: 954/1515 cut-off events. [2024-06-03 20:07:26,723 INFO L125 PetriNetUnfolderBase]: For 6352/6358 co-relation queries the response was YES. [2024-06-03 20:07:26,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5979 conditions, 1515 events. 954/1515 cut-off events. For 6352/6358 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7028 event pairs, 400 based on Foata normal form. 2/1516 useless extension candidates. Maximal degree in co-relation 5924. Up to 1428 conditions per place. [2024-06-03 20:07:26,732 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 108 selfloop transitions, 24 changer transitions 0/137 dead transitions. [2024-06-03 20:07:26,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 1549 flow [2024-06-03 20:07:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-03 20:07:26,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 20:07:26,733 INFO L175 Difference]: Start difference. First operand has 114 places, 128 transitions, 1227 flow. Second operand 7 states and 112 transitions. [2024-06-03 20:07:26,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 1549 flow [2024-06-03 20:07:26,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 137 transitions, 1479 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 20:07:26,744 INFO L231 Difference]: Finished difference. Result has 118 places, 130 transitions, 1244 flow [2024-06-03 20:07:26,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1244, PETRI_PLACES=118, PETRI_TRANSITIONS=130} [2024-06-03 20:07:26,745 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-03 20:07:26,745 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 130 transitions, 1244 flow [2024-06-03 20:07:26,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:26,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:26,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:26,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:07:26,745 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:26,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1136048664, now seen corresponding path program 3 times [2024-06-03 20:07:26,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:26,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642475461] [2024-06-03 20:07:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:28,562 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:07:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642475461] [2024-06-03 20:07:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642475461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:28,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227835596] [2024-06-03 20:07:28,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:28,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:28,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:28,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 130 transitions, 1244 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:28,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:28,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:28,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:29,511 INFO L124 PetriNetUnfolderBase]: 956/1517 cut-off events. [2024-06-03 20:07:29,511 INFO L125 PetriNetUnfolderBase]: For 6933/6969 co-relation queries the response was YES. [2024-06-03 20:07:29,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 1517 events. 956/1517 cut-off events. For 6933/6969 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7081 event pairs, 409 based on Foata normal form. 22/1539 useless extension candidates. Maximal degree in co-relation 5953. Up to 1425 conditions per place. [2024-06-03 20:07:29,518 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 105 selfloop transitions, 28 changer transitions 0/138 dead transitions. [2024-06-03 20:07:29,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 1568 flow [2024-06-03 20:07:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 20:07:29,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 20:07:29,520 INFO L175 Difference]: Start difference. First operand has 118 places, 130 transitions, 1244 flow. Second operand 7 states and 113 transitions. [2024-06-03 20:07:29,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 1568 flow [2024-06-03 20:07:29,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 138 transitions, 1501 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:07:29,530 INFO L231 Difference]: Finished difference. Result has 120 places, 133 transitions, 1283 flow [2024-06-03 20:07:29,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1283, PETRI_PLACES=120, PETRI_TRANSITIONS=133} [2024-06-03 20:07:29,530 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2024-06-03 20:07:29,530 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 133 transitions, 1283 flow [2024-06-03 20:07:29,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:29,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:29,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:29,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:07:29,531 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:29,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1135928694, now seen corresponding path program 4 times [2024-06-03 20:07:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704377336] [2024-06-03 20:07:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:31,265 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:07:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704377336] [2024-06-03 20:07:31,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704377336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:31,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:31,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:31,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081685674] [2024-06-03 20:07:31,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:31,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:31,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:31,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:31,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:31,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:31,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 133 transitions, 1283 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:31,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:31,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:31,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:32,359 INFO L124 PetriNetUnfolderBase]: 954/1520 cut-off events. [2024-06-03 20:07:32,360 INFO L125 PetriNetUnfolderBase]: For 7185/7209 co-relation queries the response was YES. [2024-06-03 20:07:32,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6037 conditions, 1520 events. 954/1520 cut-off events. For 7185/7209 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7100 event pairs, 409 based on Foata normal form. 11/1530 useless extension candidates. Maximal degree in co-relation 5980. Up to 1378 conditions per place. [2024-06-03 20:07:32,368 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 55 changer transitions 0/146 dead transitions. [2024-06-03 20:07:32,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 146 transitions, 1725 flow [2024-06-03 20:07:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:07:32,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 20:07:32,369 INFO L175 Difference]: Start difference. First operand has 120 places, 133 transitions, 1283 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:07:32,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 146 transitions, 1725 flow [2024-06-03 20:07:32,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 146 transitions, 1649 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 20:07:32,381 INFO L231 Difference]: Finished difference. Result has 122 places, 139 transitions, 1409 flow [2024-06-03 20:07:32,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1409, PETRI_PLACES=122, PETRI_TRANSITIONS=139} [2024-06-03 20:07:32,382 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2024-06-03 20:07:32,382 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 139 transitions, 1409 flow [2024-06-03 20:07:32,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:32,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:32,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:32,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:07:32,383 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:07:32,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1146225654, now seen corresponding path program 5 times [2024-06-03 20:07:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037823317] [2024-06-03 20:07:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:34,150 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:07:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037823317] [2024-06-03 20:07:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037823317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367620167] [2024-06-03 20:07:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:34,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:34,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:34,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 139 transitions, 1409 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:34,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:34,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:34,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:35,463 INFO L124 PetriNetUnfolderBase]: 952/1515 cut-off events. [2024-06-03 20:07:35,463 INFO L125 PetriNetUnfolderBase]: For 7676/7706 co-relation queries the response was YES. [2024-06-03 20:07:35,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6079 conditions, 1515 events. 952/1515 cut-off events. For 7676/7706 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7080 event pairs, 406 based on Foata normal form. 16/1531 useless extension candidates. Maximal degree in co-relation 6021. Up to 1388 conditions per place. [2024-06-03 20:07:35,471 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 50 changer transitions 0/147 dead transitions. [2024-06-03 20:07:35,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 147 transitions, 1751 flow [2024-06-03 20:07:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:07:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:07:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-03 20:07:35,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-03 20:07:35,472 INFO L175 Difference]: Start difference. First operand has 122 places, 139 transitions, 1409 flow. Second operand 8 states and 134 transitions. [2024-06-03 20:07:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 147 transitions, 1751 flow [2024-06-03 20:07:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 1663 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 20:07:35,484 INFO L231 Difference]: Finished difference. Result has 127 places, 139 transitions, 1435 flow [2024-06-03 20:07:35,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1435, PETRI_PLACES=127, PETRI_TRANSITIONS=139} [2024-06-03 20:07:35,484 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-03 20:07:35,484 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 139 transitions, 1435 flow [2024-06-03 20:07:35,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:35,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:35,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:35,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 20:07:35,485 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:07:35,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1146232164, now seen corresponding path program 6 times [2024-06-03 20:07:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581951574] [2024-06-03 20:07:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:37,247 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:07:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581951574] [2024-06-03 20:07:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581951574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:37,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741531002] [2024-06-03 20:07:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:37,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:37,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:37,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 20:07:37,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 139 transitions, 1435 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:37,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:37,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 20:07:37,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:38,211 INFO L124 PetriNetUnfolderBase]: 950/1512 cut-off events. [2024-06-03 20:07:38,211 INFO L125 PetriNetUnfolderBase]: For 7822/7852 co-relation queries the response was YES. [2024-06-03 20:07:38,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 1512 events. 950/1512 cut-off events. For 7822/7852 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7066 event pairs, 409 based on Foata normal form. 16/1528 useless extension candidates. Maximal degree in co-relation 6044. Up to 1386 conditions per place. [2024-06-03 20:07:38,220 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 98 selfloop transitions, 42 changer transitions 0/145 dead transitions. [2024-06-03 20:07:38,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 1739 flow [2024-06-03 20:07:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:07:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:07:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:07:38,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 20:07:38,220 INFO L175 Difference]: Start difference. First operand has 127 places, 139 transitions, 1435 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:07:38,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 1739 flow [2024-06-03 20:07:38,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 145 transitions, 1601 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 20:07:38,230 INFO L231 Difference]: Finished difference. Result has 125 places, 139 transitions, 1391 flow [2024-06-03 20:07:38,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1391, PETRI_PLACES=125, PETRI_TRANSITIONS=139} [2024-06-03 20:07:38,231 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-03 20:07:38,231 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 1391 flow [2024-06-03 20:07:38,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:38,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:38,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:38,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 20:07:38,231 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:07:38,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -870800762, now seen corresponding path program 1 times [2024-06-03 20:07:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:38,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198925358] [2024-06-03 20:07:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:40,299 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:07:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198925358] [2024-06-03 20:07:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198925358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:40,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607846853] [2024-06-03 20:07:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:40,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:40,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:40,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 139 transitions, 1391 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:07:40,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:40,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:40,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:41,154 INFO L124 PetriNetUnfolderBase]: 856/1420 cut-off events. [2024-06-03 20:07:41,155 INFO L125 PetriNetUnfolderBase]: For 8682/8712 co-relation queries the response was YES. [2024-06-03 20:07:41,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 1420 events. 856/1420 cut-off events. For 8682/8712 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6673 event pairs, 401 based on Foata normal form. 19/1439 useless extension candidates. Maximal degree in co-relation 5802. Up to 1330 conditions per place. [2024-06-03 20:07:41,161 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 107 selfloop transitions, 31 changer transitions 0/145 dead transitions. [2024-06-03 20:07:41,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 1718 flow [2024-06-03 20:07:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:07:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:07:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-03 20:07:41,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-03 20:07:41,162 INFO L175 Difference]: Start difference. First operand has 125 places, 139 transitions, 1391 flow. Second operand 8 states and 130 transitions. [2024-06-03 20:07:41,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 1718 flow [2024-06-03 20:07:41,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 1634 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-03 20:07:41,172 INFO L231 Difference]: Finished difference. Result has 128 places, 141 transitions, 1412 flow [2024-06-03 20:07:41,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=128, PETRI_TRANSITIONS=141} [2024-06-03 20:07:41,173 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-03 20:07:41,173 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 1412 flow [2024-06-03 20:07:41,173 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:07:41,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:41,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:41,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 20:07:41,173 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:07:41,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -538333202, now seen corresponding path program 2 times [2024-06-03 20:07:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:41,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465524161] [2024-06-03 20:07:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:43,202 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:07:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465524161] [2024-06-03 20:07:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465524161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:43,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:43,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820137747] [2024-06-03 20:07:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:43,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:43,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 1412 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:07:43,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:43,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:43,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:43,932 INFO L124 PetriNetUnfolderBase]: 860/1428 cut-off events. [2024-06-03 20:07:43,932 INFO L125 PetriNetUnfolderBase]: For 9660/9690 co-relation queries the response was YES. [2024-06-03 20:07:43,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 1428 events. 860/1428 cut-off events. For 9660/9690 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6712 event pairs, 401 based on Foata normal form. 19/1447 useless extension candidates. Maximal degree in co-relation 5979. Up to 1330 conditions per place. [2024-06-03 20:07:43,940 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 104 selfloop transitions, 36 changer transitions 0/147 dead transitions. [2024-06-03 20:07:43,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 147 transitions, 1747 flow [2024-06-03 20:07:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:07:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:07:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:07:43,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 20:07:43,942 INFO L175 Difference]: Start difference. First operand has 128 places, 141 transitions, 1412 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:07:43,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 147 transitions, 1747 flow [2024-06-03 20:07:43,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 147 transitions, 1658 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-03 20:07:43,953 INFO L231 Difference]: Finished difference. Result has 129 places, 143 transitions, 1445 flow [2024-06-03 20:07:43,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1445, PETRI_PLACES=129, PETRI_TRANSITIONS=143} [2024-06-03 20:07:43,954 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-03 20:07:43,954 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 143 transitions, 1445 flow [2024-06-03 20:07:43,954 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:07:43,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:43,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:43,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 20:07:43,954 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:43,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -526714712, now seen corresponding path program 3 times [2024-06-03 20:07:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887132326] [2024-06-03 20:07:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:46,074 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:07:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:46,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887132326] [2024-06-03 20:07:46,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887132326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:46,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:46,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:07:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625510832] [2024-06-03 20:07:46,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:46,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:07:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:07:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:07:46,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:46,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 143 transitions, 1445 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:07:46,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:46,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:46,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:46,895 INFO L124 PetriNetUnfolderBase]: 864/1440 cut-off events. [2024-06-03 20:07:46,895 INFO L125 PetriNetUnfolderBase]: For 10765/10795 co-relation queries the response was YES. [2024-06-03 20:07:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6211 conditions, 1440 events. 864/1440 cut-off events. For 10765/10795 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6845 event pairs, 397 based on Foata normal form. 19/1459 useless extension candidates. Maximal degree in co-relation 6149. Up to 1324 conditions per place. [2024-06-03 20:07:46,902 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 112 selfloop transitions, 33 changer transitions 0/152 dead transitions. [2024-06-03 20:07:46,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 1811 flow [2024-06-03 20:07:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:07:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:07:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 20:07:46,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-03 20:07:46,903 INFO L175 Difference]: Start difference. First operand has 129 places, 143 transitions, 1445 flow. Second operand 8 states and 133 transitions. [2024-06-03 20:07:46,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 1811 flow [2024-06-03 20:07:46,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 152 transitions, 1701 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-03 20:07:46,916 INFO L231 Difference]: Finished difference. Result has 132 places, 145 transitions, 1456 flow [2024-06-03 20:07:46,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=132, PETRI_TRANSITIONS=145} [2024-06-03 20:07:46,916 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-06-03 20:07:46,917 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 145 transitions, 1456 flow [2024-06-03 20:07:46,917 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:07:46,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:46,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:46,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 20:07:46,917 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:46,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash -526311092, now seen corresponding path program 4 times [2024-06-03 20:07:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680167613] [2024-06-03 20:07:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:49,522 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:07:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680167613] [2024-06-03 20:07:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680167613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:49,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:07:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034334193] [2024-06-03 20:07:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:49,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:07:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:07:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:07:49,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:49,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 145 transitions, 1456 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:07:49,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:49,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:49,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:50,622 INFO L124 PetriNetUnfolderBase]: 868/1450 cut-off events. [2024-06-03 20:07:50,623 INFO L125 PetriNetUnfolderBase]: For 10772/10802 co-relation queries the response was YES. [2024-06-03 20:07:50,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1450 events. 868/1450 cut-off events. For 10772/10802 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6925 event pairs, 395 based on Foata normal form. 19/1469 useless extension candidates. Maximal degree in co-relation 6187. Up to 1302 conditions per place. [2024-06-03 20:07:50,631 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 103 selfloop transitions, 46 changer transitions 0/156 dead transitions. [2024-06-03 20:07:50,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 156 transitions, 1834 flow [2024-06-03 20:07:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:07:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:07:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-03 20:07:50,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 20:07:50,632 INFO L175 Difference]: Start difference. First operand has 132 places, 145 transitions, 1456 flow. Second operand 9 states and 150 transitions. [2024-06-03 20:07:50,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 156 transitions, 1834 flow [2024-06-03 20:07:50,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 156 transitions, 1737 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-03 20:07:50,646 INFO L231 Difference]: Finished difference. Result has 135 places, 147 transitions, 1505 flow [2024-06-03 20:07:50,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1505, PETRI_PLACES=135, PETRI_TRANSITIONS=147} [2024-06-03 20:07:50,647 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-03 20:07:50,647 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 147 transitions, 1505 flow [2024-06-03 20:07:50,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:07:50,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:50,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:50,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 20:07:50,648 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:50,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash -526297142, now seen corresponding path program 5 times [2024-06-03 20:07:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:50,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827456642] [2024-06-03 20:07:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:53,135 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:07:53,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827456642] [2024-06-03 20:07:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827456642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:07:53,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694743138] [2024-06-03 20:07:53,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:53,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:07:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:53,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:07:53,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:07:53,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:07:53,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 147 transitions, 1505 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:07:53,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:53,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:07:53,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:54,070 INFO L124 PetriNetUnfolderBase]: 864/1446 cut-off events. [2024-06-03 20:07:54,070 INFO L125 PetriNetUnfolderBase]: For 10762/10792 co-relation queries the response was YES. [2024-06-03 20:07:54,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6252 conditions, 1446 events. 864/1446 cut-off events. For 10762/10792 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6958 event pairs, 365 based on Foata normal form. 19/1465 useless extension candidates. Maximal degree in co-relation 6188. Up to 1236 conditions per place. [2024-06-03 20:07:54,079 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 111 selfloop transitions, 46 changer transitions 0/164 dead transitions. [2024-06-03 20:07:54,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 1953 flow [2024-06-03 20:07:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:07:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:07:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 20:07:54,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 20:07:54,080 INFO L175 Difference]: Start difference. First operand has 135 places, 147 transitions, 1505 flow. Second operand 8 states and 141 transitions. [2024-06-03 20:07:54,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 1953 flow [2024-06-03 20:07:54,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 164 transitions, 1821 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 20:07:54,096 INFO L231 Difference]: Finished difference. Result has 137 places, 152 transitions, 1577 flow [2024-06-03 20:07:54,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1577, PETRI_PLACES=137, PETRI_TRANSITIONS=152} [2024-06-03 20:07:54,097 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-03 20:07:54,097 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 152 transitions, 1577 flow [2024-06-03 20:07:54,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:07:54,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:54,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:54,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 20:07:54,098 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:54,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:54,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2034655328, now seen corresponding path program 1 times [2024-06-03 20:07:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816595506] [2024-06-03 20:07:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:54,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:07:54,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:07:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:07:54,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:07:54,192 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:07:54,193 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:07:54,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:07:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:07:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:07:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:07:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:07:54,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 20:07:54,196 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-06-03 20:07:54,200 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:07:54,200 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:07:54,235 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,236 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,236 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,237 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,237 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,237 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,237 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,237 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,238 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,239 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:54,242 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:07:54,249 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:07:54,249 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:07:54,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:07:54 BasicIcfg [2024-06-03 20:07:54,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:07:54,250 INFO L158 Benchmark]: Toolchain (without parser) took 82585.30ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 968.9MB). Free memory was 146.4MB in the beginning and 517.1MB in the end (delta: -370.8MB). Peak memory consumption was 597.1MB. Max. memory is 16.1GB. [2024-06-03 20:07:54,250 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 127.9MB. Free memory was 81.5MB in the beginning and 81.3MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:07:54,250 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:07:54,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.33ms. Allocated memory is still 184.5MB. Free memory was 145.3MB in the beginning and 97.0MB in the end (delta: 48.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-03 20:07:54,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 184.5MB. Free memory was 97.0MB in the beginning and 93.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 20:07:54,251 INFO L158 Benchmark]: Boogie Preprocessor took 48.75ms. Allocated memory is still 184.5MB. Free memory was 93.9MB in the beginning and 88.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 20:07:54,251 INFO L158 Benchmark]: RCFGBuilder took 981.99ms. Allocated memory is still 184.5MB. Free memory was 88.7MB in the beginning and 104.1MB in the end (delta: -15.4MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-06-03 20:07:54,251 INFO L158 Benchmark]: TraceAbstraction took 80894.21ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 968.9MB). Free memory was 103.1MB in the beginning and 517.1MB in the end (delta: -414.1MB). Peak memory consumption was 555.9MB. Max. memory is 16.1GB. [2024-06-03 20:07:54,252 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.17ms. Allocated memory is still 127.9MB. Free memory was 81.5MB in the beginning and 81.3MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.33ms. Allocated memory is still 184.5MB. Free memory was 145.3MB in the beginning and 97.0MB in the end (delta: 48.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 184.5MB. Free memory was 97.0MB in the beginning and 93.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.75ms. Allocated memory is still 184.5MB. Free memory was 93.9MB in the beginning and 88.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 981.99ms. Allocated memory is still 184.5MB. Free memory was 88.7MB in the beginning and 104.1MB in the end (delta: -15.4MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * TraceAbstraction took 80894.21ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 968.9MB). Free memory was 103.1MB in the beginning and 517.1MB in the end (delta: -414.1MB). Peak memory consumption was 555.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: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 856]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L851] 0 //@ ghost multithreaded = 1; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, t1940=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t1941; [L853] 0 //@ assert ((((((((((((((((((((((((((((((((((!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (y$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (((0 <= z) && (z <= 1)) && ((z == 0) || (z == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &y)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))); [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, t1940=-1, t1941=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 pthread_t t1942; [L855] 0 //@ assert ((((((((((((((((((((((((((((((((((!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (y$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (((0 <= z) && (z <= 1)) && ((z == 0) || (z == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &y)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))); [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, t1940=-1, t1941=0, t1942=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L856] 0 //@ assert ((((((((((((((((((((((((((((((((((!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (y$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (((0 <= z) && (z <= 1)) && ((z == 0) || (z == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &y)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, t1940=-1, t1941=0, t1942=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] - UnprovableResult [Line: 853]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 80.7s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1525 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1267 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6488 IncrementalHoareTripleChecker+Invalid, 6678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 111 mSDtfsCounter, 6488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 29.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1577occurred in iteration=29, InterpolantAutomatonStates: 191, 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, 54.8s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 39133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:07:54,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE