./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/safe006_power.opt-thin000_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/safe006_power.opt-thin000_power.opt.i ./goblint.2024-05-07_14-17-48.files/protection/safe006_power.opt-thin000_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:35:26,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:35:26,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:35:26,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:35:26,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:35:26,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:35:26,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:35:26,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:35:26,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:35:26,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:35:26,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:35:26,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:35:26,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:35:26,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:35:26,629 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:35:26,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:35:26,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:35:26,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:35:26,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:35:26,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:35:26,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:35:26,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:35:26,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:35:26,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:35:26,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:35:26,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:35:26,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:35:26,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:35:26,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:35:26,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:35:26,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:35:26,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:35:26,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:35:26,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:35:26,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:35:26,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:35:26,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:35:26,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:35:26,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:35:26,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:35:26,636 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:35:26,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:35:26,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:35:26,637 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 [2024-05-12 13:35:26,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:35:26,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:35:26,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:35:26,867 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:35:26,868 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:35:26,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/safe006_power.opt-thin000_power.opt.yml/witness.yml [2024-05-12 13:35:27,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:35:27,045 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:35:27,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-05-12 13:35:28,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:35:28,323 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:35:28,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-05-12 13:35:28,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a8296a5/b78964018531496ebf9e9fd850f0189b/FLAGedd2835f6 [2024-05-12 13:35:28,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a8296a5/b78964018531496ebf9e9fd850f0189b [2024-05-12 13:35:28,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:35:28,345 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:35:28,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:35:28,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:35:28,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:35:28,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:35:27" (1/2) ... [2024-05-12 13:35:28,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a12e217 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:35:28, skipping insertion in model container [2024-05-12 13:35:28,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:35:27" (1/2) ... [2024-05-12 13:35:28,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@797da624 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:35:28, skipping insertion in model container [2024-05-12 13:35:28,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:35:28" (2/2) ... [2024-05-12 13:35:28,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a12e217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28, skipping insertion in model container [2024-05-12 13:35:28,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:35:28" (2/2) ... [2024-05-12 13:35:28,355 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:35:28,426 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:35:28,427 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((((((((((((! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0) [2024-05-12 13:35:28,427 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] (((((((((((((((((((((((((((! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0) [2024-05-12 13:35:28,427 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:35:28,428 INFO L106 edCorrectnessWitness]: ghost_update [L826-L826] multithreaded = 1; [2024-05-12 13:35:28,463 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:35:28,614 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2024-05-12 13:35:28,824 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:35:28,836 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:35:28,863 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:35:28,934 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:35:28,982 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:35:28,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28 WrapperNode [2024-05-12 13:35:28,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:35:28,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:35:28,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:35:28,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:35:28,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,053 INFO L138 Inliner]: procedures = 175, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 216 [2024-05-12 13:35:29,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:35:29,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:35:29,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:35:29,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:35:29,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,098 INFO L175 MemorySlicer]: Split 36 memory accesses to 4 slices as follows [2, 32, 1, 1]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 7 writes are split as follows [0, 5, 1, 1]. [2024-05-12 13:35:29,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:35:29,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:35:29,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:35:29,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:35:29,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (1/1) ... [2024-05-12 13:35:29,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:35:29,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:35:29,193 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-05-12 13:35:29,212 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-05-12 13:35:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:35:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:35:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 13:35:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 13:35:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:35:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:35:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:35:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 13:35:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:35:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:35:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:35:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:35:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:35:29,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:35:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:35:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:35:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:35:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:35:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:35:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 13:35:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:35:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:35:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:35:29,230 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:35:29,381 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:35:29,383 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:35:29,810 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:35:29,811 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:35:30,043 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:35:30,044 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:35:30,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:35:30 BoogieIcfgContainer [2024-05-12 13:35:30,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:35:30,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:35:30,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:35:30,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:35:30,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:35:27" (1/4) ... [2024-05-12 13:35:30,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fe704 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:35:30, skipping insertion in model container [2024-05-12 13:35:30,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:35:28" (2/4) ... [2024-05-12 13:35:30,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fe704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:35:30, skipping insertion in model container [2024-05-12 13:35:30,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:35:28" (3/4) ... [2024-05-12 13:35:30,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8fe704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:35:30, skipping insertion in model container [2024-05-12 13:35:30,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:35:30" (4/4) ... [2024-05-12 13:35:30,053 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2024-05-12 13:35:30,067 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:35:30,068 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 13:35:30,068 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:35:30,123 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:35:30,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 13:35:30,189 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-05-12 13:35:30,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:35:30,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-05-12 13:35:30,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 13:35:30,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-05-12 13:35:30,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:35:30,206 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;@497f0d35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:35:30,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 13:35:30,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:35:30,209 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:35:30,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:35:30,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:30,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:35:30,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:30,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash 136477534, now seen corresponding path program 1 times [2024-05-12 13:35:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320029403] [2024-05-12 13:35:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:32,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320029403] [2024-05-12 13:35:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320029403] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:35:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015934429] [2024-05-12 13:35:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:32,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:35:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:32,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:35:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:35:32,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:35:32,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-05-12 13:35:32,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:32,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:35:32,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:32,433 INFO L124 PetriNetUnfolderBase]: 523/985 cut-off events. [2024-05-12 13:35:32,434 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-05-12 13:35:32,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 985 events. 523/985 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5153 event pairs, 234 based on Foata normal form. 36/921 useless extension candidates. Maximal degree in co-relation 1862. Up to 862 conditions per place. [2024-05-12 13:35:32,440 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 31 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2024-05-12 13:35:32,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 183 flow [2024-05-12 13:35:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:35:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:35:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-05-12 13:35:32,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 13:35:32,450 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 4 states and 78 transitions. [2024-05-12 13:35:32,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 183 flow [2024-05-12 13:35:32,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:32,453 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 129 flow [2024-05-12 13:35:32,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-05-12 13:35:32,457 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-05-12 13:35:32,457 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 129 flow [2024-05-12 13:35:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-05-12 13:35:32,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:32,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:32,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:35:32,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:32,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash -64151504, now seen corresponding path program 1 times [2024-05-12 13:35:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109352306] [2024-05-12 13:35:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:32,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109352306] [2024-05-12 13:35:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109352306] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:35:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529155209] [2024-05-12 13:35:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:32,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:35:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:35:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:35:32,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 13:35:32,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-05-12 13:35:32,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:32,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 13:35:32,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:32,639 INFO L124 PetriNetUnfolderBase]: 210/472 cut-off events. [2024-05-12 13:35:32,640 INFO L125 PetriNetUnfolderBase]: For 75/78 co-relation queries the response was YES. [2024-05-12 13:35:32,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 472 events. 210/472 cut-off events. For 75/78 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2513 event pairs, 108 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 959. Up to 304 conditions per place. [2024-05-12 13:35:32,642 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 33 selfloop transitions, 4 changer transitions 2/50 dead transitions. [2024-05-12 13:35:32,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 223 flow [2024-05-12 13:35:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:35:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:35:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-05-12 13:35:32,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-05-12 13:35:32,644 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 129 flow. Second operand 3 states and 75 transitions. [2024-05-12 13:35:32,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 223 flow [2024-05-12 13:35:32,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 223 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 13:35:32,646 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 121 flow [2024-05-12 13:35:32,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-05-12 13:35:32,646 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-05-12 13:35:32,647 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 121 flow [2024-05-12 13:35:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-05-12 13:35:32,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:32,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:32,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:35:32,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:32,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1530220092, now seen corresponding path program 1 times [2024-05-12 13:35:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895079232] [2024-05-12 13:35:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895079232] [2024-05-12 13:35:34,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895079232] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:34,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:34,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:34,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122780802] [2024-05-12 13:35:34,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:34,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:34,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:34,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:34,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:34,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-05-12 13:35:34,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:34,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:34,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:34,655 INFO L124 PetriNetUnfolderBase]: 466/895 cut-off events. [2024-05-12 13:35:34,655 INFO L125 PetriNetUnfolderBase]: For 188/191 co-relation queries the response was YES. [2024-05-12 13:35:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 895 events. 466/895 cut-off events. For 188/191 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4341 event pairs, 222 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 1917. Up to 754 conditions per place. [2024-05-12 13:35:34,659 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 34 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2024-05-12 13:35:34,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 264 flow [2024-05-12 13:35:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-05-12 13:35:34,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-05-12 13:35:34,661 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 121 flow. Second operand 6 states and 92 transitions. [2024-05-12 13:35:34,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 264 flow [2024-05-12 13:35:34,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:34,663 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 196 flow [2024-05-12 13:35:34,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-05-12 13:35:34,663 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-05-12 13:35:34,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 196 flow [2024-05-12 13:35:34,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-05-12 13:35:34,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:34,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:34,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:35:34,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:34,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1520043102, now seen corresponding path program 2 times [2024-05-12 13:35:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174910505] [2024-05-12 13:35:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174910505] [2024-05-12 13:35:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174910505] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:35,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861945941] [2024-05-12 13:35:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:35,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:36,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:36,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-05-12 13:35:36,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:36,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:36,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:36,335 INFO L124 PetriNetUnfolderBase]: 468/899 cut-off events. [2024-05-12 13:35:36,336 INFO L125 PetriNetUnfolderBase]: For 272/278 co-relation queries the response was YES. [2024-05-12 13:35:36,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 899 events. 468/899 cut-off events. For 272/278 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4347 event pairs, 222 based on Foata normal form. 4/861 useless extension candidates. Maximal degree in co-relation 2083. Up to 756 conditions per place. [2024-05-12 13:35:36,340 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 35 selfloop transitions, 13 changer transitions 0/54 dead transitions. [2024-05-12 13:35:36,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 320 flow [2024-05-12 13:35:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:35:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:35:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-05-12 13:35:36,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-05-12 13:35:36,343 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 196 flow. Second operand 5 states and 82 transitions. [2024-05-12 13:35:36,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 320 flow [2024-05-12 13:35:36,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:36,349 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 230 flow [2024-05-12 13:35:36,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-05-12 13:35:36,350 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-05-12 13:35:36,350 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 230 flow [2024-05-12 13:35:36,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-05-12 13:35:36,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:36,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:36,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:35:36,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:36,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1520030082, now seen corresponding path program 3 times [2024-05-12 13:35:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696982312] [2024-05-12 13:35:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696982312] [2024-05-12 13:35:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696982312] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160034509] [2024-05-12 13:35:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:37,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:37,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:37,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:37,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-05-12 13:35:37,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:37,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:37,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:37,980 INFO L124 PetriNetUnfolderBase]: 470/902 cut-off events. [2024-05-12 13:35:37,980 INFO L125 PetriNetUnfolderBase]: For 446/452 co-relation queries the response was YES. [2024-05-12 13:35:37,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 902 events. 470/902 cut-off events. For 446/452 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4378 event pairs, 174 based on Foata normal form. 4/865 useless extension candidates. Maximal degree in co-relation 2164. Up to 743 conditions per place. [2024-05-12 13:35:37,984 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 49 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2024-05-12 13:35:37,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 442 flow [2024-05-12 13:35:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-05-12 13:35:37,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2024-05-12 13:35:37,988 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 230 flow. Second operand 6 states and 101 transitions. [2024-05-12 13:35:37,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 442 flow [2024-05-12 13:35:37,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 404 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 13:35:37,990 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 292 flow [2024-05-12 13:35:37,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-05-12 13:35:37,991 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-05-12 13:35:37,991 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 292 flow [2024-05-12 13:35:37,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-05-12 13:35:37,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:37,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:37,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:35:37,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:37,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1531071758, now seen corresponding path program 1 times [2024-05-12 13:35:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:37,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856947918] [2024-05-12 13:35:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856947918] [2024-05-12 13:35:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856947918] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:35:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533059320] [2024-05-12 13:35:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:38,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:35:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:35:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:35:38,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:35:38,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-05-12 13:35:38,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:38,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:35:38,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:39,390 INFO L124 PetriNetUnfolderBase]: 472/935 cut-off events. [2024-05-12 13:35:39,390 INFO L125 PetriNetUnfolderBase]: For 615/624 co-relation queries the response was YES. [2024-05-12 13:35:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 935 events. 472/935 cut-off events. For 615/624 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4588 event pairs, 234 based on Foata normal form. 9/874 useless extension candidates. Maximal degree in co-relation 2352. Up to 799 conditions per place. [2024-05-12 13:35:39,394 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 41 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2024-05-12 13:35:39,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 431 flow [2024-05-12 13:35:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:35:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:35:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-05-12 13:35:39,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-05-12 13:35:39,395 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 292 flow. Second operand 5 states and 83 transitions. [2024-05-12 13:35:39,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 431 flow [2024-05-12 13:35:39,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 407 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-05-12 13:35:39,398 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 337 flow [2024-05-12 13:35:39,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2024-05-12 13:35:39,399 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-05-12 13:35:39,399 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 337 flow [2024-05-12 13:35:39,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-05-12 13:35:39,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:39,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:35:39,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:39,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 123723392, now seen corresponding path program 1 times [2024-05-12 13:35:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952424416] [2024-05-12 13:35:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:41,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:41,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952424416] [2024-05-12 13:35:41,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952424416] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:41,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:35:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797869249] [2024-05-12 13:35:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:41,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:35:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:35:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:35:41,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:41,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 337 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-05-12 13:35:41,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:41,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:41,663 INFO L124 PetriNetUnfolderBase]: 469/905 cut-off events. [2024-05-12 13:35:41,664 INFO L125 PetriNetUnfolderBase]: For 646/674 co-relation queries the response was YES. [2024-05-12 13:35:41,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 905 events. 469/905 cut-off events. For 646/674 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4412 event pairs, 148 based on Foata normal form. 7/876 useless extension candidates. Maximal degree in co-relation 2421. Up to 715 conditions per place. [2024-05-12 13:35:41,669 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 54 selfloop transitions, 26 changer transitions 0/86 dead transitions. [2024-05-12 13:35:41,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 615 flow [2024-05-12 13:35:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-05-12 13:35:41,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2024-05-12 13:35:41,670 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 337 flow. Second operand 6 states and 110 transitions. [2024-05-12 13:35:41,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 615 flow [2024-05-12 13:35:41,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:35:41,674 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 471 flow [2024-05-12 13:35:41,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-05-12 13:35:41,675 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-05-12 13:35:41,675 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 471 flow [2024-05-12 13:35:41,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-05-12 13:35:41,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:41,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:35:41,676 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:41,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash -472485055, now seen corresponding path program 1 times [2024-05-12 13:35:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945405142] [2024-05-12 13:35:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945405142] [2024-05-12 13:35:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945405142] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:43,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:35:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813799589] [2024-05-12 13:35:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:43,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:35:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:35:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:35:43,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:43,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-05-12 13:35:43,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:43,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:43,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:43,537 INFO L124 PetriNetUnfolderBase]: 470/907 cut-off events. [2024-05-12 13:35:43,537 INFO L125 PetriNetUnfolderBase]: For 1150/1182 co-relation queries the response was YES. [2024-05-12 13:35:43,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 907 events. 470/907 cut-off events. For 1150/1182 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4426 event pairs, 156 based on Foata normal form. 8/879 useless extension candidates. Maximal degree in co-relation 2663. Up to 757 conditions per place. [2024-05-12 13:35:43,541 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 53 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-05-12 13:35:43,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 642 flow [2024-05-12 13:35:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:35:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:35:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-05-12 13:35:43,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-05-12 13:35:43,543 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 471 flow. Second operand 6 states and 92 transitions. [2024-05-12 13:35:43,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 642 flow [2024-05-12 13:35:43,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 606 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-05-12 13:35:43,546 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 484 flow [2024-05-12 13:35:43,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=484, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-05-12 13:35:43,548 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-05-12 13:35:43,548 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 484 flow [2024-05-12 13:35:43,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-05-12 13:35:43,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:43,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:43,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:35:43,549 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:43,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -459525505, now seen corresponding path program 2 times [2024-05-12 13:35:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087871407] [2024-05-12 13:35:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:45,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:45,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087871407] [2024-05-12 13:35:45,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087871407] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:45,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:45,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:35:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284544583] [2024-05-12 13:35:45,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:45,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:35:45,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:35:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:35:45,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:45,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-05-12 13:35:45,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:45,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:45,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:45,943 INFO L124 PetriNetUnfolderBase]: 471/911 cut-off events. [2024-05-12 13:35:45,943 INFO L125 PetriNetUnfolderBase]: For 1180/1206 co-relation queries the response was YES. [2024-05-12 13:35:45,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 911 events. 471/911 cut-off events. For 1180/1206 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4485 event pairs, 96 based on Foata normal form. 8/883 useless extension candidates. Maximal degree in co-relation 2698. Up to 675 conditions per place. [2024-05-12 13:35:45,948 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 63 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2024-05-12 13:35:45,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 782 flow [2024-05-12 13:35:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:35:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:35:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-05-12 13:35:45,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 13:35:45,950 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 484 flow. Second operand 7 states and 126 transitions. [2024-05-12 13:35:45,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 782 flow [2024-05-12 13:35:45,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 741 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 13:35:45,955 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 550 flow [2024-05-12 13:35:45,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2024-05-12 13:35:45,955 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-05-12 13:35:45,956 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 550 flow [2024-05-12 13:35:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-05-12 13:35:45,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:45,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:45,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:35:45,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:45,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash -459540385, now seen corresponding path program 3 times [2024-05-12 13:35:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303884247] [2024-05-12 13:35:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:45,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:35:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:35:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:35:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303884247] [2024-05-12 13:35:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303884247] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:35:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:35:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:35:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575043896] [2024-05-12 13:35:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:35:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:35:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:35:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:35:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:35:47,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 13:35:47,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 550 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-05-12 13:35:47,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:35:47,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 13:35:47,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:35:48,522 INFO L124 PetriNetUnfolderBase]: 472/911 cut-off events. [2024-05-12 13:35:48,522 INFO L125 PetriNetUnfolderBase]: For 1384/1412 co-relation queries the response was YES. [2024-05-12 13:35:48,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2838 conditions, 911 events. 472/911 cut-off events. For 1384/1412 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4466 event pairs, 143 based on Foata normal form. 8/883 useless extension candidates. Maximal degree in co-relation 2801. Up to 723 conditions per place. [2024-05-12 13:35:48,527 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 62 selfloop transitions, 25 changer transitions 0/93 dead transitions. [2024-05-12 13:35:48,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 800 flow [2024-05-12 13:35:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:35:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:35:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-05-12 13:35:48,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 13:35:48,528 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 550 flow. Second operand 8 states and 128 transitions. [2024-05-12 13:35:48,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 800 flow [2024-05-12 13:35:48,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 696 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-05-12 13:35:48,532 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 521 flow [2024-05-12 13:35:48,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=521, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2024-05-12 13:35:48,533 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-05-12 13:35:48,533 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 521 flow [2024-05-12 13:35:48,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-05-12 13:35:48,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:35:48,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:35:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:35:48,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:35:48,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:35:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1814201403, now seen corresponding path program 1 times [2024-05-12 13:35:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:35:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058664162] [2024-05-12 13:35:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:35:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:35:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:35:48,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:35:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:35:48,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:35:48,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:35:48,607 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 7 remaining) [2024-05-12 13:35:48,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 13:35:48,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 13:35:48,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-12 13:35:48,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 13:35:48,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 13:35:48,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 13:35:48,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:35:48,610 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2024-05-12 13:35:48,615 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:35:48,615 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:35:48,635 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,637 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,637 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,638 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:35:48,641 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-05-12 13:35:48,649 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 13:35:48,649 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 13:35:48,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:35:48 BasicIcfg [2024-05-12 13:35:48,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:35:48,650 INFO L158 Benchmark]: Toolchain (without parser) took 20305.05ms. Allocated memory was 195.0MB in the beginning and 872.4MB in the end (delta: 677.4MB). Free memory was 162.1MB in the beginning and 676.6MB in the end (delta: -514.4MB). Peak memory consumption was 162.4MB. Max. memory is 16.1GB. [2024-05-12 13:35:48,650 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:35:48,664 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:35:48,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.93ms. Allocated memory is still 195.0MB. Free memory was 161.5MB in the beginning and 122.7MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-05-12 13:35:48,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.84ms. Allocated memory is still 195.0MB. Free memory was 122.7MB in the beginning and 119.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:35:48,665 INFO L158 Benchmark]: Boogie Preprocessor took 92.89ms. Allocated memory is still 195.0MB. Free memory was 119.6MB in the beginning and 114.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-05-12 13:35:48,665 INFO L158 Benchmark]: RCFGBuilder took 897.64ms. Allocated memory is still 195.0MB. Free memory was 114.4MB in the beginning and 87.9MB in the end (delta: 26.4MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2024-05-12 13:35:48,665 INFO L158 Benchmark]: TraceAbstraction took 18602.61ms. Allocated memory was 195.0MB in the beginning and 872.4MB in the end (delta: 677.4MB). Free memory was 86.9MB in the beginning and 676.6MB in the end (delta: -589.7MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-05-12 13:35:48,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.93ms. Allocated memory is still 195.0MB. Free memory was 161.5MB in the beginning and 122.7MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.84ms. Allocated memory is still 195.0MB. Free memory was 122.7MB in the beginning and 119.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.89ms. Allocated memory is still 195.0MB. Free memory was 119.6MB in the beginning and 114.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 897.64ms. Allocated memory is still 195.0MB. Free memory was 114.4MB in the beginning and 87.9MB in the end (delta: 26.4MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18602.61ms. Allocated memory was 195.0MB in the beginning and 872.4MB in the end (delta: 677.4MB). Free memory was 86.9MB in the beginning and 676.6MB in the end (delta: -589.7MB). Peak memory consumption was 87.7MB. 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: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 829]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={6: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L826] 0 //@ ghost multithreaded = 1; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={6: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L827] 0 pthread_t t1924; [L828] 0 //@ assert ((((((((((((((((((((((((((((!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))); [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 x [L828] 0 x [L828] 0 x [L828] 0 x [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={6:0}, t1924={5: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 x [L828] 0 x [L828] 0 x [L828] 0 x [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L829] 0 //@ assert ((((((((((((((((((((((((((((!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923={6:0}, t1924={5:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 826]: 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 5 procedures, 53 locations, 7 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: 18.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1803 IncrementalHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1 mSDtfsCounter, 1803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=9, InterpolantAutomatonStates: 56, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 6964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-05-12 13:35:48,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE