./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe016_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe016_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 15:38:02,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:38:02,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:38:02,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:38:02,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:38:02,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:38:02,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:38:02,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:38:02,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:38:02,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:38:02,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:38:02,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:38:02,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:38:02,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:38:02,150 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:38:02,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:38:02,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:38:02,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:38:02,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:38:02,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:38:02,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:38:02,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:38:02,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:38:02,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:38:02,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:38:02,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:38:02,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:38:02,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:38:02,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:38:02,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:38:02,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:38:02,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:38:02,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:38:02,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:38:02,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:38:02,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:38:02,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:38:02,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:38:02,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:38:02,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:38:02,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:38:02,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:38:02,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:38:02,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 15:38:02,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:38:02,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:38:02,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:38:02,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:38:02,420 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:38:02,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2024-06-04 15:38:03,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:38:03,873 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:38:03,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2024-06-04 15:38:03,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054751e9d/025c71a387794d4aa7bf9088e8514e98/FLAGa0769f0d3 [2024-06-04 15:38:03,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054751e9d/025c71a387794d4aa7bf9088e8514e98 [2024-06-04 15:38:03,921 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:38:03,922 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:38:03,923 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/safe016_rmo.opt.yml/witness.yml [2024-06-04 15:38:04,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:38:04,181 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:38:04,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:38:04,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:38:04,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:38:04,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:38:03" (1/2) ... [2024-06-04 15:38:04,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a052b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:38:04, skipping insertion in model container [2024-06-04 15:38:04,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:38:03" (1/2) ... [2024-06-04 15:38:04,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73e55647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:38:04, skipping insertion in model container [2024-06-04 15:38:04,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:38:04" (2/2) ... [2024-06-04 15:38:04,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a052b81 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:04, skipping insertion in model container [2024-06-04 15:38:04,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:38:04" (2/2) ... [2024-06-04 15:38:04,191 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:38:04,398 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:38:04,399 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0) [2024-06-04 15:38:04,400 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0) [2024-06-04 15:38:04,400 INFO L97 edCorrectnessWitness]: Location invariant before [L863-L863] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0) [2024-06-04 15:38:04,400 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0) [2024-06-04 15:38:04,400 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:38:04,401 INFO L106 edCorrectnessWitness]: ghost_update [L861-L861] multithreaded = 1; [2024-06-04 15:38:04,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:38:04,767 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:38:04,776 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:38:05,051 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:38:05,103 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:38:05,104 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05 WrapperNode [2024-06-04 15:38:05,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:38:05,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:38:05,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:38:05,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:38:05,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,215 INFO L138 Inliner]: procedures = 176, calls = 122, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 323 [2024-06-04 15:38:05,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:38:05,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:38:05,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:38:05,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:38:05,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,276 INFO L175 MemorySlicer]: Split 76 memory accesses to 2 slices as follows [2, 74]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-06-04 15:38:05,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:38:05,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:38:05,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:38:05,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:38:05,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (1/1) ... [2024-06-04 15:38:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:38:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:38:05,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 15:38:05,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 15:38:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:38:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:38:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:38:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:38:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:38:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:38:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:38:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:38:05,413 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:38:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:38:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:38:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:38:05,414 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-04 15:38:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-04 15:38:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:38:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:38:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:38:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:38:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:38:05,417 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 15:38:05,570 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:38:05,571 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:38:06,295 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:38:06,295 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:38:06,935 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:38:06,935 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:38:06,936 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:38:06 BoogieIcfgContainer [2024-06-04 15:38:06,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:38:06,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:38:06,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:38:06,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:38:06,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:38:03" (1/4) ... [2024-06-04 15:38:06,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9f190c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:38:06, skipping insertion in model container [2024-06-04 15:38:06,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:38:04" (2/4) ... [2024-06-04 15:38:06,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9f190c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:38:06, skipping insertion in model container [2024-06-04 15:38:06,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:38:05" (3/4) ... [2024-06-04 15:38:06,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9f190c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:38:06, skipping insertion in model container [2024-06-04 15:38:06,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:38:06" (4/4) ... [2024-06-04 15:38:06,945 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.opt.i [2024-06-04 15:38:06,962 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:38:06,963 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 15:38:06,963 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:38:07,040 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:38:07,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 116 flow [2024-06-04 15:38:07,104 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2024-06-04 15:38:07,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:38:07,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:38:07,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 50 transitions, 116 flow [2024-06-04 15:38:07,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 92 flow [2024-06-04 15:38:07,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:38:07,124 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;@2b276ae0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:38:07,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 15:38:07,129 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:38:07,130 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:38:07,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:38:07,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:07,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:38:07,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:07,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 379396229, now seen corresponding path program 1 times [2024-06-04 15:38:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:07,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882538204] [2024-06-04 15:38:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:07,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882538204] [2024-06-04 15:38:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882538204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:38:10,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253715245] [2024-06-04 15:38:10,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:10,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:38:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:38:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:38:10,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:38:10,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:10,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:10,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:38:10,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:12,231 INFO L124 PetriNetUnfolderBase]: 5333/7390 cut-off events. [2024-06-04 15:38:12,232 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2024-06-04 15:38:12,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15140 conditions, 7390 events. 5333/7390 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 36633 event pairs, 3573 based on Foata normal form. 0/7385 useless extension candidates. Maximal degree in co-relation 15124. Up to 7367 conditions per place. [2024-06-04 15:38:12,284 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 40 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-04 15:38:12,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 237 flow [2024-06-04 15:38:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:38:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:38:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-04 15:38:12,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448 [2024-06-04 15:38:12,298 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 5 states and 112 transitions. [2024-06-04 15:38:12,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 237 flow [2024-06-04 15:38:12,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 230 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 15:38:12,304 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 157 flow [2024-06-04 15:38:12,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-04 15:38:12,309 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-06-04 15:38:12,309 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 157 flow [2024-06-04 15:38:12,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:12,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:12,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:12,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:38:12,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:12,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1742057576, now seen corresponding path program 1 times [2024-06-04 15:38:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108581701] [2024-06-04 15:38:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:15,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108581701] [2024-06-04 15:38:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108581701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:38:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537994490] [2024-06-04 15:38:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:15,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:38:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:38:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:38:15,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:38:15,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:15,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:15,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:38:15,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:17,083 INFO L124 PetriNetUnfolderBase]: 6566/9102 cut-off events. [2024-06-04 15:38:17,083 INFO L125 PetriNetUnfolderBase]: For 1847/1854 co-relation queries the response was YES. [2024-06-04 15:38:17,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20775 conditions, 9102 events. 6566/9102 cut-off events. For 1847/1854 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 44885 event pairs, 2460 based on Foata normal form. 8/9100 useless extension candidates. Maximal degree in co-relation 20758. Up to 8746 conditions per place. [2024-06-04 15:38:17,148 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 58 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2024-06-04 15:38:17,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 415 flow [2024-06-04 15:38:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:38:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:38:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-06-04 15:38:17,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512 [2024-06-04 15:38:17,154 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 157 flow. Second operand 5 states and 128 transitions. [2024-06-04 15:38:17,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 415 flow [2024-06-04 15:38:17,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 415 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:38:17,162 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 286 flow [2024-06-04 15:38:17,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2024-06-04 15:38:17,163 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2024-06-04 15:38:17,164 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 286 flow [2024-06-04 15:38:17,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:17,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:17,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:38:17,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:17,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1759791317, now seen corresponding path program 1 times [2024-06-04 15:38:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900571693] [2024-06-04 15:38:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900571693] [2024-06-04 15:38:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900571693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:19,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:19,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:38:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686408421] [2024-06-04 15:38:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:38:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:38:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:38:19,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:38:19,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:19,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:19,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:38:19,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:21,261 INFO L124 PetriNetUnfolderBase]: 5488/7613 cut-off events. [2024-06-04 15:38:21,261 INFO L125 PetriNetUnfolderBase]: For 5145/5147 co-relation queries the response was YES. [2024-06-04 15:38:21,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20167 conditions, 7613 events. 5488/7613 cut-off events. For 5145/5147 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 37863 event pairs, 2824 based on Foata normal form. 0/7584 useless extension candidates. Maximal degree in co-relation 20145. Up to 7576 conditions per place. [2024-06-04 15:38:21,320 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 57 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2024-06-04 15:38:21,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 514 flow [2024-06-04 15:38:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:38:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:38:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-06-04 15:38:21,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-04 15:38:21,325 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 286 flow. Second operand 6 states and 129 transitions. [2024-06-04 15:38:21,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 514 flow [2024-06-04 15:38:21,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 81 transitions, 496 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-06-04 15:38:21,338 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 381 flow [2024-06-04 15:38:21,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2024-06-04 15:38:21,340 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2024-06-04 15:38:21,340 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 381 flow [2024-06-04 15:38:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:21,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:21,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:21,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:38:21,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:21,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1208329711, now seen corresponding path program 1 times [2024-06-04 15:38:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381705985] [2024-06-04 15:38:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381705985] [2024-06-04 15:38:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381705985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:38:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889890010] [2024-06-04 15:38:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:25,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:38:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:38:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:38:25,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:38:25,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:25,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:25,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:38:25,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:26,856 INFO L124 PetriNetUnfolderBase]: 6611/9146 cut-off events. [2024-06-04 15:38:26,857 INFO L125 PetriNetUnfolderBase]: For 5918/5934 co-relation queries the response was YES. [2024-06-04 15:38:26,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24074 conditions, 9146 events. 6611/9146 cut-off events. For 5918/5934 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 44931 event pairs, 3129 based on Foata normal form. 14/9150 useless extension candidates. Maximal degree in co-relation 24046. Up to 9084 conditions per place. [2024-06-04 15:38:26,910 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 62 selfloop transitions, 18 changer transitions 0/87 dead transitions. [2024-06-04 15:38:26,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 607 flow [2024-06-04 15:38:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:38:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:38:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 15:38:26,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3725 [2024-06-04 15:38:26,913 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 381 flow. Second operand 8 states and 149 transitions. [2024-06-04 15:38:26,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 607 flow [2024-06-04 15:38:26,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 603 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 15:38:26,920 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 465 flow [2024-06-04 15:38:26,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=465, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2024-06-04 15:38:26,921 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-06-04 15:38:26,921 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 465 flow [2024-06-04 15:38:26,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:26,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:26,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:26,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:38:26,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:26,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash 901189197, now seen corresponding path program 2 times [2024-06-04 15:38:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22194682] [2024-06-04 15:38:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:26,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:30,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:30,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22194682] [2024-06-04 15:38:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22194682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:30,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:30,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:38:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98866412] [2024-06-04 15:38:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:30,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:38:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:38:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:38:30,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:38:30,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:30,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:30,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:38:30,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:31,760 INFO L124 PetriNetUnfolderBase]: 6612/9148 cut-off events. [2024-06-04 15:38:31,760 INFO L125 PetriNetUnfolderBase]: For 6516/6534 co-relation queries the response was YES. [2024-06-04 15:38:31,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24558 conditions, 9148 events. 6612/9148 cut-off events. For 6516/6534 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 44942 event pairs, 3129 based on Foata normal form. 16/9154 useless extension candidates. Maximal degree in co-relation 24527. Up to 9085 conditions per place. [2024-06-04 15:38:31,813 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 62 selfloop transitions, 18 changer transitions 0/87 dead transitions. [2024-06-04 15:38:31,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 87 transitions, 659 flow [2024-06-04 15:38:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:38:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:38:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-04 15:38:31,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-04 15:38:31,815 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 465 flow. Second operand 6 states and 122 transitions. [2024-06-04 15:38:31,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 87 transitions, 659 flow [2024-06-04 15:38:31,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 623 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:38:31,823 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 481 flow [2024-06-04 15:38:31,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-06-04 15:38:31,824 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2024-06-04 15:38:31,824 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 481 flow [2024-06-04 15:38:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:31,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:31,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:31,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:38:31,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:31,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1058841196, now seen corresponding path program 1 times [2024-06-04 15:38:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107983242] [2024-06-04 15:38:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107983242] [2024-06-04 15:38:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107983242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:38:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121758151] [2024-06-04 15:38:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:38:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:38:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:38:34,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:38:34,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:34,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:34,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:38:34,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:36,310 INFO L124 PetriNetUnfolderBase]: 6250/8829 cut-off events. [2024-06-04 15:38:36,311 INFO L125 PetriNetUnfolderBase]: For 6327/6332 co-relation queries the response was YES. [2024-06-04 15:38:36,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23578 conditions, 8829 events. 6250/8829 cut-off events. For 6327/6332 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 44068 event pairs, 2425 based on Foata normal form. 16/8836 useless extension candidates. Maximal degree in co-relation 23546. Up to 8438 conditions per place. [2024-06-04 15:38:36,465 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 71 selfloop transitions, 31 changer transitions 0/111 dead transitions. [2024-06-04 15:38:36,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 812 flow [2024-06-04 15:38:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:38:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:38:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-04 15:38:36,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2024-06-04 15:38:36,466 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 481 flow. Second operand 7 states and 163 transitions. [2024-06-04 15:38:36,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 812 flow [2024-06-04 15:38:36,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 772 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:38:36,475 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 584 flow [2024-06-04 15:38:36,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2024-06-04 15:38:36,478 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2024-06-04 15:38:36,478 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 584 flow [2024-06-04 15:38:36,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:36,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:36,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:36,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:38:36,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:36,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash 920591787, now seen corresponding path program 3 times [2024-06-04 15:38:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827844907] [2024-06-04 15:38:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:36,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827844907] [2024-06-04 15:38:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827844907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:40,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:38:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376658714] [2024-06-04 15:38:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:38:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:38:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:38:40,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:38:40,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 584 flow. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:40,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:40,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:38:40,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:41,661 INFO L124 PetriNetUnfolderBase]: 6627/9207 cut-off events. [2024-06-04 15:38:41,662 INFO L125 PetriNetUnfolderBase]: For 7690/7775 co-relation queries the response was YES. [2024-06-04 15:38:41,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25196 conditions, 9207 events. 6627/9207 cut-off events. For 7690/7775 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 45620 event pairs, 2456 based on Foata normal form. 32/9225 useless extension candidates. Maximal degree in co-relation 25160. Up to 8792 conditions per place. [2024-06-04 15:38:41,711 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 71 selfloop transitions, 32 changer transitions 0/110 dead transitions. [2024-06-04 15:38:41,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 110 transitions, 877 flow [2024-06-04 15:38:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:38:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:38:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-04 15:38:41,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-04 15:38:41,713 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 584 flow. Second operand 6 states and 141 transitions. [2024-06-04 15:38:41,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 110 transitions, 877 flow [2024-06-04 15:38:41,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 811 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-04 15:38:41,727 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 596 flow [2024-06-04 15:38:41,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=596, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2024-06-04 15:38:41,728 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2024-06-04 15:38:41,728 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 596 flow [2024-06-04 15:38:41,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:41,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:41,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:41,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:38:41,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:41,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:41,729 INFO L85 PathProgramCache]: Analyzing trace with hash 920613177, now seen corresponding path program 4 times [2024-06-04 15:38:41,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:41,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506011708] [2024-06-04 15:38:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506011708] [2024-06-04 15:38:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506011708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:45,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:38:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398832403] [2024-06-04 15:38:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:38:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:38:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:38:45,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:38:45,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 596 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:45,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:45,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:38:45,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:46,593 INFO L124 PetriNetUnfolderBase]: 6826/9504 cut-off events. [2024-06-04 15:38:46,593 INFO L125 PetriNetUnfolderBase]: For 8121/8224 co-relation queries the response was YES. [2024-06-04 15:38:46,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26052 conditions, 9504 events. 6826/9504 cut-off events. For 8121/8224 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 47495 event pairs, 1908 based on Foata normal form. 32/9522 useless extension candidates. Maximal degree in co-relation 26016. Up to 8776 conditions per place. [2024-06-04 15:38:46,644 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 83 selfloop transitions, 34 changer transitions 0/124 dead transitions. [2024-06-04 15:38:46,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 124 transitions, 959 flow [2024-06-04 15:38:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:38:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:38:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-06-04 15:38:46,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-04 15:38:46,646 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 596 flow. Second operand 6 states and 153 transitions. [2024-06-04 15:38:46,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 124 transitions, 959 flow [2024-06-04 15:38:46,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 124 transitions, 882 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 15:38:46,693 INFO L231 Difference]: Finished difference. Result has 89 places, 89 transitions, 615 flow [2024-06-04 15:38:46,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2024-06-04 15:38:46,696 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2024-06-04 15:38:46,697 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 615 flow [2024-06-04 15:38:46,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:46,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:46,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:46,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:38:46,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:46,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:46,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2134640412, now seen corresponding path program 1 times [2024-06-04 15:38:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338008692] [2024-06-04 15:38:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338008692] [2024-06-04 15:38:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338008692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:38:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678272561] [2024-06-04 15:38:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:38:48,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:38:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:38:49,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:38:49,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 615 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:49,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:49,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:38:49,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:51,103 INFO L124 PetriNetUnfolderBase]: 6856/9541 cut-off events. [2024-06-04 15:38:51,103 INFO L125 PetriNetUnfolderBase]: For 10733/10770 co-relation queries the response was YES. [2024-06-04 15:38:51,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27089 conditions, 9541 events. 6856/9541 cut-off events. For 10733/10770 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 47705 event pairs, 2336 based on Foata normal form. 40/9571 useless extension candidates. Maximal degree in co-relation 27053. Up to 9139 conditions per place. [2024-06-04 15:38:51,250 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 75 selfloop transitions, 38 changer transitions 0/119 dead transitions. [2024-06-04 15:38:51,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 119 transitions, 978 flow [2024-06-04 15:38:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:38:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:38:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-04 15:38:51,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542857142857143 [2024-06-04 15:38:51,252 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 615 flow. Second operand 7 states and 159 transitions. [2024-06-04 15:38:51,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 119 transitions, 978 flow [2024-06-04 15:38:51,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 119 transitions, 877 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 15:38:51,267 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 703 flow [2024-06-04 15:38:51,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=703, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2024-06-04 15:38:51,268 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-04 15:38:51,268 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 703 flow [2024-06-04 15:38:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:51,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:51,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:51,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:38:51,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1571232054, now seen corresponding path program 1 times [2024-06-04 15:38:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469359105] [2024-06-04 15:38:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:51,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:53,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:53,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469359105] [2024-06-04 15:38:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469359105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:53,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:53,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:38:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850868132] [2024-06-04 15:38:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:53,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:38:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:38:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:38:53,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:38:53,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:53,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:53,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:38:53,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:38:54,947 INFO L124 PetriNetUnfolderBase]: 6897/9736 cut-off events. [2024-06-04 15:38:54,947 INFO L125 PetriNetUnfolderBase]: For 10956/11001 co-relation queries the response was YES. [2024-06-04 15:38:54,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27564 conditions, 9736 events. 6897/9736 cut-off events. For 10956/11001 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 49565 event pairs, 3501 based on Foata normal form. 8/9548 useless extension candidates. Maximal degree in co-relation 27527. Up to 9672 conditions per place. [2024-06-04 15:38:55,004 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 87 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2024-06-04 15:38:55,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 1070 flow [2024-06-04 15:38:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:38:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:38:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-04 15:38:55,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43666666666666665 [2024-06-04 15:38:55,006 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 703 flow. Second operand 6 states and 131 transitions. [2024-06-04 15:38:55,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 1070 flow [2024-06-04 15:38:55,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 117 transitions, 1025 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-04 15:38:55,024 INFO L231 Difference]: Finished difference. Result has 97 places, 109 transitions, 856 flow [2024-06-04 15:38:55,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=97, PETRI_TRANSITIONS=109} [2024-06-04 15:38:55,025 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2024-06-04 15:38:55,025 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 109 transitions, 856 flow [2024-06-04 15:38:55,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:55,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:38:55,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:38:55,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:38:55,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:38:55,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:38:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1448476823, now seen corresponding path program 1 times [2024-06-04 15:38:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:38:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359132977] [2024-06-04 15:38:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:38:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:38:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:38:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:38:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:38:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359132977] [2024-06-04 15:38:58,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359132977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:38:58,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:38:58,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:38:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117468001] [2024-06-04 15:38:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:38:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:38:58,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:38:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:38:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:38:58,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:38:58,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 109 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:38:58,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:38:58,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:38:58,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:39:00,172 INFO L124 PetriNetUnfolderBase]: 6551/9292 cut-off events. [2024-06-04 15:39:00,172 INFO L125 PetriNetUnfolderBase]: For 12633/12642 co-relation queries the response was YES. [2024-06-04 15:39:00,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27255 conditions, 9292 events. 6551/9292 cut-off events. For 12633/12642 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 47221 event pairs, 3240 based on Foata normal form. 38/9328 useless extension candidates. Maximal degree in co-relation 27214. Up to 9142 conditions per place. [2024-06-04 15:39:00,219 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 97 selfloop transitions, 21 changer transitions 0/126 dead transitions. [2024-06-04 15:39:00,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 126 transitions, 1166 flow [2024-06-04 15:39:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:39:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:39:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-04 15:39:00,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4257142857142857 [2024-06-04 15:39:00,220 INFO L175 Difference]: Start difference. First operand has 97 places, 109 transitions, 856 flow. Second operand 7 states and 149 transitions. [2024-06-04 15:39:00,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 126 transitions, 1166 flow [2024-06-04 15:39:00,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 126 transitions, 1154 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-04 15:39:00,238 INFO L231 Difference]: Finished difference. Result has 103 places, 110 transitions, 903 flow [2024-06-04 15:39:00,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=903, PETRI_PLACES=103, PETRI_TRANSITIONS=110} [2024-06-04 15:39:00,238 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2024-06-04 15:39:00,239 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 110 transitions, 903 flow [2024-06-04 15:39:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:00,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:39:00,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:00,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:39:00,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:39:00,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:39:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -360807413, now seen corresponding path program 2 times [2024-06-04 15:39:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:39:00,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620171386] [2024-06-04 15:39:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:39:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:39:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:39:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:39:04,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:39:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620171386] [2024-06-04 15:39:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620171386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:39:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:39:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:39:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83617573] [2024-06-04 15:39:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:39:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:39:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:39:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:39:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:39:04,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:39:04,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 110 transitions, 903 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:04,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:39:04,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:39:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:39:06,574 INFO L124 PetriNetUnfolderBase]: 6623/9437 cut-off events. [2024-06-04 15:39:06,575 INFO L125 PetriNetUnfolderBase]: For 13873/13931 co-relation queries the response was YES. [2024-06-04 15:39:06,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27850 conditions, 9437 events. 6623/9437 cut-off events. For 13873/13931 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 48509 event pairs, 2431 based on Foata normal form. 62/9484 useless extension candidates. Maximal degree in co-relation 27806. Up to 8965 conditions per place. [2024-06-04 15:39:06,636 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 86 selfloop transitions, 45 changer transitions 0/139 dead transitions. [2024-06-04 15:39:06,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 139 transitions, 1264 flow [2024-06-04 15:39:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:39:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:39:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-04 15:39:06,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-04 15:39:06,637 INFO L175 Difference]: Start difference. First operand has 103 places, 110 transitions, 903 flow. Second operand 8 states and 180 transitions. [2024-06-04 15:39:06,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 139 transitions, 1264 flow [2024-06-04 15:39:06,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 1219 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 15:39:06,656 INFO L231 Difference]: Finished difference. Result has 106 places, 111 transitions, 969 flow [2024-06-04 15:39:06,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=106, PETRI_TRANSITIONS=111} [2024-06-04 15:39:06,657 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2024-06-04 15:39:06,657 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 111 transitions, 969 flow [2024-06-04 15:39:06,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:06,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:39:06,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:06,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:39:06,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:39:06,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:39:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash -359616083, now seen corresponding path program 3 times [2024-06-04 15:39:06,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:39:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891430674] [2024-06-04 15:39:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:39:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:39:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:39:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:39:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:39:10,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891430674] [2024-06-04 15:39:10,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891430674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:39:10,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:39:10,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:39:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564889097] [2024-06-04 15:39:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:39:10,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:39:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:39:10,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:39:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:39:10,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:39:10,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 111 transitions, 969 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:10,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:39:10,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:39:10,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:39:12,915 INFO L124 PetriNetUnfolderBase]: 6851/9775 cut-off events. [2024-06-04 15:39:12,915 INFO L125 PetriNetUnfolderBase]: For 16432/16490 co-relation queries the response was YES. [2024-06-04 15:39:12,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29473 conditions, 9775 events. 6851/9775 cut-off events. For 16432/16490 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 50599 event pairs, 2075 based on Foata normal form. 58/9818 useless extension candidates. Maximal degree in co-relation 29428. Up to 8885 conditions per place. [2024-06-04 15:39:12,980 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 104 selfloop transitions, 48 changer transitions 0/160 dead transitions. [2024-06-04 15:39:12,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 160 transitions, 1497 flow [2024-06-04 15:39:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:39:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:39:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-04 15:39:12,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-04 15:39:12,982 INFO L175 Difference]: Start difference. First operand has 106 places, 111 transitions, 969 flow. Second operand 8 states and 192 transitions. [2024-06-04 15:39:12,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 160 transitions, 1497 flow [2024-06-04 15:39:13,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 1395 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 15:39:13,009 INFO L231 Difference]: Finished difference. Result has 110 places, 118 transitions, 1068 flow [2024-06-04 15:39:13,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1068, PETRI_PLACES=110, PETRI_TRANSITIONS=118} [2024-06-04 15:39:13,009 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-06-04 15:39:13,009 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 118 transitions, 1068 flow [2024-06-04 15:39:13,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:13,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:39:13,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:13,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:39:13,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:39:13,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:39:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash 968792019, now seen corresponding path program 1 times [2024-06-04 15:39:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:39:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044111694] [2024-06-04 15:39:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:39:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:39:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:39:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:39:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:39:16,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044111694] [2024-06-04 15:39:16,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044111694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:39:16,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:39:16,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:39:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335304845] [2024-06-04 15:39:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:39:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:39:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:39:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:39:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:39:16,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:39:16,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 118 transitions, 1068 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:16,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:39:16,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:39:16,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:39:18,798 INFO L124 PetriNetUnfolderBase]: 7293/10247 cut-off events. [2024-06-04 15:39:18,798 INFO L125 PetriNetUnfolderBase]: For 22711/22799 co-relation queries the response was YES. [2024-06-04 15:39:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32317 conditions, 10247 events. 7293/10247 cut-off events. For 22711/22799 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 52585 event pairs, 2019 based on Foata normal form. 79/10310 useless extension candidates. Maximal degree in co-relation 32269. Up to 9334 conditions per place. [2024-06-04 15:39:18,852 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 110 selfloop transitions, 50 changer transitions 0/166 dead transitions. [2024-06-04 15:39:18,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 166 transitions, 1605 flow [2024-06-04 15:39:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:39:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:39:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-04 15:39:18,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725 [2024-06-04 15:39:18,854 INFO L175 Difference]: Start difference. First operand has 110 places, 118 transitions, 1068 flow. Second operand 8 states and 189 transitions. [2024-06-04 15:39:18,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 166 transitions, 1605 flow [2024-06-04 15:39:18,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 166 transitions, 1470 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-04 15:39:18,894 INFO L231 Difference]: Finished difference. Result has 115 places, 122 transitions, 1112 flow [2024-06-04 15:39:18,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1112, PETRI_PLACES=115, PETRI_TRANSITIONS=122} [2024-06-04 15:39:18,894 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2024-06-04 15:39:18,895 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 122 transitions, 1112 flow [2024-06-04 15:39:18,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:18,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:39:18,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:18,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:39:18,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:39:18,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:39:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1605988029, now seen corresponding path program 2 times [2024-06-04 15:39:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:39:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040813235] [2024-06-04 15:39:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:39:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:39:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:39:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:39:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:39:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040813235] [2024-06-04 15:39:22,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040813235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:39:22,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:39:22,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:39:22,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433603655] [2024-06-04 15:39:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:39:22,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:39:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:39:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:39:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:39:22,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-06-04 15:39:22,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 122 transitions, 1112 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:22,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:39:22,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-06-04 15:39:22,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:39:24,831 INFO L124 PetriNetUnfolderBase]: 7268/10201 cut-off events. [2024-06-04 15:39:24,831 INFO L125 PetriNetUnfolderBase]: For 21991/22079 co-relation queries the response was YES. [2024-06-04 15:39:24,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31322 conditions, 10201 events. 7268/10201 cut-off events. For 21991/22079 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 52384 event pairs, 2423 based on Foata normal form. 91/10276 useless extension candidates. Maximal degree in co-relation 31272. Up to 9686 conditions per place. [2024-06-04 15:39:24,874 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 100 selfloop transitions, 47 changer transitions 0/153 dead transitions. [2024-06-04 15:39:24,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 153 transitions, 1522 flow [2024-06-04 15:39:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:39:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:39:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-04 15:39:24,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425 [2024-06-04 15:39:24,875 INFO L175 Difference]: Start difference. First operand has 115 places, 122 transitions, 1112 flow. Second operand 8 states and 177 transitions. [2024-06-04 15:39:24,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 153 transitions, 1522 flow [2024-06-04 15:39:24,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 153 transitions, 1408 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-04 15:39:24,910 INFO L231 Difference]: Finished difference. Result has 119 places, 123 transitions, 1122 flow [2024-06-04 15:39:24,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1122, PETRI_PLACES=119, PETRI_TRANSITIONS=123} [2024-06-04 15:39:24,911 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2024-06-04 15:39:24,911 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 123 transitions, 1122 flow [2024-06-04 15:39:24,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:24,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:39:24,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:24,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:39:24,912 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:39:24,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:39:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1854229737, now seen corresponding path program 1 times [2024-06-04 15:39:24,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:39:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077490464] [2024-06-04 15:39:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:39:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:39:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:39:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:39:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:39:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077490464] [2024-06-04 15:39:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077490464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:39:27,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:39:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:39:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858945132] [2024-06-04 15:39:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:39:27,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:39:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:39:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:39:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:39:27,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-04 15:39:27,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 1122 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:27,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:39:27,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-04 15:39:27,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:39:29,701 INFO L124 PetriNetUnfolderBase]: 7305/10399 cut-off events. [2024-06-04 15:39:29,701 INFO L125 PetriNetUnfolderBase]: For 19478/19560 co-relation queries the response was YES. [2024-06-04 15:39:29,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31854 conditions, 10399 events. 7305/10399 cut-off events. For 19478/19560 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 54150 event pairs, 2677 based on Foata normal form. 40/10429 useless extension candidates. Maximal degree in co-relation 31803. Up to 9966 conditions per place. [2024-06-04 15:39:29,765 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 96 selfloop transitions, 51 changer transitions 0/155 dead transitions. [2024-06-04 15:39:29,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 155 transitions, 1611 flow [2024-06-04 15:39:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:39:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:39:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-06-04 15:39:29,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-04 15:39:29,767 INFO L175 Difference]: Start difference. First operand has 119 places, 123 transitions, 1122 flow. Second operand 7 states and 165 transitions. [2024-06-04 15:39:29,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 155 transitions, 1611 flow [2024-06-04 15:39:29,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 155 transitions, 1490 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 15:39:29,807 INFO L231 Difference]: Finished difference. Result has 122 places, 133 transitions, 1268 flow [2024-06-04 15:39:29,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1268, PETRI_PLACES=122, PETRI_TRANSITIONS=133} [2024-06-04 15:39:29,808 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 69 predicate places. [2024-06-04 15:39:29,808 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 133 transitions, 1268 flow [2024-06-04 15:39:29,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:39:29,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:39:29,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:29,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 15:39:29,809 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 15:39:29,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:39:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1874560777, now seen corresponding path program 1 times [2024-06-04 15:39:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:39:29,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267646487] [2024-06-04 15:39:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:39:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:39:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:39:29,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:39:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:39:29,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:39:29,881 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:39:29,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-04 15:39:29,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-04 15:39:29,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-04 15:39:29,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-04 15:39:29,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-04 15:39:29,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-04 15:39:29,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-04 15:39:29,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-04 15:39:29,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 15:39:29,885 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:39:29,890 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:39:29,897 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:39:29,942 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,948 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,948 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,948 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,948 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,954 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,955 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,956 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,956 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,956 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,957 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,957 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,957 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,957 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,957 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,957 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,958 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,958 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,958 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,958 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,958 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,958 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:39:29,961 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:39:29,972 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-04 15:39:29,972 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-04 15:39:29,973 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:39:29 BasicIcfg [2024-06-04 15:39:29,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:39:29,973 INFO L158 Benchmark]: Toolchain (without parser) took 85792.11ms. Allocated memory was 184.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 109.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 679.9MB. Max. memory is 16.1GB. [2024-06-04 15:39:29,974 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:39:29,974 INFO L158 Benchmark]: Witness Parser took 0.46ms. Allocated memory is still 184.5MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:39:29,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 922.05ms. Allocated memory is still 184.5MB. Free memory was 109.2MB in the beginning and 144.3MB in the end (delta: -35.1MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-06-04 15:39:29,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.98ms. Allocated memory is still 184.5MB. Free memory was 144.3MB in the beginning and 139.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 15:39:29,975 INFO L158 Benchmark]: Boogie Preprocessor took 125.77ms. Allocated memory is still 184.5MB. Free memory was 139.0MB in the beginning and 133.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:39:29,975 INFO L158 Benchmark]: RCFGBuilder took 1593.65ms. Allocated memory was 184.5MB in the beginning and 299.9MB in the end (delta: 115.3MB). Free memory was 133.8MB in the beginning and 159.7MB in the end (delta: -26.0MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-06-04 15:39:29,975 INFO L158 Benchmark]: TraceAbstraction took 83034.81ms. Allocated memory was 299.9MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 158.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 611.6MB. Max. memory is 16.1GB. [2024-06-04 15:39:29,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.46ms. Allocated memory is still 184.5MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 922.05ms. Allocated memory is still 184.5MB. Free memory was 109.2MB in the beginning and 144.3MB in the end (delta: -35.1MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.98ms. Allocated memory is still 184.5MB. Free memory was 144.3MB in the beginning and 139.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.77ms. Allocated memory is still 184.5MB. Free memory was 139.0MB in the beginning and 133.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1593.65ms. Allocated memory was 184.5MB in the beginning and 299.9MB in the end (delta: 115.3MB). Free memory was 133.8MB in the beginning and 159.7MB in the end (delta: -26.0MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * TraceAbstraction took 83034.81ms. Allocated memory was 299.9MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 158.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 611.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 867]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [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$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2165; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 //@ ghost multithreaded = 1; [L861] FCALL, FORK 0 pthread_create(&t2165, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2165=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] 0 pthread_t t2166; [L863] 0 //@ assert ((((((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))); [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] FCALL, FORK 0 pthread_create(&t2166, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2165=-1, t2166=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 x [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 pthread_t t2167; [L865] 0 //@ assert ((((((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))); [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] FCALL, FORK 0 pthread_create(&t2167, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2165=-1, t2166=0, t2167=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 x [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L865] 0 __unbuffered_p2_EAX$read_delayed_var [L866] 0 pthread_t t2168; [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] EXPR 3 \read(x) [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L805] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L806] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L807] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L808] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L810] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L812] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L813] EXPR 3 \read(x) [L813] 3 __unbuffered_p2_EAX = x [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] 3 x = x$flush_delayed ? x$mem_tmp : x [L815] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L867] 0 //@ assert ((((((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2165=-1, t2166=0, t2167=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 863]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 861]: 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: 863]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 82.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1029 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4297 IncrementalHoareTripleChecker+Invalid, 4519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 28 mSDtfsCounter, 4297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1268occurred in iteration=16, InterpolantAutomatonStates: 108, 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, 47.8s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 23765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-04 15:39:30,009 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